About the Execution of ITS-Tools for ShieldIIPs-PT-040B
| 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 | TTTFTT???F?F?F?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532600387.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 ShieldIIPs-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532600387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 675K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749082379876
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 00:13:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 00:13:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:13:01] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-05 00:13:01] [INFO ] Transformed 2403 places.
[2025-06-05 00:13:01] [INFO ] Transformed 2363 transitions.
[2025-06-05 00:13:01] [INFO ] Found NUPN structural information;
[2025-06-05 00:13:01] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 268 place count 2135 transition count 2095
Iterating global reduction 0 with 268 rules applied. Total rules applied 536 place count 2135 transition count 2095
Applied a total of 536 rules in 434 ms. Remains 2135 /2403 variables (removed 268) and now considering 2095/2363 (removed 268) transitions.
// Phase 1: matrix 2095 rows 2135 cols
[2025-06-05 00:13:02] [INFO ] Computed 361 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:03] [INFO ] Implicit Places using invariants in 978 ms returned []
[2025-06-05 00:13:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:05] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
Running 2094 sub problems to find dead transitions.
[2025-06-05 00:13:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2134/4230 variables, and 0 constraints, problems are : Problem set: 0 solved, 2094 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2135 constraints, PredecessorRefiner: 2094/2094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2094 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2134/4230 variables, and 0 constraints, problems are : Problem set: 0 solved, 2094 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2135 constraints, PredecessorRefiner: 0/2094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60786ms problems are : Problem set: 0 solved, 2094 unsolved
Search for dead transitions found 0 dead transitions in 60810ms
Starting structural reductions in LTL mode, iteration 1 : 2135/2403 places, 2095/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64278 ms. Remains : 2135/2403 places, 2095/2363 transitions.
Support contains 35 out of 2135 places after structural reductions.
[2025-06-05 00:14:06] [INFO ] Flatten gal took : 178 ms
[2025-06-05 00:14:06] [INFO ] Flatten gal took : 97 ms
[2025-06-05 00:14:06] [INFO ] Input system was already deterministic with 2095 transitions.
RANDOM walk for 40000 steps (8 resets) in 1509 ms. (26 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
[2025-06-05 00:14:07] [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, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2029/2135 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:08] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:08] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:08] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:09] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:09] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:09] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:09] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:09] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:10] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 47 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-05 00:14:11] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2135 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:11] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:12] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2135 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 1.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 1.0)
(s856 0.0)
(s857 0.0)
(s858 1.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 1.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 1.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 1.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 0.0)
(s948 1.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 1.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 1.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 1.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 0.0)
(s997 1.0)
(s998 0.0)
(s999 1.0)
(s1000 0.0)
(s1001 0.0)
(s1002 1.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 1.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 1.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 1.0)
(s1050 1.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 1.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 1.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 1.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 1.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 1.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 1.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 1.0)
(s1099 0.0)
(s1100 1.0)
(s1101 0.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 1.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 1.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 1.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 1.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 1.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 1.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 1.0)
(s1153 0.0)
(s1154 1.0)
(s1155 1.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 1.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 1.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 1.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 1.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 1.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 1.0)
(s1206 0.0)
(s1207 0.0)
(s1208 1.0)
(s1209 1.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 1.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 1.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 1.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 1.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 1.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 1.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 1.0)
(s1260 1.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 1.0)
(s1265 1.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 1.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 1.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 1.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 1.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 1.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 1.0)
(s1311 0.0)
(s1312 0.0)
(s1313 1.0)
(s1314 0.0)
(s1315 1.0)
(s1316 0.0)
(s1317 1.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 1.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 1.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 1.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 1.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 1.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 1.0)
(s1364 1.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 1.0)
(s1369 1.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 1.0)
(s1380 0.0)
(s1381 1.0)
(s1382 0.0)
(s1383 1.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 1.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 1.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 1.0)
(s1416 1.0)
(s1417 0.0)
(s1418 1.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 1.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 1.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 1.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 1.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 1.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 1.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 1.0)
(s1467 0.0)
(s1468 0.0)
(s1469 1.0)
(s1470 0.0)
(s1471 0.0)
(s1472 1.0)
(s1473 0.0)
(s1474 0.0)
(s1475 1.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 1.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 1.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 1.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 1.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 1.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 1.0)
(s1519 0.0)
(s1520 1.0)
(s1521 0.0)
(s1522 0.0)
(s1523 1.0)
(s1524 0.0)
(s1525 0.0)
(s1526 1.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 1.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 1.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 1.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 1.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 1.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 1.0)
(s1572 1.0)
(s1573 0.0)
(s1574 0.0)
(s1575 1.0)
(s1576 0.0)
(s1577 1.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 1.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 1.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 1.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 1.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 1.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 1.0)
(s1624 1.0)
(s1625 0.0)
(s1626 1.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 1.0)
(s1632 0.0)
(s1633 1.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 1.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 1.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 1.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 1.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 1.0)
(s1676 0.0)
(s1677 1.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 1.0)
(s1682 0.0)
(s1683 0.0)
(s1684 1.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 1.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 1.0)
(s1695 0.0)
(s1696 0.0)
(s1697 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2135/4230 variables, and 386 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/2135 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2029/2135 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2135 variables, 25/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:12] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:13] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:14] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:15] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:15] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:15] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:15] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:15] [INFO ] Deduced a trap composed of 47 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-05 00:14:15] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2135 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2135 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2095/4230 variables, 2135/2541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4230 variables, 3/2544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:16] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:17] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:17] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 43 ms to minimize.
SMT process timed out in 10178ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2135 transition count 1895
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1935 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1934 transition count 1894
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 402 place count 1934 transition count 1694
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 802 place count 1734 transition count 1694
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 814 place count 1722 transition count 1682
Iterating global reduction 3 with 12 rules applied. Total rules applied 826 place count 1722 transition count 1682
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 826 place count 1722 transition count 1678
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 834 place count 1718 transition count 1678
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 3 with 1426 rules applied. Total rules applied 2260 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 275 times.
Drop transitions (Partial Free agglomeration) removed 275 transitions
Iterating global reduction 3 with 275 rules applied. Total rules applied 2535 place count 1005 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2536 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2537 place count 1003 transition count 964
Applied a total of 2537 rules in 532 ms. Remains 1003 /2135 variables (removed 1132) and now considering 964/2095 (removed 1131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 1003/2135 places, 964/2095 transitions.
RANDOM walk for 20467 steps (3 resets) in 423 ms. (48 steps per ms) remains 0/3 properties
Computed a total of 488 stabilizing places and 488 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(p0))'
Support contains 4 out of 2135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2123 transition count 2083
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2123 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2122 transition count 2082
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2122 transition count 2082
Applied a total of 26 rules in 336 ms. Remains 2122 /2135 variables (removed 13) and now considering 2082/2095 (removed 13) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2025-06-05 00:14:18] [INFO ] Computed 361 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:19] [INFO ] Implicit Places using invariants in 779 ms returned []
[2025-06-05 00:14:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:21] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2025-06-05 00:14:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 timeout
1.0)
(s1572 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2135 places, 2082/2095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63670 ms. Remains : 2122/2135 places, 2082/2095 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 544 ms.
Product exploration explored 100000 steps with 50000 reset in 534 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-02 finished in 65049 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(F(p1))&&p0)))'
Support contains 3 out of 2135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2134 transition count 1894
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1934 transition count 1893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1933 transition count 1893
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 402 place count 1933 transition count 1692
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 804 place count 1732 transition count 1692
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 816 place count 1720 transition count 1680
Iterating global reduction 3 with 12 rules applied. Total rules applied 828 place count 1720 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 828 place count 1720 transition count 1676
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 836 place count 1716 transition count 1676
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 3 with 1426 rules applied. Total rules applied 2262 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2264 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2265 place count 1000 transition count 961
Applied a total of 2265 rules in 420 ms. Remains 1000 /2135 variables (removed 1135) and now considering 961/2095 (removed 1134) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2025-06-05 00:15:23] [INFO ] Computed 360 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:24] [INFO ] Implicit Places using invariants in 411 ms returned []
[2025-06-05 00:15:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:25] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:15:25] [INFO ] Redundant transitions in 216 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2025-06-05 00:15:25] [INFO ] Computed 360 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:38] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:38] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:39] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:39] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:39] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:39] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:39] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:40] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:40] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:40] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:40] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:41] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:42] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:43] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 14 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-05 00:15:45] [INFO ] Deduced a trap composed of 14 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-05 00:15:45] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:46] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:47] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:47] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:47] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:47] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:47] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:56] [INFO ] Deduced a trap composed of 16 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-05 00:15:57] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:57] [INFO ] Deduced a trap composed of 14 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-05 00:15:58] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:03] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:03] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:09] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:09] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:09] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:10] [INFO ] Deduced a trap composed of 14 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-05 00:16:10] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:12] [INFO ] Deduced a trap composed of 16 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-05 00:16:13] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:13] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:15] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:16] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:17] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:17] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:18] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:21] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:21] [INFO ] Deduced a trap composed of 10 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-05 00:16:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:22] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:23] [INFO ] Deduced a trap composed of 10 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-05 00:16:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:24] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:24] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 480 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2135 places, 960/2095 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62118 ms. Remains : 1000/2135 places, 960/2095 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-06
Product exploration explored 100000 steps with 148 reset in 746 ms.
Product exploration explored 100000 steps with 142 reset in 961 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (16 resets) in 481 ms. (82 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 353 ms. (113 steps per ms) remains 1/1 properties
[2025-06-05 00:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/37 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/111 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/114 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 101/215 variables, 50/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/217 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 148/365 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/365 variables, 15/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/365 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/375 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/375 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/375 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/379 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/379 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/379 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 124/503 variables, 64/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/503 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/503 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 8/511 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/511 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/511 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 145/656 variables, 68/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/656 variables, 18/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/656 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 10/666 variables, 7/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/666 variables, 10/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/666 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/668 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/668 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 89/757 variables, 50/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/757 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/757 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 6/763 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/763 variables, 6/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/763 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 106/869 variables, 48/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/869 variables, 13/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/869 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 7/876 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/876 variables, 7/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/876 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/878 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/878 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 78/956 variables, 42/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/956 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/956 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 5/961 variables, 7/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/961 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/961 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 104/1065 variables, 46/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1065 variables, 12/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:28] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1065 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1065 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 7/1072 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1072 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1072 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/1074 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1074 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 78/1152 variables, 42/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1152 variables, 12/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1152 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 5/1157 variables, 7/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1157 variables, 5/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1157 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 101/1258 variables, 45/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1258 variables, 12/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1258 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 7/1265 variables, 4/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1265 variables, 7/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1265 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/1267 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1267 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 87 (OVERLAPS) 69/1336 variables, 38/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1336 variables, 10/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1336 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 5/1341 variables, 7/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1341 variables, 5/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1341 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 78/1419 variables, 36/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1419 variables, 10/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1419 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 5/1424 variables, 3/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1424 variables, 5/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1424 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1426 variables, 1/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1426 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 60/1486 variables, 32/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1486 variables, 9/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1486 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 4/1490 variables, 5/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1490 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1490 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 76/1566 variables, 34/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1566 variables, 9/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1566 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 5/1571 variables, 3/1069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1571 variables, 5/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1571 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 2/1573 variables, 1/1075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1573 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 60/1633 variables, 32/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1633 variables, 9/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1633 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 4/1637 variables, 5/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1637 variables, 4/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1637 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 76/1713 variables, 34/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1713 variables, 9/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1713 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 5/1718 variables, 3/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1718 variables, 5/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1718 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/1720 variables, 1/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1720 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 56/1776 variables, 32/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1776 variables, 9/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1776 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 4/1780 variables, 5/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1780 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1780 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 50/1830 variables, 24/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1830 variables, 7/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1830 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 3/1833 variables, 2/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1833 variables, 3/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1833 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 2/1835 variables, 1/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1835 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 42/1877 variables, 22/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1877 variables, 6/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1877 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 3/1880 variables, 3/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1880 variables, 3/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1880 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 47/1927 variables, 22/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1927 variables, 6/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1927 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 3/1930 variables, 2/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1930 variables, 3/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1930 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 2/1932 variables, 1/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1932 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 25/1957 variables, 18/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1957 variables, 5/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1957 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 1/1958 variables, 2/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1958 variables, 1/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1958 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 2/1960 variables, 2/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1960 variables, 1/1361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1960 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 0/1960 variables, 0/1361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/37 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/111 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/112 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/114 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 101/215 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/217 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 148/365 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/365 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/365 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/375 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/375 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/375 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/379 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/379 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/379 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 124/503 variables, 64/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/503 variables, 18/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/503 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/511 variables, 10/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/511 variables, 8/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/511 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 145/656 variables, 68/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/656 variables, 18/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/656 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/666 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/666 variables, 10/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/666 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/668 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/668 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 89/757 variables, 50/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/757 variables, 14/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/757 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 6/763 variables, 9/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/763 variables, 6/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/763 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 106/869 variables, 48/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/869 variables, 13/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/869 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 7/876 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/876 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/876 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/878 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/878 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 78/956 variables, 42/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/956 variables, 12/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/956 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 5/961 variables, 7/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/961 variables, 5/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/961 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 104/1065 variables, 46/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1065 variables, 12/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1065 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:30] [INFO ] Deduced a trap composed of 17 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-05 00:16:30] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:30] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 4 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1065 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:30] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/1065 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1065 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 7/1072 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1072 variables, 7/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1072 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/1074 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1074 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 78/1152 variables, 42/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 12/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1152 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 5/1157 variables, 7/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1157 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1157 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 101/1258 variables, 45/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1258 variables, 12/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1258 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 7/1265 variables, 4/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1265 variables, 7/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1265 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/1267 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1267 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 69/1336 variables, 38/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1336 variables, 10/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1336 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 5/1341 variables, 7/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1341 variables, 5/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1341 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 78/1419 variables, 36/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1419 variables, 10/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1419 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 5/1424 variables, 3/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1424 variables, 5/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1424 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/1426 variables, 1/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1426 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 60/1486 variables, 32/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1486 variables, 9/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1486 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 4/1490 variables, 5/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1490 variables, 4/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1490 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 76/1566 variables, 34/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1566 variables, 9/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1566 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 5/1571 variables, 3/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1571 variables, 5/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1571 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 2/1573 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1573 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 60/1633 variables, 32/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1633 variables, 9/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1633 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 4/1637 variables, 5/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1637 variables, 4/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1637 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 76/1713 variables, 34/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1713 variables, 9/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap along path composed of 16 places in 30 ms of which 3 ms to minimize.
At refinement iteration 126 (INCLUDED_ONLY) 0/1713 variables, 1/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1713 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 5/1718 variables, 3/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1718 variables, 5/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1718 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 2/1720 variables, 1/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1720 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 56/1776 variables, 32/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1776 variables, 9/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1776 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 4/1780 variables, 5/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1780 variables, 4/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1780 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 50/1830 variables, 24/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1830 variables, 7/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap along path composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 141 (INCLUDED_ONLY) 0/1830 variables, 1/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
At refinement iteration 142 (INCLUDED_ONLY) 0/1830 variables, 3/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1830 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 3/1833 variables, 2/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1833 variables, 3/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1833 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/1835 variables, 1/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1835 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 42/1877 variables, 22/1296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1877 variables, 6/1302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1877 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 3/1880 variables, 3/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1880 variables, 3/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1880 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 47/1927 variables, 22/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1927 variables, 6/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1927 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 3/1930 variables, 2/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1930 variables, 3/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1930 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (OVERLAPS) 2/1932 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1932 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 25/1957 variables, 18/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1957 variables, 5/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1957 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 1/1958 variables, 2/1367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1958 variables, 1/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:33] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 9 ms to minimize.
At refinement iteration 168 (INCLUDED_ONLY) 0/1958 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1958 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (OVERLAPS) 2/1960 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1960 variables, 1/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1960 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 0/1960 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5951ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions (Partial Free agglomeration) removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1000 transition count 960
Applied a total of 237 rules in 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1000/1000 places, 960/960 transitions.
RANDOM walk for 15882 steps (2 resets) in 181 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2025-06-05 00:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:35] [INFO ] [Real]Absence check using 360 positive place invariants in 210 ms returned sat
[2025-06-05 00:16:37] [INFO ] [Real]Absence check using state equation in 2232 ms returned sat
[2025-06-05 00:16:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 204 ms returned sat
[2025-06-05 00:16:41] [INFO ] [Nat]Absence check using state equation in 2831 ms returned sat
[2025-06-05 00:16:41] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-05 00:16:52] [INFO ] Added : 435 causal constraints over 87 iterations in 11379 ms. Result :unknown
Could not prove EG (NOT p1)
[2025-06-05 00:16:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:53] [INFO ] [Real]Absence check using 360 positive place invariants in 207 ms returned sat
[2025-06-05 00:16:56] [INFO ] [Real]Absence check using state equation in 2386 ms returned sat
[2025-06-05 00:16:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:56] [INFO ] [Nat]Absence check using 360 positive place invariants in 202 ms returned sat
[2025-06-05 00:16:58] [INFO ] [Nat]Absence check using state equation in 2029 ms returned sat
[2025-06-05 00:16:59] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 42 ms.
[2025-06-05 00:17:11] [INFO ] Added : 505 causal constraints over 101 iterations in 12177 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2025-06-05 00:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:11] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-06-05 00:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:12] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:17:12] [INFO ] Redundant transitions in 119 ms returned []
Running 959 sub problems to find dead transitions.
[2025-06-05 00:17: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/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:25] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:26] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:26] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:26] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:26] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:27] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:27] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:27] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:27] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:27] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:28] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:28] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:28] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:28] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:28] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:29] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:30] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 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-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 10 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-05 00:17:32] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 14 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-05 00:17:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:34] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:34] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:34] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:35] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:35] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:43] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:44] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:44] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:57] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:57] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:58] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:58] [INFO ] Deduced a trap composed of 14 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-05 00:18:02] [INFO ] Deduced a trap composed of 10 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-05 00:18:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:03] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:04] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:04] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:07] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:08] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:09] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:09] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:10] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 472 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61594 ms. Remains : 1000/1000 places, 960/960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (17 resets) in 374 ms. (106 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
[2025-06-05 00:18:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/37 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/111 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/114 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 101/215 variables, 50/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/217 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 148/365 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/365 variables, 15/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/365 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 10/375 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/375 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/375 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/379 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/379 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/379 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 124/503 variables, 64/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/503 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/503 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 8/511 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/511 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/511 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 145/656 variables, 68/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/656 variables, 18/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/656 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 10/666 variables, 7/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/666 variables, 10/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/666 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/668 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/668 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 89/757 variables, 50/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/757 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/757 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 6/763 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/763 variables, 6/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/763 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 106/869 variables, 48/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/869 variables, 13/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/869 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 7/876 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/876 variables, 7/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/876 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/878 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/878 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 78/956 variables, 42/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/956 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/956 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 5/961 variables, 7/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/961 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/961 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 104/1065 variables, 46/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1065 variables, 12/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1065 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 7/1072 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1072 variables, 7/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1072 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 2/1074 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1074 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 78/1152 variables, 42/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1152 variables, 12/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1152 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 5/1157 variables, 7/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1157 variables, 5/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1157 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 101/1258 variables, 45/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1258 variables, 12/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1258 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 7/1265 variables, 4/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1265 variables, 7/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1265 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/1267 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1267 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 69/1336 variables, 38/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1336 variables, 10/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1336 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 5/1341 variables, 7/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1341 variables, 5/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1341 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 78/1419 variables, 36/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1419 variables, 10/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1419 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 5/1424 variables, 3/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1424 variables, 5/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1424 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 2/1426 variables, 1/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1426 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 60/1486 variables, 32/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1486 variables, 9/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1486 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 4/1490 variables, 5/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1490 variables, 4/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1490 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 76/1566 variables, 34/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1566 variables, 9/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1566 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 5/1571 variables, 3/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1571 variables, 5/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1571 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1573 variables, 1/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1573 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 60/1633 variables, 32/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1633 variables, 9/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1633 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 4/1637 variables, 5/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1637 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1637 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 76/1713 variables, 34/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1713 variables, 9/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1713 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 5/1718 variables, 3/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1718 variables, 5/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1718 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 2/1720 variables, 1/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1720 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 56/1776 variables, 32/1208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1776 variables, 9/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1776 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 4/1780 variables, 5/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1780 variables, 4/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1780 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 50/1830 variables, 24/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1830 variables, 7/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1830 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 3/1833 variables, 2/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1833 variables, 3/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1833 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 2/1835 variables, 1/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1835 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 42/1877 variables, 22/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1877 variables, 6/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1877 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 3/1880 variables, 3/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1880 variables, 3/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1880 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 47/1927 variables, 22/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1927 variables, 6/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1927 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 3/1930 variables, 2/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1930 variables, 3/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1930 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 2/1932 variables, 1/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1932 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 25/1957 variables, 18/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1957 variables, 5/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1957 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 1/1958 variables, 2/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1958 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1958 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1960 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1960 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1960 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 0/1960 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/37 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/111 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/112 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/114 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 101/215 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/217 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/217 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 148/365 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/365 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/365 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/375 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/375 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/375 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/379 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/379 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/379 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 124/503 variables, 64/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/503 variables, 18/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/503 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/511 variables, 10/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/511 variables, 8/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/511 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 145/656 variables, 68/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/656 variables, 18/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/656 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/656 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 10/666 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/666 variables, 10/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/666 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/668 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/668 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 89/757 variables, 50/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/757 variables, 14/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/757 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 6/763 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/763 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/763 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 106/869 variables, 48/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/869 variables, 13/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:15] [INFO ] Deduced a trap composed of 23 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-05 00:18:15] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:15] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/869 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/869 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 7/876 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/876 variables, 7/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/876 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/878 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/878 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 78/956 variables, 42/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/956 variables, 12/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/956 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 5/961 variables, 7/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/961 variables, 5/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/961 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 104/1065 variables, 46/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1065 variables, 12/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1065 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 7/1072 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1072 variables, 7/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1072 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1074 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1074 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 78/1152 variables, 42/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1152 variables, 12/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1152 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 5/1157 variables, 7/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1157 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1157 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 101/1258 variables, 45/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1258 variables, 12/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1258 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 7/1265 variables, 4/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1265 variables, 7/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1265 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/1267 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1267 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 69/1336 variables, 38/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1336 variables, 10/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:16] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 4 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1336 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1336 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 5/1341 variables, 7/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1341 variables, 5/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1341 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 78/1419 variables, 36/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1419 variables, 10/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1419 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 5/1424 variables, 3/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1424 variables, 5/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1424 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/1426 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1426 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 60/1486 variables, 32/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1486 variables, 9/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1486 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 4/1490 variables, 5/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1490 variables, 4/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1490 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 76/1566 variables, 34/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1566 variables, 9/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1566 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 5/1571 variables, 3/1075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1571 variables, 5/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1571 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 2/1573 variables, 1/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1573 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 60/1633 variables, 32/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1633 variables, 9/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1633 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 4/1637 variables, 5/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1637 variables, 4/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1637 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 76/1713 variables, 34/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1713 variables, 9/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:16] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 4 ms to minimize.
At refinement iteration 126 (INCLUDED_ONLY) 0/1713 variables, 10/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:17] [INFO ] Deduced a trap along path composed of 16 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:18] [INFO ] Deduced a trap along path composed of 16 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:18] [INFO ] Deduced a trap along path composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 127 (INCLUDED_ONLY) 0/1713 variables, 3/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1713 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 5/1718 variables, 3/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1718 variables, 5/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1718 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/1720 variables, 1/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1720 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 56/1776 variables, 32/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1776 variables, 9/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1776 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 4/1780 variables, 5/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1780 variables, 4/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1780 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 50/1830 variables, 24/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1830 variables, 7/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1830 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 3/1833 variables, 2/1279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1833 variables, 3/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1833 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 2/1835 variables, 1/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1835 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 42/1877 variables, 22/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1877 variables, 6/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1877 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 3/1880 variables, 3/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1880 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1880 variables, 0/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 47/1927 variables, 22/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1927 variables, 6/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1927 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 3/1930 variables, 2/1347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1930 variables, 3/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1930 variables, 0/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 2/1932 variables, 1/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1932 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 25/1957 variables, 18/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1957 variables, 5/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1957 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 1/1958 variables, 2/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1958 variables, 1/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1958 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 2/1960 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1960 variables, 1/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1960 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 0/1960 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4988 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions (Partial Free agglomeration) removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1000 transition count 960
Applied a total of 237 rules in 45 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1000/1000 places, 960/960 transitions.
RANDOM walk for 8967 steps (0 resets) in 152 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 215 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2025-06-05 00:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:18:21] [INFO ] [Real]Absence check using 360 positive place invariants in 199 ms returned sat
[2025-06-05 00:18:23] [INFO ] [Real]Absence check using state equation in 2199 ms returned sat
[2025-06-05 00:18:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:18:24] [INFO ] [Nat]Absence check using 360 positive place invariants in 206 ms returned sat
[2025-06-05 00:18:27] [INFO ] [Nat]Absence check using state equation in 2985 ms returned sat
[2025-06-05 00:18:27] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 46 ms.
[2025-06-05 00:18:38] [INFO ] Added : 420 causal constraints over 84 iterations in 11199 ms. Result :unknown
Could not prove EG (NOT p1)
[2025-06-05 00:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:18:39] [INFO ] [Real]Absence check using 360 positive place invariants in 205 ms returned sat
[2025-06-05 00:18:41] [INFO ] [Real]Absence check using state equation in 2438 ms returned sat
[2025-06-05 00:18: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-05 00:18:42] [INFO ] [Nat]Absence check using 360 positive place invariants in 212 ms returned sat
[2025-06-05 00:18:44] [INFO ] [Nat]Absence check using state equation in 2077 ms returned sat
[2025-06-05 00:18:44] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-05 00:18:56] [INFO ] Added : 495 causal constraints over 99 iterations in 12095 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Product exploration explored 100000 steps with 146 reset in 678 ms.
Product exploration explored 100000 steps with 153 reset in 846 ms.
Built C files in :
/tmp/ltsmin1164928721675844739
[2025-06-05 00:18:58] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2025-06-05 00:18:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:18:58] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2025-06-05 00:18:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:18:58] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2025-06-05 00:18:58] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:18:58] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1164928721675844739
Running compilation step : cd /tmp/ltsmin1164928721675844739;'/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 2970 ms.
Running link step : cd /tmp/ltsmin1164928721675844739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin1164928721675844739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14242904918140893438.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2025-06-05 00:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:13] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-05 00:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:14] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:19:14] [INFO ] Redundant transitions in 101 ms returned []
Running 959 sub problems to find dead transitions.
[2025-06-05 00:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:28] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:28] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:28] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:28] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:29] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:29] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:29] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:29] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:30] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:30] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:30] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:30] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:30] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:31] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:32] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:32] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:32] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:32] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:32] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:33] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:34] [INFO ] Deduced a trap composed of 10 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-05 00:19:35] [INFO ] Deduced a trap composed of 8 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-05 00:19:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:35] [INFO ] Deduced a trap composed of 14 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-05 00:19:35] [INFO ] Deduced a trap composed of 16 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-05 00:19:35] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:35] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:36] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:46] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:47] [INFO ] Deduced a trap composed of 16 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-05 00:19:47] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:47] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:48] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:48] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:48] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:48] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:49] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:49] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:49] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:49] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:50] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:50] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:50] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:50] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:51] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:51] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:51] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:53] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:55] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:55] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:56] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:56] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:56] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:57] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:57] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:57] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:58] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:58] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:58] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:59] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:59] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:00] [INFO ] Deduced a trap composed of 14 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-05 00:20:00] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:01] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:01] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:05] [INFO ] Deduced a trap composed of 10 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-05 00:20:05] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:07] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:07] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:08] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:09] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:10] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:10] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:11] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:11] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:12] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:13] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:13] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 472 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin13581255647977562014
[2025-06-05 00:20:15] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2025-06-05 00:20:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:20:15] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2025-06-05 00:20:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:20:15] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2025-06-05 00:20:15] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:20:15] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13581255647977562014
Running compilation step : cd /tmp/ltsmin13581255647977562014;'/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 2846 ms.
Running link step : cd /tmp/ltsmin13581255647977562014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13581255647977562014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8663972135560438860.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:20:30] [INFO ] Flatten gal took : 42 ms
[2025-06-05 00:20:30] [INFO ] Flatten gal took : 45 ms
[2025-06-05 00:20:30] [INFO ] Time to serialize gal into /tmp/LTL13454988362720541919.gal : 12 ms
[2025-06-05 00:20:30] [INFO ] Time to serialize properties into /tmp/LTL16916654631419705053.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/LTL13454988362720541919.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9981607264642192726.hoa' '-atoms' '/tmp/LTL16916654631419705053.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/LTL16916654631419705053.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9981607264642192726.hoa
Detected timeout of ITS tools.
[2025-06-05 00:20:45] [INFO ] Flatten gal took : 36 ms
[2025-06-05 00:20:45] [INFO ] Flatten gal took : 36 ms
[2025-06-05 00:20:45] [INFO ] Time to serialize gal into /tmp/LTL11564872316136123222.gal : 8 ms
[2025-06-05 00:20:45] [INFO ] Time to serialize properties into /tmp/LTL155897517509389083.ltl : 4 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/LTL11564872316136123222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL155897517509389083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("((p852==0)&&(p530==1))")&&(G(F("(p2062==1)"))))))
Formula 0 simplified : FG!"(p2062==1)" | G!"((p852==0)&&(p530==1))"
Detected timeout of ITS tools.
[2025-06-05 00:21:00] [INFO ] Flatten gal took : 33 ms
[2025-06-05 00:21:00] [INFO ] Applying decomposition
[2025-06-05 00:21:00] [INFO ] Flatten gal took : 33 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/graph9638651192362873704.txt' '-o' '/tmp/graph9638651192362873704.bin' '-w' '/tmp/graph9638651192362873704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9638651192362873704.bin' '-l' '-1' '-v' '-w' '/tmp/graph9638651192362873704.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:21:00] [INFO ] Decomposing Gal with order
[2025-06-05 00:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:21:00] [INFO ] Removed a total of 637 redundant transitions.
[2025-06-05 00:21:01] [INFO ] Flatten gal took : 101 ms
[2025-06-05 00:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 21 ms.
[2025-06-05 00:21:01] [INFO ] Time to serialize gal into /tmp/LTL17519635466079520510.gal : 13 ms
[2025-06-05 00:21:01] [INFO ] Time to serialize properties into /tmp/LTL4036908538973585666.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/LTL17519635466079520510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4036908538973585666.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(("((i13.i2.u125.p852==0)&&(i8.i2.u74.p530==1))")&&(G(F("(i34.i1.u309.p2062==1)"))))))
Formula 0 simplified : FG!"(i34.i1.u309.p2062==1)" | G!"((i13.i2.u125.p852==0)&&(i8.i2.u74.p530==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-06 finished in 352611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2134 transition count 1893
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1933 transition count 1893
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1933 transition count 1693
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1733 transition count 1693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 813 place count 1722 transition count 1682
Iterating global reduction 2 with 11 rules applied. Total rules applied 824 place count 1722 transition count 1682
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 824 place count 1722 transition count 1678
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 832 place count 1718 transition count 1678
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2258 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2260 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2261 place count 1002 transition count 963
Applied a total of 2261 rules in 272 ms. Remains 1002 /2135 variables (removed 1133) and now considering 963/2095 (removed 1132) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2025-06-05 00:21:16] [INFO ] Computed 360 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:21:16] [INFO ] Implicit Places using invariants in 454 ms returned []
[2025-06-05 00:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:21:17] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:21:17] [INFO ] Redundant transitions in 90 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 960 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1002 cols
[2025-06-05 00:21:17] [INFO ] Computed 360 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:30] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:31] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:31] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:31] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:31] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 25 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:35] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:36] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:37] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:38] [INFO ] Deduced a trap composed of 14 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-05 00:21:38] [INFO ] Deduced a trap composed of 16 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-05 00:21:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:38] [INFO ] Deduced a trap composed of 16 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-05 00:21:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 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-05 00:21:39] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 14 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-05 00:21:40] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 416 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:49] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:50] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:50] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:50] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:51] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:51] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:51] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:51] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:51] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:52] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:52] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:52] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:52] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:53] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:53] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:53] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:54] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:54] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:54] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:54] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:58] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:58] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:59] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:59] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:59] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:00] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:00] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:00] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:01] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:01] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:01] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:02] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:02] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:03] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:03] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:03] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:04] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:07] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:08] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:10] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:10] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:10] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:12] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:12] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 22 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 1)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 1)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 1)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 1)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(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 1)
(s531 0)
(s532 0)
(s533 1)
(s534 0)
(s535 1)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 1)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 1)
(s559 0)
(s560 1)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 1)
(s584 1)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 1)
(s609 0)
(s610 1)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 0)
(s620 1)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 1)
(s634 0)
(s635 1)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 1)
(s642 0)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 1)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 1)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 1)
(s671 0)
(s672 1)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 1)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 0)
(s691 1)
(s692 0)
(s693 0)
(s694 0)
(s695 1)
(s696 0)
(s697 1)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 1)
(s709 0)
(s710 1)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 1)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 1)
(s734 0)
(s735 1)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 0)
(s744 0)
(s745 1)
(s746 0)
(s747 1)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 1)
(s759 1)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 0)
(s766 1)
(s767 0)
(s768 0)
(s769 0)
(s770 1)
(s771 0)
(s772 1)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 1)
(s784 1)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 0)
(s791 1)
(s792 0)
(s793 0)
(s794 0)
(s795 1)
(s796 0)
(s797 1)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 1)
(s809 0)
(s810 1)
(s811 1)
(s812 0)
(s813 1)
(s814 0)
(s815 0)
(s816 1)
(s817 0)
(s818 0)
(s819 1)
(s820 0)
(s821 0)
(s822 0)
(s823 1)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 1)
(s830 0)
(s831 1)
(s832 0)
(s833 0)
(s834 1)
(s835 0)
(s836 1)
(s837 1)
(s838 0)
(s839 1)
(s840 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1964 variables, and 468 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2135 places, 962/2095 transitions.
Applied a total of 0 rules in 32 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61925 ms. Remains : 1002/2135 places, 962/2095 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-07
Product exploration explored 100000 steps with 156 reset in 726 ms.
Product exploration explored 100000 steps with 192 reset in 879 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 26 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2025-06-05 00:22:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:22:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-05 00:22:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:22:21] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:22:21] [INFO ] Redundant transitions in 86 ms returned []
Running 960 sub problems to find dead transitions.
[2025-06-05 00:22: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/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:35] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:35] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:35] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:35] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:35] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:36] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:36] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:36] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:36] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:37] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:37] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:37] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:37] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:38] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:38] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:38] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:38] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:38] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:39] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:40] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:41] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 11 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-05 00:22:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 14 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-05 00:22:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:44] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 416 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:53] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:53] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:53] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:54] [INFO ] Deduced a trap composed of 14 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-05 00:22:54] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:54] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:55] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:56] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:56] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:56] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:56] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:56] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:57] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:58] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:59] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:00] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:00] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:00] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:00] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:01] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:01] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:01] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:01] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:02] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:02] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:02] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:03] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:03] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:03] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:04] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:04] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:04] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:05] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:06] [INFO ] Deduced a trap composed of 16 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-05 00:23:08] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:08] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:09] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:10] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:10] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:11] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:11] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:11] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:12] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:12] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:12] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:13] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:18] [INFO ] Deduced a trap composed of 10 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-05 00:23:18] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:19] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1964 variables, and 477 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61689 ms. Remains : 1002/1002 places, 962/962 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 200 reset in 707 ms.
Product exploration explored 100000 steps with 193 reset in 869 ms.
Built C files in :
/tmp/ltsmin3072918187278636846
[2025-06-05 00:23:24] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2025-06-05 00:23:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:24] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2025-06-05 00:23:24] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:24] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2025-06-05 00:23:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:24] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3072918187278636846
Running compilation step : cd /tmp/ltsmin3072918187278636846;'/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 2884 ms.
Running link step : cd /tmp/ltsmin3072918187278636846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3072918187278636846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11915190911630467959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2025-06-05 00:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:23:39] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-06-05 00:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:23:40] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:23:40] [INFO ] Redundant transitions in 94 ms returned []
Running 960 sub problems to find dead transitions.
[2025-06-05 00:23: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/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:53] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:54] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:54] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:54] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:55] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:55] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:55] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:55] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:55] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:56] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:56] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:56] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:56] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:57] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:57] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:57] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:57] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:57] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:58] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:58] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 25 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:58] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:58] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:58] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:59] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 10 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-05 00:24:01] [INFO ] Deduced a trap composed of 10 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-05 00:24:01] [INFO ] Deduced a trap composed of 11 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-05 00:24:01] [INFO ] Deduced a trap composed of 18 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-05 00:24:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:02] [INFO ] Deduced a trap composed of 14 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-05 00:24:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:02] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:02] [INFO ] Deduced a trap composed of 16 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-05 00:24:02] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:03] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:03] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:03] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 416 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:12] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:12] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:13] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:13] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:13] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:13] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:13] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:14] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:14] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:14] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:14] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:15] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:16] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:18] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:19] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:19] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:19] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:20] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:20] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:20] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:20] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:21] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:21] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:21] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:21] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:22] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:22] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:22] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:23] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:23] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:23] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:24] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:25] [INFO ] Deduced a trap composed of 16 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-05 00:24:27] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:27] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:28] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:29] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:32] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:32] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:38] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:40] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1964 variables, and 477 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61674 ms. Remains : 1002/1002 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin12333558914144518771
[2025-06-05 00:24:41] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2025-06-05 00:24:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:24:41] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2025-06-05 00:24:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:24:41] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2025-06-05 00:24:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:24:41] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12333558914144518771
Running compilation step : cd /tmp/ltsmin12333558914144518771;'/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 2892 ms.
Running link step : cd /tmp/ltsmin12333558914144518771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12333558914144518771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4885461493041142574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:24:56] [INFO ] Flatten gal took : 34 ms
[2025-06-05 00:24:56] [INFO ] Flatten gal took : 32 ms
[2025-06-05 00:24:56] [INFO ] Time to serialize gal into /tmp/LTL239057163246208852.gal : 6 ms
[2025-06-05 00:24:56] [INFO ] Time to serialize properties into /tmp/LTL15609853998738502637.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/LTL239057163246208852.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5540870472298587669.hoa' '-atoms' '/tmp/LTL15609853998738502637.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/LTL15609853998738502637.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5540870472298587669.hoa
Detected timeout of ITS tools.
[2025-06-05 00:25:11] [INFO ] Flatten gal took : 31 ms
[2025-06-05 00:25:11] [INFO ] Flatten gal took : 31 ms
[2025-06-05 00:25:11] [INFO ] Time to serialize gal into /tmp/LTL10450661430401104169.gal : 6 ms
[2025-06-05 00:25:11] [INFO ] Time to serialize properties into /tmp/LTL2472069292588504809.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/LTL10450661430401104169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2472069292588504809.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p109==0)||(p1966==1))"))))
Formula 0 simplified : FG!"((p109==0)||(p1966==1))"
Detected timeout of ITS tools.
[2025-06-05 00:25:26] [INFO ] Flatten gal took : 29 ms
[2025-06-05 00:25:26] [INFO ] Applying decomposition
[2025-06-05 00:25:26] [INFO ] Flatten gal took : 30 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/graph16643878106934719406.txt' '-o' '/tmp/graph16643878106934719406.bin' '-w' '/tmp/graph16643878106934719406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16643878106934719406.bin' '-l' '-1' '-v' '-w' '/tmp/graph16643878106934719406.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:25:26] [INFO ] Decomposing Gal with order
[2025-06-05 00:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:25:26] [INFO ] Removed a total of 635 redundant transitions.
[2025-06-05 00:25:26] [INFO ] Flatten gal took : 57 ms
[2025-06-05 00:25:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 14 ms.
[2025-06-05 00:25:26] [INFO ] Time to serialize gal into /tmp/LTL7413420680427524157.gal : 8 ms
[2025-06-05 00:25:26] [INFO ] Time to serialize properties into /tmp/LTL5061231662694584171.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/LTL7413420680427524157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5061231662694584171.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.u10.p109==0)||(i32.i0.u296.p1966==1))"))))
Formula 0 simplified : FG!"((i1.i0.u10.p109==0)||(i32.i0.u296.p1966==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-07 finished in 265480 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((X(p1)||((F(p2) U p1)&&X(p3))||p0))))'
Support contains 8 out of 2135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2128 transition count 2088
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2128 transition count 2088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2127 transition count 2087
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2127 transition count 2087
Applied a total of 16 rules in 239 ms. Remains 2127 /2135 variables (removed 8) and now considering 2087/2095 (removed 8) transitions.
// Phase 1: matrix 2087 rows 2127 cols
[2025-06-05 00:25:41] [INFO ] Computed 361 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:25:42] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-06-05 00:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:25:44] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
Running 2086 sub problems to find dead transitions.
[2025-06-05 00:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 2086/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2086 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 0/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 2086 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Starting structural reductions in LTL mode, iteration 1 : 2127/2135 places, 2087/2095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63485 ms. Remains : 2127/2135 places, 2087/2095 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-08
Product exploration explored 100000 steps with 46 reset in 681 ms.
Product exploration explored 100000 steps with 44 reset in 816 ms.
Computed a total of 483 stabilizing places and 483 stable transitions
Computed a total of 483 stabilizing places and 483 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 129 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 505 ms. (79 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
[2025-06-05 00:26:47] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1998/2127 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2127 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2087/4214 variables, 2127/2488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4214 variables, 0/2488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/4214 variables, 0/2488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4214/4214 variables, and 2488 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2127/2127 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1998/2127 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:50] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:50] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:50] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:50] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:50] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:51] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2127 variables, 19/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2127 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2087/4214 variables, 2127/2507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4214 variables, 8/2515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:54] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 16 ms to minimize.
SMT process timed out in 6981ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 2127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2127/2127 places, 2087/2087 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2127 transition count 1889
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1929 transition count 1889
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 396 place count 1929 transition count 1691
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 792 place count 1731 transition count 1691
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2230 place count 1012 transition count 972
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 278 times.
Drop transitions (Partial Free agglomeration) removed 278 transitions
Iterating global reduction 2 with 278 rules applied. Total rules applied 2508 place count 1012 transition count 972
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2509 place count 1011 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2510 place count 1010 transition count 971
Applied a total of 2510 rules in 265 ms. Remains 1010 /2127 variables (removed 1117) and now considering 971/2087 (removed 1116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1010/2127 places, 971/2087 transitions.
RANDOM walk for 40000 steps (8 resets) in 530 ms. (75 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:26:55] [INFO ] Computed 360 invariants in 40 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/317 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/327 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 298/625 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 45/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/628 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/632 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/632 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 191/823 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/831 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/845 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/1005 variables, 86/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1005 variables, 27/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 122/1127 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1127 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1127 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 5/1132 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1132 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1132 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 4/1136 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1136 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (OVERLAPS) 2/1138 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1138 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1138 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 1/1139 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1139 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1139 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (OVERLAPS) 137/1276 variables, 74/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1276 variables, 22/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 104/1380 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1380 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1380 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 5/1385 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1385 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1385 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 4/1389 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1389 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 119/1508 variables, 66/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1508 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (OVERLAPS) 73/1581 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1581 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1581 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 4/1585 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1585 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1585 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 2/1587 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1587 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 82/1669 variables, 44/1123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1669 variables, 13/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (OVERLAPS) 62/1731 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1731 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1731 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 3/1734 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1734 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1734 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 2/1736 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1736 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 80/1816 variables, 42/1226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1816 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 60/1876 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1876 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1876 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 3/1879 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1879 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1879 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 2/1881 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1881 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (OVERLAPS) 72/1953 variables, 40/1326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1953 variables, 12/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4770 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/317 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 10/327 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 298/625 variables, 154/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/625 variables, 45/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/625 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/625 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 3/628 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/628 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/628 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 4/632 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/632 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/632 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 191/823 variables, 104/494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/823 variables, 32/526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:02] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/823 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/823 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 8/831 variables, 9/536 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/831 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:02] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/831 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/831 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 14/845 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/845 variables, 10/562 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:02] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/845 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/845 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 160/1005 variables, 86/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1005 variables, 27/676 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:03] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1005 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1005 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 122/1127 variables, 59/741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1127 variables, 17/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1127 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 5/1132 variables, 8/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1132 variables, 5/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1132 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 4/1136 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1136 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 2/1138 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1138 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1138 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 1/1139 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1139 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1139 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 137/1276 variables, 74/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1276 variables, 22/874 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1276 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 104/1380 variables, 50/924 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1380 variables, 15/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1380 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 5/1385 variables, 8/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1385 variables, 5/952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1385 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (OVERLAPS) 4/1389 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:07] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 8 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1389 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:07] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 8 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/1389 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1389 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 119/1508 variables, 66/1022 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1508 variables, 19/1041 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:08] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:08] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 6 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1508 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1508 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 73/1581 variables, 38/1081 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1581 variables, 11/1092 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:09] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:09] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:09] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:09] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 8 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1581 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1581 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (OVERLAPS) 4/1585 variables, 7/1103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1585 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1585 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 2/1587 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:10] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 9 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/1587 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1587 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 82/1669 variables, 44/1153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1669 variables, 13/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1669 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 62/1731 variables, 30/1196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1731 variables, 9/1205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1731 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 3/1734 variables, 5/1210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1734 variables, 3/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1734 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (OVERLAPS) 2/1736 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1736 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 80/1816 variables, 42/1256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1816 variables, 12/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1816 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (OVERLAPS) 60/1876 variables, 30/1298 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1876 variables, 9/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1876 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (OVERLAPS) 3/1879 variables, 5/1312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1879 variables, 3/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1879 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (OVERLAPS) 2/1881 variables, 1/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1881 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (OVERLAPS) 72/1953 variables, 40/1356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1953 variables, 12/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1953 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (OVERLAPS) 22/1975 variables, 16/1384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1975 variables, 4/1388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1975 variables, 0/1388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (OVERLAPS) 2/1977 variables, 4/1392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1977 variables, 2/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1977 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (OVERLAPS) 4/1981 variables, 4/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1981 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1981 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 118 (OVERLAPS) 0/1981 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1400 constraints, problems are : Problem set: 0 solved, 7 unsolved in 17075 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21900ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 623 ms.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 20 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1010/1010 places, 971/971 transitions.
RANDOM walk for 40000 steps (8 resets) in 436 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 128343 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 7
Probabilistic random walk after 128343 steps, saw 115821 distinct states, run finished after 3008 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-05 00:27:21] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/317 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/327 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 298/625 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 45/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/628 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/632 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/632 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 191/823 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/831 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/845 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/1005 variables, 86/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1005 variables, 27/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 122/1127 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1127 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1127 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 5/1132 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1132 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1132 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 4/1136 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1136 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (OVERLAPS) 2/1138 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1138 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1138 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 1/1139 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1139 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1139 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (OVERLAPS) 137/1276 variables, 74/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1276 variables, 22/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 104/1380 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1380 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1380 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 5/1385 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1385 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1385 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 4/1389 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1389 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 119/1508 variables, 66/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1508 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (OVERLAPS) 73/1581 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1581 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1581 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 4/1585 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1585 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1585 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 2/1587 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1587 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 82/1669 variables, 44/1123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1669 variables, 13/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (OVERLAPS) 62/1731 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1731 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1731 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 3/1734 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1734 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1734 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 2/1736 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1736 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 80/1816 variables, 42/1226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1816 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 60/1876 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1876 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1876 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 3/1879 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1879 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1879 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 2/1881 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1881 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (OVERLAPS) 72/1953 variables, 40/1326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1953 variables, 12/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5248 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:27] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/317 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 10/327 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 298/625 variables, 154/330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/625 variables, 45/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/625 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/625 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 3/628 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/628 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/628 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 4/632 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/632 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 191/823 variables, 104/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/823 variables, 32/524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:28] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/823 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/823 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 8/831 variables, 9/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/831 variables, 8/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/831 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 14/845 variables, 7/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/845 variables, 10/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/845 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/845 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 160/1005 variables, 86/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 27/673 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:29] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 8/681 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 6 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1005 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:30] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 4 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1005 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:31] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 6 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1005 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1005 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1005 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (OVERLAPS) 122/1127 variables, 59/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1127 variables, 17/763 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:31] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 4 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1127 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1127 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (OVERLAPS) 5/1132 variables, 8/772 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1132 variables, 5/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1132 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 4/1136 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1136 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (OVERLAPS) 2/1138 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1138 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1138 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (OVERLAPS) 1/1139 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1139 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1139 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 137/1276 variables, 74/858 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1276 variables, 22/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1276 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (OVERLAPS) 104/1380 variables, 50/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1380 variables, 15/945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1380 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 5/1385 variables, 8/953 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1385 variables, 5/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1385 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 4/1389 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1389 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 119/1508 variables, 66/1026 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1508 variables, 19/1045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 6 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1508 variables, 1/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1508 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 73/1581 variables, 38/1084 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1581 variables, 11/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 8 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1581 variables, 1/1096 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1581 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (OVERLAPS) 4/1585 variables, 7/1103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1585 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1585 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 2/1587 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1587 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 82/1669 variables, 44/1152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1669 variables, 13/1165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1669 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (OVERLAPS) 62/1731 variables, 30/1195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1731 variables, 9/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1731 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (OVERLAPS) 3/1734 variables, 5/1209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1734 variables, 3/1212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1734 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (OVERLAPS) 2/1736 variables, 1/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1736 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 80/1816 variables, 42/1255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1816 variables, 12/1267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1816 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 60/1876 variables, 30/1297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1876 variables, 9/1306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1876 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (OVERLAPS) 3/1879 variables, 5/1311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1879 variables, 3/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1879 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (OVERLAPS) 2/1881 variables, 1/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1881 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (OVERLAPS) 72/1953 variables, 40/1355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1953 variables, 12/1367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1953 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (OVERLAPS) 22/1975 variables, 16/1383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1975 variables, 4/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1975 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 2/1977 variables, 4/1391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1977 variables, 2/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1977 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (OVERLAPS) 4/1981 variables, 4/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1981 variables, 2/1399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1981 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (OVERLAPS) 0/1981 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1399 constraints, problems are : Problem set: 0 solved, 7 unsolved in 17019 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22275ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1009 ms.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 22 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1010/1010 places, 971/971 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 22 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2025-06-05 00:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:27:45] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-05 00:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:27:46] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:27:46] [INFO ] Redundant transitions in 14 ms returned []
Running 967 sub problems to find dead transitions.
[2025-06-05 00:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 8 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-05 00:28:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:04] [INFO ] Deduced a trap composed of 8 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-05 00:28:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 8 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-05 00:28:06] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:12] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:13] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 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-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:14] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 397 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 356/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 40/397 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:25] [INFO ] Deduced a trap composed of 8 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-05 00:28:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:26] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:28] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:38] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 8 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-05 00:28:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:39] [INFO ] Deduced a trap composed of 8 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-05 00:28:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:40] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:40] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:41] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:41] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:41] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:41] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 1)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 1)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 1)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 1)
(s466 0)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 1)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 1)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 1)
(s541 0)
(s542 1)
(s543 0)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 0)
(s560 1)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 1)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 1)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 1)
(s591 0)
(s592 1)
(s593 0)
(s594 1)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 1)
(s600 1)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 1)
(s618 0)
(s619 1)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 1)
(s625 1)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 1)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 1)
(s643 0)
(s644 1)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 1)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 1)
(s668 0)
(s669 1)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 1)
(s675 1)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 1)
(s693 0)
(s694 1)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 437 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 356/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61803 ms. Remains : 1010/1010 places, 971/971 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 340 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Support contains 8 out of 2127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2127/2127 places, 2087/2087 transitions.
Applied a total of 0 rules in 79 ms. Remains 2127 /2127 variables (removed 0) and now considering 2087/2087 (removed 0) transitions.
// Phase 1: matrix 2087 rows 2127 cols
[2025-06-05 00:28:47] [INFO ] Computed 361 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:28:48] [INFO ] Implicit Places using invariants in 682 ms returned []
[2025-06-05 00:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:28:50] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
Running 2086 sub problems to find dead transitions.
[2025-06-05 00:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 2086/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2086 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 0/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 2086 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Finished structural reductions in LTL mode , in 1 iterations and 63648 ms. Remains : 2127/2127 places, 2087/2087 transitions.
Computed a total of 483 stabilizing places and 483 stable transitions
Computed a total of 483 stabilizing places and 483 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 143 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
[2025-06-05 00:29:52] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1998/2127 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2127 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2087/4214 variables, 2127/2488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4214 variables, 0/2488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/4214 variables, 0/2488 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4214/4214 variables, and 2488 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2127/2127 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1998/2127 variables, 353/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:55] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:55] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:55] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:55] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:56] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:56] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:56] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:56] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:56] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:57] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2127 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 12 ms to minimize.
SMT process timed out in 6823ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 2127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2127/2127 places, 2087/2087 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2127 transition count 1889
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1929 transition count 1889
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 396 place count 1929 transition count 1691
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 792 place count 1731 transition count 1691
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2230 place count 1012 transition count 972
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 278 times.
Drop transitions (Partial Free agglomeration) removed 278 transitions
Iterating global reduction 2 with 278 rules applied. Total rules applied 2508 place count 1012 transition count 972
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2509 place count 1011 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2510 place count 1010 transition count 971
Applied a total of 2510 rules in 242 ms. Remains 1010 /2127 variables (removed 1117) and now considering 971/2087 (removed 1116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 1010/2127 places, 971/2087 transitions.
RANDOM walk for 40000 steps (8 resets) in 613 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 123798 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :0 out of 7
Probabilistic random walk after 123798 steps, saw 111399 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:30:02] [INFO ] Computed 360 invariants in 36 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/317 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/327 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 298/625 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 45/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/628 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/632 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/632 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 191/823 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/831 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/845 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/1005 variables, 86/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1005 variables, 27/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 122/1127 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1127 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1127 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 5/1132 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1132 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1132 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 4/1136 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1136 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (OVERLAPS) 2/1138 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1138 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1138 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 1/1139 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1139 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1139 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (OVERLAPS) 137/1276 variables, 74/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1276 variables, 22/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 104/1380 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1380 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1380 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 5/1385 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1385 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1385 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 4/1389 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1389 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 119/1508 variables, 66/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1508 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (OVERLAPS) 73/1581 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1581 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1581 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 4/1585 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1585 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1585 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 2/1587 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1587 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 82/1669 variables, 44/1123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1669 variables, 13/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (OVERLAPS) 62/1731 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1731 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1731 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 3/1734 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1734 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1734 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 2/1736 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1736 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 80/1816 variables, 42/1226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1816 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 60/1876 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1876 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1876 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 3/1879 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1879 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1879 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 2/1881 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1881 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (OVERLAPS) 72/1953 variables, 40/1326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1953 variables, 12/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4932 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/116 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/312 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/317 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 10/327 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 298/625 variables, 154/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/625 variables, 45/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:08] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/625 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/625 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 3/628 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/628 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/628 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 4/632 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/632 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/632 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 191/823 variables, 104/494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/823 variables, 32/526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:09] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/823 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/823 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 8/831 variables, 9/536 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/831 variables, 8/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:09] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/831 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/831 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 14/845 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/845 variables, 10/562 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:10] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/845 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/845 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 160/1005 variables, 86/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1005 variables, 27/676 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:10] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:10] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:10] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:10] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:11] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:11] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 5 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1005 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1005 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 122/1127 variables, 59/741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1127 variables, 17/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1127 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 5/1132 variables, 8/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1132 variables, 5/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1132 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 4/1136 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1136 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 2/1138 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1138 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1138 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 1/1139 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1139 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:12] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:13] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 7 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/1139 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1139 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (OVERLAPS) 137/1276 variables, 74/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1276 variables, 22/876 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1276 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (OVERLAPS) 104/1380 variables, 50/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1380 variables, 15/941 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1380 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (OVERLAPS) 5/1385 variables, 8/949 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1385 variables, 5/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:14] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 5 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1385 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:14] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 5 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1385 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1385 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 4/1389 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:15] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 6 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1389 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1389 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 119/1508 variables, 66/1025 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1508 variables, 19/1044 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1508 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 73/1581 variables, 38/1082 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1581 variables, 11/1093 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1581 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (OVERLAPS) 4/1585 variables, 7/1100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1585 variables, 4/1104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1585 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (OVERLAPS) 2/1587 variables, 1/1105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:17] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 7 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/1587 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1587 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (OVERLAPS) 82/1669 variables, 44/1150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1669 variables, 13/1163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:17] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:18] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:19] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:19] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:19] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 12 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/1669 variables, 10/1173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:19] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:20] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:20] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:20] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 7 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1669 variables, 5/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1669 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (OVERLAPS) 62/1731 variables, 30/1208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1731 variables, 9/1217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:21] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:21] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:21] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 9 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1731 variables, 3/1220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:21] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 7 ms to minimize.
At refinement iteration 92 (INCLUDED_ONLY) 0/1731 variables, 1/1221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:22] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:22] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:22] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 10 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/1731 variables, 3/1224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1731 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 3/1734 variables, 5/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1734 variables, 3/1232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:23] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 7 ms to minimize.
At refinement iteration 97 (INCLUDED_ONLY) 0/1734 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1734 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 2/1736 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1736 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (OVERLAPS) 80/1816 variables, 42/1276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1816 variables, 12/1288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1816 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (OVERLAPS) 60/1876 variables, 30/1318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1876 variables, 9/1327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:25] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 9 ms to minimize.
At refinement iteration 106 (INCLUDED_ONLY) 0/1876 variables, 1/1328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:25] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:26] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 9 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1876 variables, 2/1330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1876 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (OVERLAPS) 3/1879 variables, 5/1335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1879 variables, 3/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1879 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (OVERLAPS) 2/1881 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:27] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:27] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 11 ms to minimize.
At refinement iteration 113 (INCLUDED_ONLY) 0/1881 variables, 2/1341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:27] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:28] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 10 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1881 variables, 2/1343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1881 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (OVERLAPS) 72/1953 variables, 40/1383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1953 variables, 12/1395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1953 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 119 (OVERLAPS) 22/1975 variables, 16/1411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1975 variables, 4/1415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1975 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 122 (OVERLAPS) 2/1977 variables, 4/1419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1977 variables, 2/1421 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1977 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 125 (OVERLAPS) 4/1981 variables, 4/1425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1981 variables, 2/1427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1981 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 128 (OVERLAPS) 0/1981 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1427 constraints, problems are : Problem set: 0 solved, 7 unsolved in 23782 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28768ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1744 ms.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 23 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1010/1010 places, 971/971 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 21 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2025-06-05 00:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:30:33] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-05 00:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:30:34] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:30:34] [INFO ] Redundant transitions in 17 ms returned []
Running 967 sub problems to find dead transitions.
[2025-06-05 00:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:52] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:52] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:52] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:52] [INFO ] Deduced a trap composed of 8 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-05 00:30:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:53] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:53] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:53] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:53] [INFO ] Deduced a trap composed of 8 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-05 00:30:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:54] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:54] [INFO ] Deduced a trap composed of 8 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-05 00:30:55] [INFO ] Deduced a trap composed of 8 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-05 00:30:55] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:55] [INFO ] Deduced a trap composed of 8 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-05 00:30:55] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:02] [INFO ] Deduced a trap composed of 8 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-05 00:31:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:02] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:02] [INFO ] Deduced a trap composed of 8 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-05 00:31:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:03] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:03] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:04] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:04] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:04] [INFO ] Deduced a trap composed of 8 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-05 00:31:04] [INFO ] Deduced a trap composed of 8 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-05 00:31:04] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:04] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 1.0)
(s776 1.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 1.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 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 1007/1981 variables, and 395 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 356/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 38/395 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:13] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:13] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:14] [INFO ] Deduced a trap composed of 8 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-05 00:31:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:15] [INFO ] Deduced a trap composed of 8 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-05 00:31:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:15] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:15] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:15] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:26] [INFO ] Deduced a trap composed of 9 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-05 00:31:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:27] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:27] [INFO ] Deduced a trap composed of 8 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-05 00:31:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:28] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:28] [INFO ] Deduced a trap composed of 9 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-05 00:31:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:29] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 435 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 356/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61915 ms. Remains : 1010/1010 places, 971/971 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 337 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 45 reset in 684 ms.
Product exploration explored 100000 steps with 44 reset in 829 ms.
Built C files in :
/tmp/ltsmin3110832273343812447
[2025-06-05 00:31:38] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3110832273343812447
Running compilation step : cd /tmp/ltsmin3110832273343812447;'/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/ltsmin3110832273343812447;'/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/ltsmin3110832273343812447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 2127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2127/2127 places, 2087/2087 transitions.
Applied a total of 0 rules in 76 ms. Remains 2127 /2127 variables (removed 0) and now considering 2087/2087 (removed 0) transitions.
// Phase 1: matrix 2087 rows 2127 cols
[2025-06-05 00:31:41] [INFO ] Computed 361 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:41] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-06-05 00:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:43] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
Running 2086 sub problems to find dead transitions.
[2025-06-05 00:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 2086/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2086 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2126/4214 variables, and 0 constraints, problems are : Problem set: 0 solved, 2086 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2127 constraints, PredecessorRefiner: 0/2086 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 2086 unsolved
Search for dead transitions found 0 dead transitions in 60489ms
Finished structural reductions in LTL mode , in 1 iterations and 63367 ms. Remains : 2127/2127 places, 2087/2087 transitions.
Built C files in :
/tmp/ltsmin5885495683421922779
[2025-06-05 00:32:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5885495683421922779
Running compilation step : cd /tmp/ltsmin5885495683421922779;'/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/ltsmin5885495683421922779;'/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/ltsmin5885495683421922779;'/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-05 00:32:47] [INFO ] Flatten gal took : 44 ms
[2025-06-05 00:32:47] [INFO ] Flatten gal took : 43 ms
[2025-06-05 00:32:47] [INFO ] Time to serialize gal into /tmp/LTL7508374085521540257.gal : 9 ms
[2025-06-05 00:32:47] [INFO ] Time to serialize properties into /tmp/LTL15084934880922566032.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/LTL7508374085521540257.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6393264354112216118.hoa' '-atoms' '/tmp/LTL15084934880922566032.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/LTL15084934880922566032.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6393264354112216118.hoa
Detected timeout of ITS tools.
[2025-06-05 00:33:02] [INFO ] Flatten gal took : 43 ms
[2025-06-05 00:33:02] [INFO ] Flatten gal took : 42 ms
[2025-06-05 00:33:02] [INFO ] Time to serialize gal into /tmp/LTL11109986093140117556.gal : 10 ms
[2025-06-05 00:33:02] [INFO ] Time to serialize properties into /tmp/LTL17278074811471333299.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/LTL11109986093140117556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17278074811471333299.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(((X("((p2155==0)||(p429==1))"))||("(p1317==0)"))||(("(p2275==1)")||(((F("((p1953==0)||(p1366==1))"))U("((p2155==0)||(p429==1))"...195
Formula 0 simplified : GF((!"(p1317==0)" & !"(p2275==1)" & X!"((p2155==0)||(p429==1))" & (G!"((p1953==0)||(p1366==1))" R !"((p2155==0)||(p429==1))")) | (!"...245
Detected timeout of ITS tools.
[2025-06-05 00:33:17] [INFO ] Flatten gal took : 42 ms
[2025-06-05 00:33:17] [INFO ] Applying decomposition
[2025-06-05 00:33:17] [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/graph9531763299003229571.txt' '-o' '/tmp/graph9531763299003229571.bin' '-w' '/tmp/graph9531763299003229571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9531763299003229571.bin' '-l' '-1' '-v' '-w' '/tmp/graph9531763299003229571.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:33:18] [INFO ] Decomposing Gal with order
[2025-06-05 00:33:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:33:18] [INFO ] Removed a total of 920 redundant transitions.
[2025-06-05 00:33:18] [INFO ] Flatten gal took : 86 ms
[2025-06-05 00:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-05 00:33:18] [INFO ] Time to serialize gal into /tmp/LTL17107635372091975211.gal : 20 ms
[2025-06-05 00:33:18] [INFO ] Time to serialize properties into /tmp/LTL1857739372654815928.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/LTL17107635372091975211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1857739372654815928.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(((X("((i35.i3.u715.p2155==0)||(i6.i3.u146.p429==1))"))||("(i21.i5.u441.p1317==0)"))||(("(i37.i3.u757.p2275==1)")||(((F("((i32.i...312
Formula 0 simplified : GF((!"(i21.i5.u441.p1317==0)" & !"(i37.i3.u757.p2275==1)" & X!"((i35.i3.u715.p2155==0)||(i6.i3.u146.p429==1))" & (G!"((i32.i5.u652.p...409
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-08 finished in 471819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2134 transition count 1893
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1933 transition count 1893
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1933 transition count 1692
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1732 transition count 1692
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 816 place count 1720 transition count 1680
Iterating global reduction 2 with 12 rules applied. Total rules applied 828 place count 1720 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 828 place count 1720 transition count 1676
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 836 place count 1716 transition count 1676
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2262 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2264 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2265 place count 1000 transition count 961
Applied a total of 2265 rules in 349 ms. Remains 1000 /2135 variables (removed 1135) and now considering 961/2095 (removed 1134) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2025-06-05 00:33:33] [INFO ] Computed 360 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:34] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-05 00:33:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:35] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:33:35] [INFO ] Redundant transitions in 90 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2025-06-05 00:33:35] [INFO ] Computed 360 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:48] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:48] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:48] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:48] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:48] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:49] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:49] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:49] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:49] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:50] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:50] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:50] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:50] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:50] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:51] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:52] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:52] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:52] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:52] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:52] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:53] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:55] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 16 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-05 00:33:56] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:56] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:57] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:57] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:57] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:57] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:57] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:07] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:07] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 16 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-05 00:34:14] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:15] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:16] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:16] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:16] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:18] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:18] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:18] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:19] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:19] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:19] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:20] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:20] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:20] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 16 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-05 00:34:24] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:24] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:26] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:27] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 10 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-05 00:34:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:33] [INFO ] Deduced a trap composed of 10 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-05 00:34:33] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:33] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 477 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 117/117 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2135 places, 960/2095 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61903 ms. Remains : 1000/2135 places, 960/2095 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-09
Stuttering criterion allowed to conclude after 2129 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-09 finished in 61999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(p0 U X(X((X((p1 U p2))&&p1)))))))'
Support contains 5 out of 2135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2125 transition count 2085
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2125 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2124 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2124 transition count 2084
Applied a total of 22 rules in 240 ms. Remains 2124 /2135 variables (removed 11) and now considering 2084/2095 (removed 11) transitions.
// Phase 1: matrix 2084 rows 2124 cols
[2025-06-05 00:34:35] [INFO ] Computed 361 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:36] [INFO ] Implicit Places using invariants in 681 ms returned []
[2025-06-05 00:34:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:38] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2823 ms to find 0 implicit places.
Running 2083 sub problems to find dead transitions.
[2025-06-05 00:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 2083/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 0/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 2083 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LTL mode, iteration 1 : 2124/2135 places, 2084/2095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63547 ms. Remains : 2124/2135 places, 2084/2095 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-10
Product exploration explored 100000 steps with 20043 reset in 272 ms.
Product exploration explored 100000 steps with 19997 reset in 273 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (8 resets) in 457 ms. (87 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
[2025-06-05 00:35:40] [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, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2028/2124 variables, 356/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2124 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2084/4208 variables, 2124/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4208 variables, 0/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/4208 variables, 0/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4208/4208 variables, and 2485 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2124/2124 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2028/2124 variables, 356/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:42] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:43] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:44] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2124 variables, 14/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2124 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2084/4208 variables, 2124/2499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4208 variables, 7/2506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:46] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:46] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:46] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:47] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:47] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 40 ms to minimize.
SMT process timed out in 6908ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2124/2124 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2124 transition count 1884
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1924 transition count 1883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1923 transition count 1883
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 402 place count 1923 transition count 1682
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 804 place count 1722 transition count 1682
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 3 with 1434 rules applied. Total rules applied 2238 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions (Partial Free agglomeration) removed 277 transitions
Iterating global reduction 3 with 277 rules applied. Total rules applied 2515 place count 1005 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2516 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2517 place count 1003 transition count 964
Applied a total of 2517 rules in 214 ms. Remains 1003 /2124 variables (removed 1121) and now considering 964/2084 (removed 1120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1003/2124 places, 964/2084 transitions.
RANDOM walk for 13792 steps (1 resets) in 218 ms. (62 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (AND p0 p2))), (F p1)]
Knowledge based reduction with 3 factoid took 352 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 366 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2084/2084 transitions.
Applied a total of 0 rules in 85 ms. Remains 2124 /2124 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2025-06-05 00:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:49] [INFO ] Implicit Places using invariants in 652 ms returned []
[2025-06-05 00:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:51] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
Running 2083 sub problems to find dead transitions.
[2025-06-05 00:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 2083/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 0/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 2083 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Finished structural reductions in LTL mode , in 1 iterations and 63312 ms. Remains : 2124/2124 places, 2084/2084 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (8 resets) in 476 ms. (83 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
[2025-06-05 00:36:53] [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, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2028/2124 variables, 356/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2124 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2084/4208 variables, 2124/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4208 variables, 0/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/4208 variables, 0/2485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4208/4208 variables, and 2485 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2124/2124 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2028/2124 variables, 356/361 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:55] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:55] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:55] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:55] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:56] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:57] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2124 variables, 14/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2124 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2084/4208 variables, 2124/2499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4208 variables, 7/2506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:58] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:59] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:59] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:59] [INFO ] Deduced a trap composed of 27 places in 333 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:00] [INFO ] Deduced a trap composed of 27 places in 345 ms of which 41 ms to minimize.
SMT process timed out in 6935ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2124/2124 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2124 transition count 1884
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1924 transition count 1883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1923 transition count 1883
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 402 place count 1923 transition count 1682
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 804 place count 1722 transition count 1682
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 3 with 1434 rules applied. Total rules applied 2238 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions (Partial Free agglomeration) removed 277 transitions
Iterating global reduction 3 with 277 rules applied. Total rules applied 2515 place count 1005 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2516 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2517 place count 1003 transition count 964
Applied a total of 2517 rules in 255 ms. Remains 1003 /2124 variables (removed 1121) and now considering 964/2084 (removed 1120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 1003/2124 places, 964/2084 transitions.
RANDOM walk for 11134 steps (0 resets) in 146 ms. (75 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (AND p0 p2))), (F p1)]
Knowledge based reduction with 3 factoid took 431 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 427 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 396 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 20003 reset in 267 ms.
Product exploration explored 100000 steps with 19975 reset in 269 ms.
Built C files in :
/tmp/ltsmin16025838340685153217
[2025-06-05 00:37:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16025838340685153217
Running compilation step : cd /tmp/ltsmin16025838340685153217;'/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/ltsmin16025838340685153217;'/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/ltsmin16025838340685153217;'/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 5 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2084/2084 transitions.
Applied a total of 0 rules in 75 ms. Remains 2124 /2124 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2025-06-05 00:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:06] [INFO ] Implicit Places using invariants in 658 ms returned []
[2025-06-05 00:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:08] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2762 ms to find 0 implicit places.
Running 2083 sub problems to find dead transitions.
[2025-06-05 00:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 2083/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2083 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/4208 variables, and 0 constraints, problems are : Problem set: 0 solved, 2083 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 0/2083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 2083 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Finished structural reductions in LTL mode , in 1 iterations and 63307 ms. Remains : 2124/2124 places, 2084/2084 transitions.
Built C files in :
/tmp/ltsmin14403766477998202840
[2025-06-05 00:38:09] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14403766477998202840
Running compilation step : cd /tmp/ltsmin14403766477998202840;'/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/ltsmin14403766477998202840;'/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/ltsmin14403766477998202840;'/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-05 00:38:12] [INFO ] Flatten gal took : 42 ms
[2025-06-05 00:38:12] [INFO ] Flatten gal took : 41 ms
[2025-06-05 00:38:12] [INFO ] Time to serialize gal into /tmp/LTL2659922570859661913.gal : 9 ms
[2025-06-05 00:38:12] [INFO ] Time to serialize properties into /tmp/LTL14055128840533677384.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/LTL2659922570859661913.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4047870745198639462.hoa' '-atoms' '/tmp/LTL14055128840533677384.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/LTL14055128840533677384.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4047870745198639462.hoa
Detected timeout of ITS tools.
[2025-06-05 00:38:27] [INFO ] Flatten gal took : 41 ms
[2025-06-05 00:38:27] [INFO ] Flatten gal took : 40 ms
[2025-06-05 00:38:27] [INFO ] Time to serialize gal into /tmp/LTL11518237331855676403.gal : 8 ms
[2025-06-05 00:38:27] [INFO ] Time to serialize properties into /tmp/LTL6056279498691010315.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/LTL11518237331855676403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6056279498691010315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(X(!(("((p805==0)||(p1323==1))")U(X(X((X(("(p138==1)")U("((p1771==0)||(p1719==1))")))&&("(p138==1)")))))))))
Formula 0 simplified : XG("((p805==0)||(p1323==1))" U XX("(p138==1)" & X("(p138==1)" U "((p1771==0)||(p1719==1))")))
Detected timeout of ITS tools.
[2025-06-05 00:38:42] [INFO ] Flatten gal took : 52 ms
[2025-06-05 00:38:42] [INFO ] Applying decomposition
[2025-06-05 00:38:42] [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/graph4586081951408748155.txt' '-o' '/tmp/graph4586081951408748155.bin' '-w' '/tmp/graph4586081951408748155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4586081951408748155.bin' '-l' '-1' '-v' '-w' '/tmp/graph4586081951408748155.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:38:42] [INFO ] Decomposing Gal with order
[2025-06-05 00:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:38:43] [INFO ] Removed a total of 920 redundant transitions.
[2025-06-05 00:38:43] [INFO ] Flatten gal took : 91 ms
[2025-06-05 00:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-05 00:38:43] [INFO ] Time to serialize gal into /tmp/LTL10247091348747255063.gal : 23 ms
[2025-06-05 00:38:43] [INFO ] Time to serialize properties into /tmp/LTL7694510406840017822.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/LTL10247091348747255063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7694510406840017822.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(X(!(("((i12.i5.u270.p805==0)||(i21.i5.u444.p1323==1))")U(X(X((X(("(i1.i0.u51.p138==1)")U("((i29.i1.u591.p1771==0)||(i28.i4.u576.p...201
Formula 0 simplified : XG("((i12.i5.u270.p805==0)||(i21.i5.u444.p1323==1))" U XX("(i1.i0.u51.p138==1)" & X("(i1.i0.u51.p138==1)" U "((i29.i1.u591.p1771==0)...184
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-10 finished in 262754 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||X(F(p1))))))'
Support contains 4 out of 2135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2134 transition count 1894
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1934 transition count 1894
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 400 place count 1934 transition count 1694
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 800 place count 1734 transition count 1694
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 811 place count 1723 transition count 1683
Iterating global reduction 2 with 11 rules applied. Total rules applied 822 place count 1723 transition count 1683
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 822 place count 1723 transition count 1680
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 828 place count 1720 transition count 1680
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2254 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2256 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1004 transition count 965
Applied a total of 2257 rules in 251 ms. Remains 1004 /2135 variables (removed 1131) and now considering 965/2095 (removed 1130) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2025-06-05 00:38:58] [INFO ] Computed 360 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:58] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-06-05 00:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:59] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:38:59] [INFO ] Redundant transitions in 116 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 964 rows 1004 cols
[2025-06-05 00:38:59] [INFO ] Computed 360 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:13] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:13] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:13] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:13] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:14] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:14] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:14] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:14] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:14] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:15] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:15] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:15] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:15] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:15] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:16] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:17] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 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-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:18] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:19] [INFO ] Deduced a trap composed of 14 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-05 00:39:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:20] [INFO ] Deduced a trap composed of 16 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-05 00:39:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:20] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:20] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:20] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:21] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:21] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:21] [INFO ] Deduced a trap composed of 14 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-05 00:39:22] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:22] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:22] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:22] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:22] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:31] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:31] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:31] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:32] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:32] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:33] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:33] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:33] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:33] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:34] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:35] [INFO ] Deduced a trap composed of 14 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-05 00:39:35] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:35] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:36] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:36] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:36] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:36] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:38] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:39] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:40] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:41] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:41] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:41] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:41] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:42] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:42] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:42] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:42] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:43] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:43] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:48] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:48] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:49] [INFO ] Deduced a trap composed of 16 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-05 00:39:50] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:52] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:59] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:59] [INFO ] Deduced a trap composed of 10 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-05 00:39:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1968 variables, and 459 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 107/107 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2135 places, 964/2095 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61853 ms. Remains : 1004/2135 places, 964/2095 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-12
Product exploration explored 100000 steps with 2672 reset in 624 ms.
Product exploration explored 100000 steps with 2727 reset in 772 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 457 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2117 steps (1 resets) in 23 ms. (88 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 552 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 00:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:40:03] [INFO ] [Real]Absence check using 360 positive place invariants in 206 ms returned sat
[2025-06-05 00:40:05] [INFO ] [Real]Absence check using state equation in 2201 ms returned sat
[2025-06-05 00:40: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-05 00:40:06] [INFO ] [Nat]Absence check using 360 positive place invariants in 204 ms returned sat
[2025-06-05 00:40:09] [INFO ] [Nat]Absence check using state equation in 2556 ms returned sat
[2025-06-05 00:40:09] [INFO ] Computed and/alt/rep : 959/2395/959 causal constraints (skipped 2 transitions) in 48 ms.
[2025-06-05 00:40:20] [INFO ] Added : 455 causal constraints over 91 iterations in 11641 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 25 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2025-06-05 00:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:21] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-05 00:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:22] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:40:22] [INFO ] Redundant transitions in 91 ms returned []
Running 961 sub problems to find dead transitions.
[2025-06-05 00:40: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/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:36] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:36] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:36] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:36] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:36] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:37] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:37] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:37] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:37] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:38] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:38] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:38] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:38] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:38] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:39] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:39] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:39] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:39] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:39] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:41] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 14 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-05 00:40:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:44] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:44] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:44] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:44] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:45] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:45] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:45] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:45] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:53] [INFO ] Deduced a trap composed of 16 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-05 00:40:53] [INFO ] Deduced a trap composed of 16 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-05 00:40:55] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:55] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:55] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:55] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:56] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:56] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:56] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:57] [INFO ] Deduced a trap composed of 16 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-05 00:40:57] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:57] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:57] [INFO ] Deduced a trap composed of 14 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-05 00:40:58] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:58] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:58] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:58] [INFO ] Deduced a trap composed of 16 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-05 00:40:59] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:01] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:02] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:03] [INFO ] Deduced a trap composed of 16 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-05 00:41:03] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:03] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:04] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:04] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:04] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:04] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:05] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:05] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:05] [INFO ] Deduced a trap composed of 14 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-05 00:41:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:06] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:06] [INFO ] Deduced a trap composed of 14 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-05 00:41:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:10] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:12] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:13] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:15] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:20] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:21] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:22] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:22] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
SMT process timed out in 60160ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61622 ms. Remains : 1004/1004 places, 964/964 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 406 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 482 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-05 00:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:41:24] [INFO ] [Real]Absence check using 360 positive place invariants in 203 ms returned sat
[2025-06-05 00:41:26] [INFO ] [Real]Absence check using state equation in 2210 ms returned sat
[2025-06-05 00:41: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-05 00:41:27] [INFO ] [Nat]Absence check using 360 positive place invariants in 209 ms returned sat
[2025-06-05 00:41:30] [INFO ] [Nat]Absence check using state equation in 2584 ms returned sat
[2025-06-05 00:41:30] [INFO ] Computed and/alt/rep : 959/2395/959 causal constraints (skipped 2 transitions) in 42 ms.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2599 reset in 611 ms.
Product exploration explored 100000 steps with 2765 reset in 781 ms.
Built C files in :
/tmp/ltsmin7434006877175369493
[2025-06-05 00:41:43] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2025-06-05 00:41:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:41:43] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2025-06-05 00:41:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:41:43] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2025-06-05 00:41:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:41:43] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7434006877175369493
Running compilation step : cd /tmp/ltsmin7434006877175369493;'/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 2853 ms.
Running link step : cd /tmp/ltsmin7434006877175369493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7434006877175369493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1837983184869631991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2025-06-05 00:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:41:58] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-06-05 00:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:41:59] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:41:59] [INFO ] Redundant transitions in 95 ms returned []
Running 961 sub problems to find dead transitions.
[2025-06-05 00:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:12] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:13] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:13] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:13] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:13] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:14] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:14] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:14] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:14] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:15] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:15] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:15] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:15] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:15] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:16] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 22 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:17] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:18] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:19] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:19] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:19] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:19] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 14 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-05 00:42:20] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:21] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:21] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:21] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:21] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:21] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:22] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:22] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:22] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:22] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:23] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:30] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:32] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:32] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:33] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:33] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:33] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:34] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:34] [INFO ] Deduced a trap composed of 16 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-05 00:42:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:34] [INFO ] Deduced a trap composed of 16 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-05 00:42:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:35] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:35] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:35] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:35] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:36] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:36] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:39] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:40] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:40] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:41] [INFO ] Deduced a trap composed of 14 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-05 00:42:41] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:41] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:41] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:42] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:42] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:42] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:43] [INFO ] Deduced a trap composed of 14 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-05 00:42:43] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:43] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:47] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:48] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:48] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:48] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:49] [INFO ] Deduced a trap composed of 16 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-05 00:42:50] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:50] [INFO ] Deduced a trap composed of 16 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-05 00:42:51] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:54] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:58] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1968 variables, and 460 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61582 ms. Remains : 1004/1004 places, 964/964 transitions.
Built C files in :
/tmp/ltsmin18015326847921100797
[2025-06-05 00:42:59] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2025-06-05 00:42:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:42:59] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2025-06-05 00:42:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:43:00] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2025-06-05 00:43:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:43:00] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18015326847921100797
Running compilation step : cd /tmp/ltsmin18015326847921100797;'/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 2865 ms.
Running link step : cd /tmp/ltsmin18015326847921100797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin18015326847921100797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10942295695039575336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:43:14] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:43:15] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:43:15] [INFO ] Time to serialize gal into /tmp/LTL7893708074408361516.gal : 6 ms
[2025-06-05 00:43:15] [INFO ] Time to serialize properties into /tmp/LTL4135987180842559439.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/LTL7893708074408361516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2876519171820860036.hoa' '-atoms' '/tmp/LTL4135987180842559439.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/LTL4135987180842559439.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2876519171820860036.hoa
Detected timeout of ITS tools.
[2025-06-05 00:43:30] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:43:30] [INFO ] Flatten gal took : 24 ms
[2025-06-05 00:43:30] [INFO ] Time to serialize gal into /tmp/LTL1720185087882125945.gal : 5 ms
[2025-06-05 00:43:30] [INFO ] Time to serialize properties into /tmp/LTL8241291434598738493.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/LTL1720185087882125945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8241291434598738493.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("((p1499==0)&&(p2154==1))")))||("((p53==0)&&(p1257==1))")))))
Formula 0 simplified : G(F!"((p53==0)&&(p1257==1))" & FG!"((p1499==0)&&(p2154==1))")
Detected timeout of ITS tools.
[2025-06-05 00:43:45] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:43:45] [INFO ] Applying decomposition
[2025-06-05 00:43:45] [INFO ] Flatten gal took : 24 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/graph13837877481431005262.txt' '-o' '/tmp/graph13837877481431005262.bin' '-w' '/tmp/graph13837877481431005262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13837877481431005262.bin' '-l' '-1' '-v' '-w' '/tmp/graph13837877481431005262.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:43:45] [INFO ] Decomposing Gal with order
[2025-06-05 00:43:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:43:45] [INFO ] Removed a total of 637 redundant transitions.
[2025-06-05 00:43:45] [INFO ] Flatten gal took : 43 ms
[2025-06-05 00:43:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 10 ms.
[2025-06-05 00:43:45] [INFO ] Time to serialize gal into /tmp/LTL11893880778167421530.gal : 8 ms
[2025-06-05 00:43:45] [INFO ] Time to serialize properties into /tmp/LTL14771041486998235271.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/LTL11893880778167421530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14771041486998235271.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("((i24.i2.u224.p1499==0)&&(i35.i1.u323.p2154==1))")))||("((i0.i0.u1.p53==0)&&(i20.i0.u187.p1257==1))")))))
Formula 0 simplified : G(F!"((i0.i0.u1.p53==0)&&(i20.i0.u187.p1257==1))" & FG!"((i24.i2.u224.p1499==0)&&(i35.i1.u323.p2154==1))")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-12 finished in 302300 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 (F(p1) U G(!p2))))'
Support contains 5 out of 2135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2134 transition count 1895
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1935 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1934 transition count 1894
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 400 place count 1934 transition count 1694
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 800 place count 1734 transition count 1694
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 810 place count 1724 transition count 1684
Iterating global reduction 3 with 10 rules applied. Total rules applied 820 place count 1724 transition count 1684
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 820 place count 1724 transition count 1681
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 826 place count 1721 transition count 1681
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 3 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 3 with 1422 rules applied. Total rules applied 2248 place count 1010 transition count 970
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2250 place count 1008 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2251 place count 1007 transition count 968
Applied a total of 2251 rules in 273 ms. Remains 1007 /2135 variables (removed 1128) and now considering 968/2095 (removed 1127) transitions.
// Phase 1: matrix 968 rows 1007 cols
[2025-06-05 00:44:00] [INFO ] Computed 360 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:01] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-05 00:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:02] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:44:02] [INFO ] Redundant transitions in 89 ms returned [967]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 963 sub problems to find dead transitions.
// Phase 1: matrix 967 rows 1007 cols
[2025-06-05 00:44:02] [INFO ] Computed 360 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:14] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1004 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 963 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 1004/1974 variables, and 24 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/360 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 963/963 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 963 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1004 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1004 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 3 (OVERLAPS) 3/1007 variables, 340/364 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:58] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:58] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:59] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:59] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:59] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:44:59] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:00] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:00] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:00] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:00] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:00] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:01] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:01] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:01] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:01] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:02] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:02] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:02] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 30 ms to minimize.
SMT process timed out in 60343ms, After SMT, problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1007/2135 places, 967/2095 transitions.
Applied a total of 0 rules in 21 ms. Remains 1007 /1007 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62040 ms. Remains : 1007/2135 places, 967/2095 transitions.
Stuttering acceptance computed with spot in 123 ms :[p2, (NOT p1), p2]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-13
Stuttering criterion allowed to conclude after 2123 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-13 finished in 62206 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(F(p0))||(p1&&F(G(p1)))))))'
Support contains 3 out of 2135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2124 transition count 2084
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2124 transition count 2084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2123 transition count 2083
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2123 transition count 2083
Applied a total of 24 rules in 237 ms. Remains 2123 /2135 variables (removed 12) and now considering 2083/2095 (removed 12) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2025-06-05 00:45:02] [INFO ] Computed 361 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:03] [INFO ] Implicit Places using invariants in 694 ms returned []
[2025-06-05 00:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:05] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2791 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2025-06-05 00:45:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 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 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in LTL mode, iteration 1 : 2123/2135 places, 2083/2095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63534 ms. Remains : 2123/2135 places, 2083/2095 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-14
Product exploration explored 100000 steps with 26 reset in 759 ms.
Product exploration explored 100000 steps with 25 reset in 915 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29942 steps (5 resets) in 255 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2122 transition count 1881
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1921 transition count 1881
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1921 transition count 1680
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1720 transition count 1680
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2236 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2238 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2239 place count 1001 transition count 962
Applied a total of 2239 rules in 212 ms. Remains 1001 /2123 variables (removed 1122) and now considering 962/2083 (removed 1121) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2025-06-05 00:46:09] [INFO ] Computed 360 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:09] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-06-05 00:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:10] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:46:10] [INFO ] Redundant transitions in 87 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 960 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2025-06-05 00:46:10] [INFO ] Computed 360 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:23] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:23] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:24] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:24] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:24] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:24] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:26] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:27] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 23 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:28] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:29] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:30] [INFO ] Deduced a trap composed of 10 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-05 00:46:31] [INFO ] Deduced a trap composed of 10 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-05 00:46:31] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:31] [INFO ] Deduced a trap composed of 14 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-05 00:46:31] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:31] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:32] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:33] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:33] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:33] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:33] [INFO ] Deduced a trap composed of 14 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-05 00:46:33] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:34] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:41] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:42] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:42] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:43] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:44] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:45] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:46] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:47] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:47] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:50] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:50] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:51] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:51] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:51] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:52] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 14 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-05 00:46:53] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:53] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:54] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:55] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:55] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:55] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:56] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:56] [INFO ] Deduced a trap composed of 16 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-05 00:46:58] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:58] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:59] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:01] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:02] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:03] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:03] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:04] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:07] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:08] [INFO ] Deduced a trap composed of 10 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-05 00:47:08] [INFO ] Deduced a trap composed of 10 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-05 00:47:08] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:09] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:09] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:09] [INFO ] Deduced a trap composed of 10 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-05 00:47:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 479 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2123 places, 961/2083 transitions.
Applied a total of 0 rules in 19 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61852 ms. Remains : 1001/2123 places, 961/2083 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5852 steps (0 resets) in 76 ms. (76 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 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 62 reset in 719 ms.
Product exploration explored 100000 steps with 62 reset in 896 ms.
Built C files in :
/tmp/ltsmin9639009604290324383
[2025-06-05 00:47:12] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2025-06-05 00:47:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:47:12] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2025-06-05 00:47:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:47:13] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2025-06-05 00:47:13] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:47:13] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9639009604290324383
Running compilation step : cd /tmp/ltsmin9639009604290324383;'/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 2876 ms.
Running link step : cd /tmp/ltsmin9639009604290324383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9639009604290324383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10396083629387429939.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1000 transition count 960
Applied a total of 2 rules in 33 ms. Remains 1000 /1001 variables (removed 1) and now considering 960/961 (removed 1) transitions.
// Phase 1: matrix 960 rows 1000 cols
[2025-06-05 00:47:27] [INFO ] Computed 360 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:28] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-06-05 00:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:29] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:47:29] [INFO ] Redundant transitions in 87 ms returned []
Running 959 sub problems to find dead transitions.
[2025-06-05 00:47: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/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:42] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:42] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:43] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:43] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:43] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:43] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:44] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:44] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:44] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:44] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:45] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:45] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:45] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:45] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:45] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:46] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:46] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:46] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:46] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:46] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 29 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:47] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:48] [INFO ] Deduced a trap composed of 10 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-05 00:47:49] [INFO ] Deduced a trap composed of 10 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-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 10 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-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 10 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-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:49] [INFO ] Deduced a trap composed of 16 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-05 00:47:50] [INFO ] Deduced a trap composed of 14 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-05 00:47:50] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:50] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:50] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:51] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:51] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:51] [INFO ] Deduced a trap composed of 16 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-05 00:47:51] [INFO ] Deduced a trap composed of 14 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-05 00:47:52] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:01] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:01] [INFO ] Deduced a trap composed of 16 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-05 00:48:01] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:02] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:02] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:02] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:02] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:03] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:03] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:03] [INFO ] Deduced a trap composed of 14 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-05 00:48:03] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:04] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:04] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:04] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:04] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:04] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:05] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:05] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:07] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:07] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:09] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:09] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:09] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:09] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:10] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:10] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:10] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:11] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:11] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:11] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:12] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:12] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:12] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:12] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:13] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:13] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:13] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:14] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:15] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:16] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:16] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:18] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:18] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:20] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:20] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:20] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:21] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:21] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:22] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:25] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:26] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:27] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:27] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:29] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
SMT process timed out in 60181ms, After SMT, problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1001 places, 960/961 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61658 ms. Remains : 1000/1001 places, 960/961 transitions.
Built C files in :
/tmp/ltsmin9634146369298541730
[2025-06-05 00:48:29] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2025-06-05 00:48:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:48:29] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2025-06-05 00:48:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:48:29] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2025-06-05 00:48:29] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:48:29] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9634146369298541730
Running compilation step : cd /tmp/ltsmin9634146369298541730;'/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 2839 ms.
Running link step : cd /tmp/ltsmin9634146369298541730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9634146369298541730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased933873448151443205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:48:44] [INFO ] Flatten gal took : 27 ms
[2025-06-05 00:48:44] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:48:44] [INFO ] Time to serialize gal into /tmp/LTL9228940580707746454.gal : 5 ms
[2025-06-05 00:48:44] [INFO ] Time to serialize properties into /tmp/LTL14730732362362547822.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/LTL9228940580707746454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8360927105567228934.hoa' '-atoms' '/tmp/LTL14730732362362547822.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/LTL14730732362362547822.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8360927105567228934.hoa
Detected timeout of ITS tools.
[2025-06-05 00:48:59] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:48:59] [INFO ] Flatten gal took : 27 ms
[2025-06-05 00:48:59] [INFO ] Time to serialize gal into /tmp/LTL15774289999491214000.gal : 5 ms
[2025-06-05 00:48:59] [INFO ] Time to serialize properties into /tmp/LTL10867341298158919224.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/LTL15774289999491214000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10867341298158919224.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((p745==0)||(p2269==1))")))||(("(p537==1)")&&(F(G("(p537==1)"))))))))
Formula 0 simplified : XX(FG!"((p745==0)||(p2269==1))" & (!"(p537==1)" | GF!"(p537==1)"))
Detected timeout of ITS tools.
[2025-06-05 00:49:14] [INFO ] Flatten gal took : 33 ms
[2025-06-05 00:49:14] [INFO ] Applying decomposition
[2025-06-05 00:49:14] [INFO ] Flatten gal took : 27 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/graph15897706981704952273.txt' '-o' '/tmp/graph15897706981704952273.bin' '-w' '/tmp/graph15897706981704952273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15897706981704952273.bin' '-l' '-1' '-v' '-w' '/tmp/graph15897706981704952273.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:49:15] [INFO ] Decomposing Gal with order
[2025-06-05 00:49:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:49:15] [INFO ] Removed a total of 635 redundant transitions.
[2025-06-05 00:49:15] [INFO ] Flatten gal took : 38 ms
[2025-06-05 00:49:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 7 ms.
[2025-06-05 00:49:15] [INFO ] Time to serialize gal into /tmp/LTL11714241094229897256.gal : 6 ms
[2025-06-05 00:49:15] [INFO ] Time to serialize properties into /tmp/LTL6439790441818219442.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/LTL11714241094229897256.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6439790441818219442.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i11.i2.u108.p745==0)||(i37.i0.u341.p2269==1))")))||(("(i8.i1.u77.p537==1)")&&(F(G("(i8.i1.u77.p537==1)"))))))))
Formula 0 simplified : XX(FG!"((i11.i2.u108.p745==0)||(i37.i0.u341.p2269==1))" & (!"(i8.i1.u77.p537==1)" | GF!"(i8.i1.u77.p537==1)"))
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-14 finished in 267442 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(F(p1))&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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((X(p1)||((F(p2) U p1)&&X(p3))||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-040B-LTLCardinality-08
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Support contains 8 out of 2135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2135/2135 places, 2095/2095 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2134 transition count 1896
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1936 transition count 1896
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 396 place count 1936 transition count 1698
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 792 place count 1738 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 799 place count 1731 transition count 1691
Iterating global reduction 2 with 7 rules applied. Total rules applied 806 place count 1731 transition count 1691
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 806 place count 1731 transition count 1690
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 808 place count 1730 transition count 1690
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2242 place count 1013 transition count 973
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2244 place count 1011 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2245 place count 1010 transition count 971
Applied a total of 2245 rules in 277 ms. Remains 1010 /2135 variables (removed 1125) and now considering 971/2095 (removed 1124) transitions.
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:49:31] [INFO ] Computed 360 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:31] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-06-05 00:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:32] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Running 967 sub problems to find dead transitions.
[2025-06-05 00:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:45] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:45] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:46] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:46] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:46] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:46] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:46] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:47] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:47] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:47] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:47] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:48] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:49] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:49] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:49] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:49] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:50] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:51] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 10 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-05 00:49:52] [INFO ] Deduced a trap composed of 11 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-05 00:49:52] [INFO ] Deduced a trap composed of 10 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-05 00:49:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:52] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:53] [INFO ] Deduced a trap composed of 14 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-05 00:49:53] [INFO ] Deduced a trap composed of 16 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-05 00:49:53] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:53] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:53] [INFO ] Deduced a trap composed of 14 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-05 00:49:53] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:54] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:54] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:54] [INFO ] Deduced a trap composed of 16 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-05 00:49:54] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:54] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:49:55] [INFO ] Deduced a trap composed of 14 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-05 00:49:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 1.0)
(s776 1.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 1.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 1.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 1.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 1.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 0.0)
(s909 1.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 1.0)
(s918 0.0)
(s919 1.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 417 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:04] [INFO ] Deduced a trap composed of 14 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-05 00:50:04] [INFO ] Deduced a trap composed of 14 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-05 00:50:05] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:05] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:05] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:05] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:06] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:06] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:06] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:06] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:07] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:07] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:07] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:07] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:08] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:08] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:08] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:08] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:09] [INFO ] Deduced a trap composed of 16 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-05 00:50:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:10] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:10] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:11] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:12] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:12] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:13] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:13] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:13] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:13] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:14] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:14] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:14] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:14] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:15] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:15] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:16] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:16] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:19] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:20] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:21] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:21] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:21] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:22] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:22] [INFO ] Deduced a trap composed of 14 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-05 00:50:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:23] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:27] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:27] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:28] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:28] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:29] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:31] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:31] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 1)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 1)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 1)
(s436 1)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 1)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 1)
(s486 1)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(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 1)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 1)
(s533 0)
(s534 0)
(s535 1)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 0)
(s554 0)
(s555 0)
(s556 1)
(s557 0)
(s558 1)
(s559 0)
(s560 1)
(s561 0)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 1)
(s575 0)
(s576 0)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 0)
(s597 1)
(s598 0)
(s599 1)
(s600 0)
(s601 0)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 1)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 1)
(s625 0)
(s626 0)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 1)
(s632 0)
(s633 0)
(s634 1)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 1)
(s642 0)
(s643 1)
(s644 1)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 1)
(s653 0)
(s654 0)
(s655 0)
(s656 1)
(s657 0)
(s658 0)
(s659 1)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 1)
(s669 1)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 0)
(s677 1)
(s678 0)
(s679 0)
(s680 0)
(s681 1)
(s682 0)
(s683 0)
(s684 1)
(s685 0)
(s686 0)
(s687 1)
(s688 1)
(s689 0)
(s690 0)
(s691 1)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 0)
(s702 1)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 0)
(s709 1)
(s710 0)
(s711 0)
(s712 1)
(s713 1)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 0)
(s727 1)
(s728 0)
(s729 0)
(s730 0)
(s731 1)
(s732 0)
(s733 0)
(s734 1)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 1)
(s744 1)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 480 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1010/2135 places, 971/2095 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61734 ms. Remains : 1010/2135 places, 971/2095 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-08
Product exploration explored 100000 steps with 117 reset in 691 ms.
Product exploration explored 100000 steps with 116 reset in 864 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 353 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (16 resets) in 486 ms. (82 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
[2025-06-05 00:50:35] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 74/113 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 181/294 variables, 77/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 9/303 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/313 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 292/605 variables, 142/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 15/620 variables, 10/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/620 variables, 15/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/624 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/624 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/624 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 187/811 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/819 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/819 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/819 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/833 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/833 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/833 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/993 variables, 74/622 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/993 variables, 21/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/993 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 12/1005 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1005 variables, 12/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 112/1117 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1117 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1117 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 6/1123 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1123 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1123 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 6/1129 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1129 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1129 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 137/1266 variables, 64/821 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1266 variables, 17/838 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1266 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 10/1276 variables, 5/843 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1276 variables, 10/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 94/1370 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1370 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1370 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/1375 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1375 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1375 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (OVERLAPS) 4/1379 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1379 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 121/1500 variables, 58/991 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1500 variables, 15/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1500 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 8/1508 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1508 variables, 8/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (OVERLAPS) 67/1575 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1575 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1575 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 4/1579 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1579 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1579 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 2/1581 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1581 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 82/1663 variables, 38/1117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1663 variables, 10/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1663 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (OVERLAPS) 6/1669 variables, 3/1130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1669 variables, 6/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (OVERLAPS) 56/1725 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1725 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1725 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 3/1728 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1728 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1728 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (OVERLAPS) 2/1730 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1730 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (OVERLAPS) 80/1810 variables, 36/1220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1810 variables, 9/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1810 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 6/1816 variables, 3/1232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1816 variables, 6/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 56/1872 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1872 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1872 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 3/1875 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1875 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1875 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (OVERLAPS) 2/1877 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1877 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (OVERLAPS) 72/1949 variables, 36/1322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1949 variables, 10/1332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1949 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (OVERLAPS) 4/1953 variables, 2/1334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1953 variables, 4/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 74/113 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 181/294 variables, 77/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 9/303 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/313 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 292/605 variables, 142/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 39/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 15/620 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 15/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/620 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 4/624 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/624 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 187/811 variables, 104/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/811 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 8/819 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/819 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/819 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 14/833 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/833 variables, 10/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/833 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 160/993 variables, 74/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/993 variables, 21/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:42] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/993 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/993 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 12/1005 variables, 6/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 12/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 112/1117 variables, 59/728 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1117 variables, 17/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:42] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1117 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:43] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1117 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1117 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (OVERLAPS) 6/1123 variables, 9/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1123 variables, 6/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1123 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 6/1129 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1129 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1129 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (OVERLAPS) 137/1266 variables, 64/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1266 variables, 17/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:44] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 3 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1266 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1266 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 10/1276 variables, 5/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1276 variables, 10/864 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/1276 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:44] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:45] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:45] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:45] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1981 variables, and 869 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 220/360 constraints, State Equation: 633/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10020ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Partial Free-agglomeration rule applied 238 times.
Drop transitions (Partial Free agglomeration) removed 238 transitions
Iterating global reduction 0 with 238 rules applied. Total rules applied 238 place count 1010 transition count 971
Applied a total of 238 rules in 43 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1010/1010 places, 971/971 transitions.
RANDOM walk for 40000 steps (8 resets) in 457 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 163447 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 7
Probabilistic random walk after 163447 steps, saw 159780 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:50:48] [INFO ] Computed 360 invariants in 11 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/115 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 195/310 variables, 79/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 23/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 7/317 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/327 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 298/625 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 45/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/628 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/632 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/632 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 191/823 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/831 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/845 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/1005 variables, 86/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1005 variables, 27/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 122/1127 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1127 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1127 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 6/1133 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1133 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1133 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 6/1139 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1139 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1139 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 137/1276 variables, 74/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1276 variables, 22/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 104/1380 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1380 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1380 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 5/1385 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1385 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1385 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 4/1389 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1389 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 119/1508 variables, 66/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1508 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 73/1581 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1581 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1581 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 4/1585 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1585 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1585 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 2/1587 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1587 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 82/1669 variables, 44/1123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1669 variables, 13/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 62/1731 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1731 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1731 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 3/1734 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1734 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1734 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 2/1736 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1736 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 80/1816 variables, 42/1226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1816 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 60/1876 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1876 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1876 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (OVERLAPS) 3/1879 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1879 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1879 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (OVERLAPS) 2/1881 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1881 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 72/1953 variables, 40/1326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1953 variables, 12/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/115 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 195/310 variables, 79/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 23/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/317 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/327 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 298/625 variables, 154/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 45/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/625 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/628 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 4/632 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/632 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 191/823 variables, 104/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/823 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 8/831 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/831 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 14/845 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 10/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/845 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 160/1005 variables, 86/641 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 27/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [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-05 00:50:55] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1005 variables, 7/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:56] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1005 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:56] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 5 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1005 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:56] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 5 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1005 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 122/1127 variables, 59/739 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1127 variables, 17/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:57] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 6 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1127 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:57] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:57] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:57] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 5 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1127 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:57] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:58] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 6 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1127 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1127 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 6/1133 variables, 9/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1133 variables, 6/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1133 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 6/1139 variables, 3/780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1139 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1139 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 137/1276 variables, 74/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1276 variables, 22/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1276 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 104/1380 variables, 50/928 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1380 variables, 15/943 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:59] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 7 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1380 variables, 1/944 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1380 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 5/1385 variables, 8/952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1385 variables, 5/957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:00] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1385 variables, 1/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1385 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 4/1389 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1389 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 119/1508 variables, 66/1026 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1508 variables, 19/1045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1508 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 73/1581 variables, 38/1083 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1581 variables, 11/1094 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:01] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 6 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1581 variables, 1/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1581 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 4/1585 variables, 7/1102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1585 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1585 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 2/1587 variables, 1/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1587 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (OVERLAPS) 82/1669 variables, 44/1151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1669 variables, 13/1164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:03] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 6 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/1669 variables, 5/1169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:04] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 7 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1669 variables, 5/1174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1669 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (OVERLAPS) 62/1731 variables, 30/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1731 variables, 9/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:05] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 6 ms to minimize.
At refinement iteration 84 (INCLUDED_ONLY) 0/1731 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1731 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (OVERLAPS) 3/1734 variables, 5/1219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1734 variables, 3/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1734 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (OVERLAPS) 2/1736 variables, 1/1223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1736 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 80/1816 variables, 42/1265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1816 variables, 12/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1816 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 60/1876 variables, 30/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1876 variables, 9/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1876 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 3/1879 variables, 5/1321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1879 variables, 3/1324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1879 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (OVERLAPS) 2/1881 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1881 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (OVERLAPS) 72/1953 variables, 40/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1953 variables, 12/1377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1953 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (OVERLAPS) 22/1975 variables, 16/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1975 variables, 4/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1975 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (OVERLAPS) 2/1977 variables, 4/1401 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1977 variables, 2/1403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1977 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 4/1981 variables, 4/1407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1981 variables, 2/1409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1981 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (OVERLAPS) 0/1981 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1409 constraints, problems are : Problem set: 0 solved, 7 unsolved in 18284 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22747ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1287 ms.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 20 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 1010/1010 places, 971/971 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 21 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2025-06-05 00:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:51:13] [INFO ] Implicit Places using invariants in 522 ms returned []
[2025-06-05 00:51:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:51:14] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:51:14] [INFO ] Redundant transitions in 13 ms returned []
Running 967 sub problems to find dead transitions.
[2025-06-05 00:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:33] [INFO ] Deduced a trap composed of 9 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-05 00:51:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:35] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:42] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:42] [INFO ] Deduced a trap composed of 9 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-05 00:51:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:44] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:44] [INFO ] Deduced a trap composed of 9 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-05 00:51:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 392 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 35/392 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:54] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:54] [INFO ] Deduced a trap composed of 9 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-05 00:51:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:54] [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-05 00:51:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:54] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:51:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:06] [INFO ] Deduced a trap composed of 9 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-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 9 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-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:08] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:09] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 1)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 432 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61833 ms. Remains : 1010/1010 places, 971/971 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 532 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 18 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:52:15] [INFO ] Computed 360 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:52:16] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-05 00:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:52:17] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Running 967 sub problems to find dead transitions.
[2025-06-05 00:52: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/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:30] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:30] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:30] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:31] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:31] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:31] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:31] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:32] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:32] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:32] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:32] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:32] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:33] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:33] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:33] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:33] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:33] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 25 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:34] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:35] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:36] [INFO ] Deduced a trap composed of 10 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-05 00:52:36] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 11 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-05 00:52:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:37] [INFO ] Deduced a trap composed of 14 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-05 00:52:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:38] [INFO ] Deduced a trap composed of 14 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-05 00:52:38] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:38] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:38] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:39] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:39] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:39] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:39] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 417 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:48] [INFO ] Deduced a trap composed of 16 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-05 00:52:49] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:49] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:49] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:50] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:50] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:50] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:50] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:50] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:51] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:51] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:51] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:51] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:52] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:52] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:52] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:52] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:53] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:53] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:53] [INFO ] Deduced a trap composed of 16 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-05 00:52:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:55] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:55] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:55] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:56] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:57] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:57] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:57] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:58] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:58] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:58] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:58] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:59] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:59] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:52:59] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:00] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:00] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:00] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:00] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:04] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:05] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:06] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:06] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:06] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:06] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:07] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:07] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:07] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:08] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:11] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:12] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:13] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:13] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:16] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:16] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 480 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in LTL mode , in 1 iterations and 61502 ms. Remains : 1010/1010 places, 971/971 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 408 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (16 resets) in 477 ms. (83 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
[2025-06-05 00:53:18] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 74/113 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 181/294 variables, 77/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 9/303 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/313 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 292/605 variables, 142/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 39/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 15/620 variables, 10/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/620 variables, 15/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/624 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/624 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/624 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 187/811 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/819 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/819 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/819 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/833 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/833 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/833 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/993 variables, 74/622 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/993 variables, 21/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/993 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 12/1005 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1005 variables, 12/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 112/1117 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1117 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1117 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 6/1123 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1123 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1123 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 6/1129 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1129 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1129 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 137/1266 variables, 64/821 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1266 variables, 17/838 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1266 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 10/1276 variables, 5/843 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1276 variables, 10/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 94/1370 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1370 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1370 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/1375 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1375 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1375 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (OVERLAPS) 4/1379 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1379 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 121/1500 variables, 58/991 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1500 variables, 15/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1500 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 8/1508 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1508 variables, 8/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (OVERLAPS) 67/1575 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1575 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1575 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 4/1579 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1579 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1579 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (OVERLAPS) 2/1581 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1581 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 82/1663 variables, 38/1117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1663 variables, 10/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1663 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (OVERLAPS) 6/1669 variables, 3/1130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1669 variables, 6/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (OVERLAPS) 56/1725 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1725 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1725 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 3/1728 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1728 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1728 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (OVERLAPS) 2/1730 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1730 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (OVERLAPS) 80/1810 variables, 36/1220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1810 variables, 9/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1810 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 6/1816 variables, 3/1232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1816 variables, 6/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 56/1872 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1872 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1872 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 3/1875 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1875 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1875 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (OVERLAPS) 2/1877 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1877 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (OVERLAPS) 72/1949 variables, 36/1322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1949 variables, 10/1332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1949 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (OVERLAPS) 4/1953 variables, 2/1334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1953 variables, 4/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 74/113 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 181/294 variables, 77/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 9/303 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/313 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 292/605 variables, 142/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 39/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 15/620 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/620 variables, 15/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/620 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 4/624 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/624 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 187/811 variables, 104/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/811 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 8/819 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/819 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/819 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 14/833 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/833 variables, 10/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/833 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 160/993 variables, 74/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/993 variables, 21/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 4 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/993 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/993 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 12/1005 variables, 6/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 12/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 112/1117 variables, 59/728 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1117 variables, 17/745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:26] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1117 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:26] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1117 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1117 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (OVERLAPS) 6/1123 variables, 9/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1123 variables, 6/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1123 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 6/1129 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1129 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1129 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (OVERLAPS) 137/1266 variables, 64/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1266 variables, 17/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:27] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1266 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1266 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 10/1276 variables, 5/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1276 variables, 10/864 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/1276 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:28] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:28] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:28] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:28] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1981 variables, and 869 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 220/360 constraints, State Equation: 633/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10020ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Partial Free-agglomeration rule applied 238 times.
Drop transitions (Partial Free agglomeration) removed 238 transitions
Iterating global reduction 0 with 238 rules applied. Total rules applied 238 place count 1010 transition count 971
Applied a total of 238 rules in 48 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1010/1010 places, 971/971 transitions.
RANDOM walk for 40000 steps (8 resets) in 454 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 151862 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 7
Probabilistic random walk after 151862 steps, saw 148497 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:53:32] [INFO ] Computed 360 invariants in 11 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/115 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 195/310 variables, 79/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 23/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 7/317 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/327 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 298/625 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 45/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/628 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 4/632 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/632 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 191/823 variables, 104/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/823 variables, 32/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 8/831 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/831 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 14/845 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 160/1005 variables, 86/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1005 variables, 27/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 122/1127 variables, 59/720 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1127 variables, 17/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1127 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 6/1133 variables, 9/746 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1133 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1133 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 6/1139 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1139 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1139 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 137/1276 variables, 74/831 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1276 variables, 22/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1276 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 104/1380 variables, 50/903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1380 variables, 15/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1380 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 5/1385 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1385 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1385 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 4/1389 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1389 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 119/1508 variables, 66/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1508 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1508 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 73/1581 variables, 38/1056 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1581 variables, 11/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1581 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 4/1585 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1585 variables, 4/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1585 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 2/1587 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1587 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 82/1669 variables, 44/1123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1669 variables, 13/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1669 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (OVERLAPS) 62/1731 variables, 30/1166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1731 variables, 9/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1731 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 3/1734 variables, 5/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1734 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1734 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 2/1736 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1736 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 80/1816 variables, 42/1226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1816 variables, 12/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1816 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 60/1876 variables, 30/1268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1876 variables, 9/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1876 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (OVERLAPS) 3/1879 variables, 5/1282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1879 variables, 3/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1879 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (OVERLAPS) 2/1881 variables, 1/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1881 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 72/1953 variables, 40/1326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1953 variables, 12/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1953 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (OVERLAPS) 22/1975 variables, 16/1354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1975 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1975 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (OVERLAPS) 2/1977 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1977 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1977 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (OVERLAPS) 4/1981 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1981 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4598 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/115 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 195/310 variables, 79/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 23/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/317 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/327 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 298/625 variables, 154/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/625 variables, 45/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/625 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/628 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 4/632 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/632 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/632 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 191/823 variables, 104/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/823 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/823 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 8/831 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/831 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/831 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 14/845 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 10/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/845 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 160/1005 variables, 86/641 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1005 variables, 27/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:38] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:38] [INFO ] Deduced a trap composed of 8 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-05 00:53:38] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:38] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:38] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1005 variables, 7/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 5 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1005 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1005 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1005 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1005 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1005 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (OVERLAPS) 122/1127 variables, 59/739 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1127 variables, 17/756 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:40] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1127 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:40] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:40] [INFO ] Deduced a trap composed of 25 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-05 00:53:40] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 4 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1127 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:41] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1127 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1127 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 6/1133 variables, 9/771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1133 variables, 6/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1133 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 6/1139 variables, 3/780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1139 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1139 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 137/1276 variables, 74/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1276 variables, 22/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:42] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:42] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:42] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1276 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1276 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (OVERLAPS) 104/1380 variables, 50/931 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1380 variables, 15/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:43] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 5 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1380 variables, 1/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1380 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 5/1385 variables, 8/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1385 variables, 5/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1385 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 4/1389 variables, 2/962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1389 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (OVERLAPS) 119/1508 variables, 66/1028 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1508 variables, 19/1047 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 9 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1508 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1508 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 73/1581 variables, 38/1086 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1581 variables, 11/1097 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:45] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/1581 variables, 1/1098 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1581 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (OVERLAPS) 4/1585 variables, 7/1105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1585 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1585 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (OVERLAPS) 2/1587 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1587 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (OVERLAPS) 82/1669 variables, 44/1154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1669 variables, 13/1167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:47] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:47] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:47] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:47] [INFO ] Deduced a trap composed of 23 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-05 00:53:47] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:47] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:48] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 9 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1669 variables, 7/1174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1669 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (OVERLAPS) 62/1731 variables, 30/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1731 variables, 9/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1731 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (OVERLAPS) 3/1734 variables, 5/1218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1734 variables, 3/1221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:49] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 11 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/1734 variables, 1/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1734 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (OVERLAPS) 2/1736 variables, 1/1223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1736 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 80/1816 variables, 42/1265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1816 variables, 12/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1816 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (OVERLAPS) 60/1876 variables, 30/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1876 variables, 9/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1876 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (OVERLAPS) 3/1879 variables, 5/1321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1879 variables, 3/1324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1879 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (OVERLAPS) 2/1881 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1881 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (OVERLAPS) 72/1953 variables, 40/1365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1953 variables, 12/1377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1953 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (OVERLAPS) 22/1975 variables, 16/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1975 variables, 4/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:53:53] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 9 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1975 variables, 1/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1975 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (OVERLAPS) 2/1977 variables, 4/1402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1977 variables, 2/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1977 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (OVERLAPS) 4/1981 variables, 4/1408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1981 variables, 2/1410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1981 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (OVERLAPS) 0/1981 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1410 constraints, problems are : Problem set: 0 solved, 7 unsolved in 18732 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23350ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2393 ms.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 20 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 1010/1010 places, 971/971 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 19 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2025-06-05 00:53:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:53:58] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-05 00:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:53:59] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:53:59] [INFO ] Redundant transitions in 12 ms returned []
Running 967 sub problems to find dead transitions.
[2025-06-05 00:53:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:13] [INFO ] Deduced a trap composed of 9 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-05 00:54:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 9 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-05 00:54:17] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:17] [INFO ] Deduced a trap composed of 9 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-05 00:54:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:18] [INFO ] Deduced a trap composed of 9 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-05 00:54:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:19] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:19] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:27] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:27] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:28] [INFO ] Deduced a trap composed of 9 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-05 00:54:28] [INFO ] Deduced a trap composed of 9 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-05 00:54:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:29] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 392 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 35/392 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 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-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:39] [INFO ] Deduced a trap composed of 9 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-05 00:54:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:39] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:39] [INFO ] Deduced a trap composed of 10 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-05 00:54:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:39] [INFO ] Deduced a trap composed of 9 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-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:50] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:50] [INFO ] Deduced a trap composed of 9 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-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:51] [INFO ] Deduced a trap composed of 9 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-05 00:54:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:54:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 432 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61823 ms. Remains : 1010/1010 places, 971/971 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 561 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 117 reset in 734 ms.
Product exploration explored 100000 steps with 116 reset in 874 ms.
Built C files in :
/tmp/ltsmin9196709300543210008
[2025-06-05 00:55:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9196709300543210008
Running compilation step : cd /tmp/ltsmin9196709300543210008;'/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 1720 ms.
Running link step : cd /tmp/ltsmin9196709300543210008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9196709300543210008;'/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/stateBased14059005731377759505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1010 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 13 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
// Phase 1: matrix 971 rows 1010 cols
[2025-06-05 00:55:17] [INFO ] Computed 360 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:55:18] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-05 00:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:55:19] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Running 967 sub problems to find dead transitions.
[2025-06-05 00:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:32] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:33] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:33] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:33] [INFO ] Deduced a trap composed of 10 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-05 00:55:33] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:34] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:34] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:34] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:34] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:34] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:35] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:35] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:35] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:35] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:35] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:36] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:36] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:36] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:36] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:36] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:37] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:38] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 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-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:39] [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-05 00:55:39] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 11 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-05 00:55:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 16 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-05 00:55:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:40] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:41] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:41] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:41] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:41] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:42] [INFO ] Deduced a trap composed of 14 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-05 00:55:42] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:42] [INFO ] Deduced a trap composed of 14 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-05 00:55:42] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 10 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 417 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:51] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:51] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:51] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:52] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:52] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:52] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:52] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:53] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:53] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:53] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:53] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:53] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:54] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:54] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:54] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:55] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:55] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:55] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:55] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:56] [INFO ] Deduced a trap composed of 16 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-05 00:55:56] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:57] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:57] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:58] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:58] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:55:59] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:00] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:00] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:00] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:00] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:01] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:01] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:01] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:02] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:02] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:02] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:02] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:03] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:03] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:06] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:07] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:08] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:08] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:08] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:09] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:09] [INFO ] Deduced a trap composed of 14 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-05 00:56:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:10] [INFO ] Deduced a trap composed of 15 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-05 00:56:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:10] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:14] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:14] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:14] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:15] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:15] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:16] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:18] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:56:19] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 480 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 61533 ms. Remains : 1010/1010 places, 971/971 transitions.
Built C files in :
/tmp/ltsmin17577887685948184538
[2025-06-05 00:56:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17577887685948184538
Running compilation step : cd /tmp/ltsmin17577887685948184538;'/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 1670 ms.
Running link step : cd /tmp/ltsmin17577887685948184538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17577887685948184538;'/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/stateBased11645690770032731468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:56:34] [INFO ] Flatten gal took : 129 ms
[2025-06-05 00:56:34] [INFO ] Flatten gal took : 101 ms
[2025-06-05 00:56:34] [INFO ] Time to serialize gal into /tmp/LTL8933003362762733041.gal : 22 ms
[2025-06-05 00:56:34] [INFO ] Time to serialize properties into /tmp/LTL13707353925778908073.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/LTL8933003362762733041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15860074890472977918.hoa' '-atoms' '/tmp/LTL13707353925778908073.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/LTL13707353925778908073.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15860074890472977918.hoa
Detected timeout of ITS tools.
[2025-06-05 00:56:50] [INFO ] Flatten gal took : 57 ms
[2025-06-05 00:56:50] [INFO ] Flatten gal took : 36 ms
[2025-06-05 00:56:50] [INFO ] Time to serialize gal into /tmp/LTL15988057126454493477.gal : 4 ms
[2025-06-05 00:56:50] [INFO ] Time to serialize properties into /tmp/LTL17652411958421772261.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/LTL15988057126454493477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17652411958421772261.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(((X("((p2155==0)||(p429==1))"))||("(p1317==0)"))||(("(p2275==1)")||(((F("((p1953==0)||(p1366==1))"))U("((p2155==0)||(p429==1))"...195
Formula 0 simplified : GF((!"(p1317==0)" & !"(p2275==1)" & X!"((p2155==0)||(p429==1))" & (G!"((p1953==0)||(p1366==1))" R !"((p2155==0)||(p429==1))")) | (!"...245
Detected timeout of ITS tools.
[2025-06-05 00:57:05] [INFO ] Flatten gal took : 34 ms
[2025-06-05 00:57:05] [INFO ] Applying decomposition
[2025-06-05 00:57:05] [INFO ] Flatten gal took : 31 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/graph9909489505676714382.txt' '-o' '/tmp/graph9909489505676714382.bin' '-w' '/tmp/graph9909489505676714382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9909489505676714382.bin' '-l' '-1' '-v' '-w' '/tmp/graph9909489505676714382.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:57:05] [INFO ] Decomposing Gal with order
[2025-06-05 00:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:57:05] [INFO ] Removed a total of 648 redundant transitions.
[2025-06-05 00:57:05] [INFO ] Flatten gal took : 88 ms
[2025-06-05 00:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 594 labels/synchronizations in 25 ms.
[2025-06-05 00:57:05] [INFO ] Time to serialize gal into /tmp/LTL2729820529575760135.gal : 11 ms
[2025-06-05 00:57:05] [INFO ] Time to serialize properties into /tmp/LTL10114723678193575024.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/LTL2729820529575760135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10114723678193575024.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(((X("((i35.i2.u327.p2155==0)||(i6.i1.u60.p429==1))"))||("(i21.i1.u198.p1317==0)"))||(("(i37.i2.u347.p2275==1)")||(((F("((i32.i0...309
Formula 0 simplified : GF((!"(i21.i1.u198.p1317==0)" & !"(i37.i2.u347.p2275==1)" & X!"((i35.i2.u327.p2155==0)||(i6.i1.u60.p429==1))" & (G!"((i32.i0.u296.p1...405
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-08 finished in 470506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(p0 U X(X((X((p1 U p2))&&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' '!(F(G((p0||X(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(X((G(F(p0))||(p1&&F(G(p1)))))))'
[2025-06-05 00:57:21] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1444680197449882833
[2025-06-05 00:57:21] [INFO ] Too many transitions (2095) to apply POR reductions. Disabling POR matrices.
[2025-06-05 00:57:21] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1444680197449882833
Running compilation step : cd /tmp/ltsmin1444680197449882833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '120' '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-05 00:57:21] [INFO ] Applying decomposition
[2025-06-05 00:57:21] [INFO ] Flatten gal took : 48 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/graph9455739954319500589.txt' '-o' '/tmp/graph9455739954319500589.bin' '-w' '/tmp/graph9455739954319500589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9455739954319500589.bin' '-l' '-1' '-v' '-w' '/tmp/graph9455739954319500589.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:57:21] [INFO ] Decomposing Gal with order
[2025-06-05 00:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:57:21] [INFO ] Removed a total of 920 redundant transitions.
[2025-06-05 00:57:21] [INFO ] Flatten gal took : 94 ms
[2025-06-05 00:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 00:57:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality7461929394152352176.gal : 17 ms
[2025-06-05 00:57:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality11626537100037976581.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/LTLCardinality7461929394152352176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11626537100037976581.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 6 LTL properties
Checking formula 0 : !((F(("((i13.i1.u289.p852==0)&&(i8.i1.u182.p530==1))")&&(G(F("(i34.i1.u695.p2062==1)"))))))
Formula 0 simplified : FG!"(i34.i1.u695.p2062==1)" | G!"((i13.i1.u289.p852==0)&&(i8.i1.u182.p530==1))"
Compilation finished in 4487 ms.
Running link step : cd /tmp/ltsmin1444680197449882833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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' '<>(([](<>((LTLAPp1==true)))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/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' '<>(([](<>((LTLAPp1==true)))&&(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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((LTLAPp4==true))||((<>((LTLAPp5==true)) U (LTLAPp4==true))&&X((LTLAPp6==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/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((LTLAPp4==true))||((<>((LTLAPp5==true)) U (LTLAPp4==true))&&X((LTLAPp6==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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(!((LTLAPp7==true) U X(X((X(((LTLAPp8==true) U (LTLAPp9==true)))&&(LTLAPp8==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/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(!((LTLAPp7==true) U X(X((X(((LTLAPp8==true) U (LTLAPp9==true)))&&(LTLAPp8==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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' '<>([](((LTLAPp10==true)||X(<>((LTLAPp11==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/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' '<>([](((LTLAPp10==true)||X(<>((LTLAPp11==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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(([](<>((LTLAPp12==true)))||((LTLAPp13==true)&&<>([]((LTLAPp13==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1444680197449882833;'/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(([](<>((LTLAPp12==true)))||((LTLAPp13==true)&&<>([]((LTLAPp13==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin1444680197449882833;'/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' '<>(([](<>((LTLAPp1==true)))&&(LTLAPp0==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-040B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532600387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;