About the Execution of ITS-Tools for DoubleExponent-PT-020
| 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 | ??????T??FF???T? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600503.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 DoubleExponent-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600503
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.1K 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 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-ReachabilityFireability-2023-13
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2023-14
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2024-15
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-00
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-01
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-02
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-03
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-04
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-05
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-06
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-07
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-08
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-09
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-10
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-2025-12
=== Now, execution of the tool begins
BK_START 1748745024142
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-01 02:30:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 02:30:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 02:30:25] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-06-01 02:30:25] [INFO ] Transformed 1064 places.
[2025-06-01 02:30:25] [INFO ] Transformed 998 transitions.
[2025-06-01 02:30:25] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1326 resets) in 1710 ms. (23 steps per ms) remains 16/16 properties
[2025-06-01 02:30:26] [INFO ] Flatten gal took : 165 ms
BEST_FIRST walk for 4000 steps (110 resets) in 134 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 99 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
[2025-06-01 02:30:26] [INFO ] Flatten gal took : 130 ms
BEST_FIRST walk for 4001 steps (115 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
[2025-06-01 02:30:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2137907110896023325.gal : 64 ms
BEST_FIRST walk for 4001 steps (106 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
[2025-06-01 02:30:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15432104995552637473.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2137907110896023325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15432104995552637473.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (114 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
its-reach command run as :
BEST_FIRST walk for 4000 steps (112 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4000 steps (111 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality15432104995552637473.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 69
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :69 after 137
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :137 after 513
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :513 after 2689
Reachability property DoubleExponent-PT-020-ReachabilityFireability-2025-10 is true.
FORMULA DoubleExponent-PT-020-ReachabilityFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :2689 after 24181
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :24181 after 108118
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :108118 after 342681
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :342681 after 883822
Interrupted probabilistic random walk after 131986 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :1 out of 16
Probabilistic random walk after 131986 steps, saw 66010 distinct states, run finished after 3006 ms. (steps per millisecond=43 ) properties seen :1
// Phase 1: matrix 998 rows 1064 cols
[2025-06-01 02:30:29] [INFO ] Invariants computation overflowed in 122 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,15 properties remain. new max is 32768
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD size :883822 after 2.05847e+06
At refinement iteration 1 (OVERLAPS) 480/697 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 942/1639 variables, 538/755 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1639 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 394/2033 variables, 281/1036 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2033 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DoubleExponent-PT-020-ReachabilityFireability-2025-02 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-020-ReachabilityFireability-2025-05 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 29/2062 variables, 28/1064 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2062/2062 variables, and 1064 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5039 ms.
Refiners :[State Equation: 1064/1064 constraints, PredecessorRefiner: 15/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 370/528 variables, 158/158 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 889/1417 variables, 470/628 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1417 variables, 10/638 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1417 variables, 0/638 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 544/1961 variables, 350/988 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:30:38] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1961 variables, 1/989 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:30:40] [INFO ] Deduced a trap along path composed of 17 places in 90 ms of which 10 ms to minimize.
SMT process timed out in 10328ms, After SMT, problems are : Problem set: 2 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30003 ms.
Support contains 158 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 1057 transition count 884
Reduce places removed 112 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 147 rules applied. Total rules applied 263 place count 945 transition count 849
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 298 place count 910 transition count 849
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 298 place count 910 transition count 796
Deduced a syphon composed of 53 places in 33 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 404 place count 857 transition count 796
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 14 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 622 place count 748 transition count 687
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 674 place count 722 transition count 687
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 678 place count 722 transition count 683
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 682 place count 718 transition count 683
Free-agglomeration rule (complex) applied 66 times.
Iterating global reduction 4 with 66 rules applied. Total rules applied 748 place count 718 transition count 617
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 4 with 66 rules applied. Total rules applied 814 place count 652 transition count 617
Partial Free-agglomeration rule applied 53 times.
Drop transitions (Partial Free agglomeration) removed 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 867 place count 652 transition count 617
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 868 place count 652 transition count 617
Applied a total of 868 rules in 470 ms. Remains 652 /1064 variables (removed 412) and now considering 617/998 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 652/1064 places, 617/998 transitions.
RANDOM walk for 40000 steps (1926 resets) in 297 ms. (134 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1539 resets) in 281 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1556 resets) in 267 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1536 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1547 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1547 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1563 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1543 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1544 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1518 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1547 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1544 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1544 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1554 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 156767 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 13
Probabilistic random walk after 156767 steps, saw 78406 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 617 rows 652 cols
[2025-06-01 02:31:15] [INFO ] Computed 100 invariants in 118 ms
[2025-06-01 02:31:15] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 8/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DoubleExponent-PT-020-ReachabilityFireability-2025-06 is UNSAT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 474/640 variables, 92/94 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/652 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 617/1269 variables, 652/752 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1269 variables, 36/788 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1269 variables, 0/788 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1269 variables, 0/788 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1269/1269 variables, and 788 constraints, problems are : Problem set: 1 solved, 12 unsolved in 27395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 652/652 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 13/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 5/120 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 499/623 variables, 85/87 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:44] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:44] [INFO ] Deduced a trap composed of 29 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-01 02:31:44] [INFO ] Deduced a trap composed of 36 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-01 02:31:44] [INFO ] Deduced a trap composed of 36 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-01 02:31:44] [INFO ] Deduced a trap composed of 38 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-01 02:31:45] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:45] [INFO ] Deduced a trap composed of 42 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-01 02:31:45] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:45] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:45] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:46] [INFO ] Deduced a trap composed of 49 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-01 02:31:46] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:46] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:46] [INFO ] Deduced a trap composed of 52 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-01 02:31:46] [INFO ] Deduced a trap composed of 52 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-01 02:31:47] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:47] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 20/107 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 62 places in 191 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:50] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:50] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:50] [INFO ] Deduced a trap composed of 89 places in 199 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:50] [INFO ] Deduced a trap composed of 90 places in 203 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:50] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 84 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-01 02:31:51] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:52] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:52] [INFO ] Deduced a trap composed of 107 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-01 02:31:52] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:52] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:52] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 120 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-01 02:31:53] [INFO ] Deduced a trap composed of 126 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-01 02:31:53] [INFO ] Deduced a trap composed of 130 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-01 02:31:53] [INFO ] Deduced a trap composed of 195 places in 178 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 195 places in 173 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 194 places in 173 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:54] [INFO ] Deduced a trap composed of 197 places in 175 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:54] [INFO ] Deduced a trap composed of 196 places in 169 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:54] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:54] [INFO ] Deduced a trap composed of 196 places in 156 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:54] [INFO ] Deduced a trap composed of 198 places in 158 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 201 places in 159 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 203 places in 157 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 197 places in 154 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 199 places in 158 ms of which 40 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :2.05847e+06 after 1.52576e+08
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 169 places in 124 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 134 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-01 02:31:58] [INFO ] Deduced a trap composed of 183 places in 195 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:58] [INFO ] Deduced a trap composed of 186 places in 198 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:58] [INFO ] Deduced a trap composed of 184 places in 208 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:58] [INFO ] Deduced a trap composed of 187 places in 210 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 176 places in 239 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 176 places in 224 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 177 places in 165 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 190 places in 161 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:00] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 20/167 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:00] [INFO ] Deduced a trap composed of 188 places in 206 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:00] [INFO ] Deduced a trap composed of 188 places in 213 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:01] [INFO ] Deduced a trap composed of 190 places in 208 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:01] [INFO ] Deduced a trap composed of 190 places in 209 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:01] [INFO ] Deduced a trap composed of 194 places in 212 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:01] [INFO ] Deduced a trap composed of 189 places in 237 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:02] [INFO ] Deduced a trap composed of 190 places in 222 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:02] [INFO ] Deduced a trap composed of 193 places in 225 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:02] [INFO ] Deduced a trap composed of 190 places in 206 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:02] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:03] [INFO ] Deduced a trap composed of 191 places in 167 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:03] [INFO ] Deduced a trap composed of 190 places in 191 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:03] [INFO ] Deduced a trap composed of 191 places in 169 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:03] [INFO ] Deduced a trap composed of 193 places in 185 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 196 places in 176 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 193 places in 167 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 193 places in 172 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:05] [INFO ] Deduced a trap composed of 194 places in 168 ms of which 44 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 20/187 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:06] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 189 places in 182 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 190 places in 165 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 193 places in 160 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:08] [INFO ] Deduced a trap composed of 196 places in 183 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:08] [INFO ] Deduced a trap composed of 195 places in 166 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:08] [INFO ] Deduced a trap composed of 198 places in 167 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:08] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:08] [INFO ] Deduced a trap composed of 194 places in 181 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:09] [INFO ] Deduced a trap composed of 198 places in 169 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:09] [INFO ] Deduced a trap composed of 196 places in 152 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:09] [INFO ] Deduced a trap composed of 201 places in 163 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:09] [INFO ] Deduced a trap composed of 138 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-01 02:32:09] [INFO ] Deduced a trap composed of 140 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-01 02:32:10] [INFO ] Deduced a trap composed of 211 places in 201 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:10] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:10] [INFO ] Deduced a trap composed of 212 places in 202 ms of which 58 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 19/206 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:11] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:11] [INFO ] Deduced a trap composed of 206 places in 150 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:11] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:11] [INFO ] Deduced a trap composed of 204 places in 154 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:11] [INFO ] Deduced a trap composed of 198 places in 152 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:12] [INFO ] Deduced a trap composed of 199 places in 151 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:12] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/623 variables, 7/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:14] [INFO ] Deduced a trap composed of 202 places in 152 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:14] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:15] [INFO ] Deduced a trap composed of 205 places in 157 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:15] [INFO ] Deduced a trap composed of 200 places in 155 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:15] [INFO ] Deduced a trap composed of 208 places in 155 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:16] [INFO ] Deduced a trap composed of 203 places in 153 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:16] [INFO ] Deduced a trap composed of 208 places in 160 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:16] [INFO ] Deduced a trap composed of 210 places in 173 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:17] [INFO ] Deduced a trap composed of 208 places in 171 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:17] [INFO ] Deduced a trap composed of 211 places in 166 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:18] [INFO ] Deduced a trap composed of 213 places in 181 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:19] [INFO ] Deduced a trap composed of 213 places in 158 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:20] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:20] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:21] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:21] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:21] [INFO ] Deduced a trap composed of 171 places in 238 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:21] [INFO ] Deduced a trap composed of 174 places in 229 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:22] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:22] [INFO ] Deduced a trap composed of 170 places in 245 ms of which 97 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/623 variables, 20/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:23] [INFO ] Deduced a trap composed of 199 places in 157 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:23] [INFO ] Deduced a trap composed of 198 places in 159 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:23] [INFO ] Deduced a trap composed of 199 places in 153 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:23] [INFO ] Deduced a trap composed of 201 places in 152 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:24] [INFO ] Deduced a trap composed of 201 places in 155 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:24] [INFO ] Deduced a trap composed of 202 places in 152 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:24] [INFO ] Deduced a trap composed of 202 places in 155 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:24] [INFO ] Deduced a trap composed of 200 places in 153 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:25] [INFO ] Deduced a trap composed of 201 places in 154 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:25] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 39 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/623 variables, 10/243 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:26] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:27] [INFO ] Deduced a trap composed of 143 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-01 02:32:27] [INFO ] Deduced a trap composed of 210 places in 202 ms of which 55 ms to minimize.
SMT process timed out in 72674ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 617/617 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 652 transition count 609
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 644 transition count 607
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 642 transition count 607
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 9 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 54 place count 625 transition count 590
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 625 transition count 589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 624 transition count 589
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 71 place count 624 transition count 574
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 86 place count 609 transition count 574
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 98 place count 609 transition count 574
Applied a total of 98 rules in 157 ms. Remains 609 /652 variables (removed 43) and now considering 574/617 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 609/652 places, 574/617 transitions.
RANDOM walk for 40000 steps (2079 resets) in 366 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1651 resets) in 180 ms. (220 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1638 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1650 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1661 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1636 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1632 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1661 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1627 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1650 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1644 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1635 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1665 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 189969 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 12
Probabilistic random walk after 189969 steps, saw 95028 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 574 rows 609 cols
[2025-06-01 02:32:31] [INFO ] Invariants computation overflowed in 61 ms
[2025-06-01 02:32:31] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 346/461 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 596/1057 variables, 385/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 33/538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 126/1183 variables, 109/647 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1183 variables, 11/658 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1183 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1183 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1183/1183 variables, and 658 constraints, problems are : Problem set: 0 solved, 12 unsolved in 9793 ms.
Refiners :[State Equation: 609/609 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 346/461 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 596/1057 variables, 385/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 33/538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 10/548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:42] [INFO ] Deduced a trap composed of 13 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-01 02:32:43] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:44] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:44] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:44] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:44] [INFO ] Deduced a trap along path 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-01 02:32:44] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:32:44] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 6/556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 126/1183 variables, 109/665 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1183 variables, 11/676 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:02] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:02] [INFO ] Deduced a trap composed of 24 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-01 02:33:02] [INFO ] Deduced a trap composed of 23 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-01 02:33:03] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:03] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:03] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:03] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:04] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:04] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:04] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:04] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:05] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:05] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:05] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:05] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:06] [INFO ] Deduced a trap composed of 75 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-01 02:33:07] [INFO ] Deduced a trap composed of 161 places in 251 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:07] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:07] [INFO ] Deduced a trap composed of 161 places in 241 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:08] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 70 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1183 variables, 20/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:13] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:13] [INFO ] Deduced a trap composed of 65 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-01 02:33:14] [INFO ] Deduced a trap composed of 159 places in 260 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:15] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:15] [INFO ] Deduced a trap composed of 159 places in 288 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:15] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:16] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:16] [INFO ] Deduced a trap composed of 163 places in 251 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:16] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:17] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:17] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:17] [INFO ] Deduced a trap composed of 163 places in 258 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:18] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:19] [INFO ] Deduced a trap composed of 163 places in 241 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:19] [INFO ] Deduced a trap composed of 159 places in 236 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:19] [INFO ] Deduced a trap composed of 162 places in 301 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:20] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:20] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:20] [INFO ] Deduced a trap composed of 158 places in 268 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:21] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 95 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1183 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:37] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:38] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:38] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:38] [INFO ] Deduced a trap composed of 86 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-01 02:33:38] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:38] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:38] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:39] [INFO ] Deduced a trap composed of 77 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-01 02:33:39] [INFO ] Deduced a trap composed of 82 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-01 02:33:39] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:40] [INFO ] Deduced a trap composed of 82 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-01 02:33:40] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:42] [INFO ] Deduced a trap composed of 54 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-01 02:33:42] [INFO ] Deduced a trap composed of 60 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-01 02:33:42] [INFO ] Deduced a trap composed of 112 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-01 02:33:47] [INFO ] Deduced a trap composed of 78 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-01 02:33:49] [INFO ] Deduced a trap composed of 75 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-01 02:33:51] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:51] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:33:52] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 18 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1183 variables, 20/736 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/1183 variables, and 736 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75013 ms.
Refiners :[State Equation: 609/609 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 84892ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 574/574 transitions.
Applied a total of 0 rules in 19 ms. Remains 609 /609 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 609/609 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 574/574 transitions.
Applied a total of 0 rules in 22 ms. Remains 609 /609 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 609 cols
[2025-06-01 02:33:56] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:33:56] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 574 rows 609 cols
[2025-06-01 02:33:56] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:33:57] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:34:06] [INFO ] Implicit Places using invariants and state equation in 9668 ms returned [62, 69, 93, 100, 128, 133, 155, 162, 187, 192, 193, 273, 293, 330, 337, 368, 375, 436, 467, 473, 501, 507, 530, 600, 607]
[2025-06-01 02:34:06] [INFO ] Actually due to overlaps returned [69, 473, 337, 62, 192, 467, 600, 436, 273, 293, 330, 607]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 9997 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 597/609 places, 574/574 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 597 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 596 transition count 573
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 596 transition count 573
Applied a total of 3 rules in 47 ms. Remains 596 /597 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 596 cols
[2025-06-01 02:34:06] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:34:06] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 573 rows 596 cols
[2025-06-01 02:34:06] [INFO ] Invariants computation overflowed in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:34:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:34:18] [INFO ] Implicit Places using invariants and state equation in 11136 ms returned [91, 98, 126, 131, 153, 160, 185, 190, 360, 367, 490, 496, 519]
[2025-06-01 02:34:18] [INFO ] Actually due to overlaps returned [98, 91, 490, 496, 360, 367]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 11425 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 590/609 places, 573/574 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 588 transition count 571
Applied a total of 4 rules in 57 ms. Remains 588 /590 variables (removed 2) and now considering 571/573 (removed 2) transitions.
// Phase 1: matrix 571 rows 588 cols
[2025-06-01 02:34:18] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:34:18] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 571 rows 588 cols
[2025-06-01 02:34:18] [INFO ] Invariants computation overflowed in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:34:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:34:42] [INFO ] Implicit Places using invariants and state equation in 24012 ms returned [123, 128, 150, 157, 182, 187, 511]
[2025-06-01 02:34:42] [INFO ] Actually due to overlaps returned [128, 123, 511]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 24293 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 585/609 places, 571/574 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 585 transition count 571
Applied a total of 1 rules in 25 ms. Remains 585 /585 variables (removed 0) and now considering 571/571 (removed 0) transitions.
// Phase 1: matrix 571 rows 585 cols
[2025-06-01 02:34:42] [INFO ] Computed 79 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:34:43] [INFO ] Implicit Places using invariants in 1401 ms returned [148, 155, 180, 185]
[2025-06-01 02:34:43] [INFO ] Actually due to overlaps returned [155, 148]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1407 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 583/609 places, 571/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 583 /583 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 47287 ms. Remains : 583/609 places, 571/574 transitions.
RANDOM walk for 40000 steps (2089 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1650 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1643 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1631 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1611 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1645 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1649 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1638 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1637 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1629 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1661 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1659 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1632 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 188885 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 12
Probabilistic random walk after 188885 steps, saw 94487 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 571 rows 583 cols
[2025-06-01 02:34:47] [INFO ] Invariants computation overflowed in 22 ms
[2025-06-01 02:34:47] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 348/463 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 571/1034 variables, 365/485 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 33/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 120/1154 variables, 103/621 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 11/632 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1154 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1154 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1154/1154 variables, and 632 constraints, problems are : Problem set: 0 solved, 12 unsolved in 12777 ms.
Refiners :[State Equation: 583/583 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 348/463 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 571/1034 variables, 365/485 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 33/518 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 10/528 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:01] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:02] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:02] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:02] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:02] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:02] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 3 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-01 02:35:03] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 11 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:03] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 7/541 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:04] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1034 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1034 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 120/1154 variables, 103/645 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1154 variables, 11/656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:15] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:15] [INFO ] Deduced a trap composed of 17 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-01 02:35:15] [INFO ] Deduced a trap composed of 18 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-01 02:35:16] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:16] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:16] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:16] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:17] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:17] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:17] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:17] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:18] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:18] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:18] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:18] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:19] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:19] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:19] [INFO ] Deduced a trap composed of 152 places in 269 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:20] [INFO ] Deduced a trap composed of 153 places in 271 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:20] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 29 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:34] [INFO ] Deduced a trap composed of 22 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-01 02:35:35] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:35] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:36] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:37] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:37] [INFO ] Deduced a trap composed of 75 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-01 02:35:37] [INFO ] Deduced a trap composed of 62 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-01 02:35:37] [INFO ] Deduced a trap composed of 64 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-01 02:35:38] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:39] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:41] [INFO ] Deduced a trap composed of 116 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-01 02:35:43] [INFO ] Deduced a trap composed of 73 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-01 02:35:45] [INFO ] Deduced a trap composed of 87 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-01 02:35:45] [INFO ] Deduced a trap composed of 82 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-01 02:35:46] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:50] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:51] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:35:54] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 33 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 18/694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:13] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:16] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:17] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:18] [INFO ] Deduced a trap composed of 144 places in 261 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:19] [INFO ] Deduced a trap composed of 144 places in 249 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:21] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:22] [INFO ] Deduced a trap composed of 145 places in 261 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:24] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:26] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:26] [INFO ] Deduced a trap composed of 144 places in 252 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:36:30] [INFO ] Deduced a trap composed of 144 places in 263 ms of which 101 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1154/1154 variables, and 705 constraints, problems are : Problem set: 0 solved, 12 unsolved in 90012 ms.
Refiners :[State Equation: 583/583 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 102833ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 571/571 transitions.
Applied a total of 0 rules in 26 ms. Remains 583 /583 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 583/583 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 571/571 transitions.
Applied a total of 0 rules in 15 ms. Remains 583 /583 variables (removed 0) and now considering 571/571 (removed 0) transitions.
// Phase 1: matrix 571 rows 583 cols
[2025-06-01 02:36:30] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:36:30] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 571 rows 583 cols
[2025-06-01 02:36:30] [INFO ] Invariants computation overflowed in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:36:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:36:44] [INFO ] Implicit Places using invariants and state equation in 13699 ms returned [178, 183]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 581/583 places, 571/571 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 581 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 580 transition count 570
Applied a total of 2 rules in 25 ms. Remains 580 /581 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:36:44] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:36:44] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:36:44] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:36:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:36:56] [INFO ] Implicit Places using invariants and state equation in 11201 ms returned []
Implicit Place search using SMT with State Equation took 11430 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 580/583 places, 570/571 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25395 ms. Remains : 580/583 places, 570/571 transitions.
RANDOM walk for 40000 steps (2073 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1653 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1658 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1633 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1628 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1666 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1638 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1648 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1644 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1636 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1624 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1635 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1666 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 164629 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 12
Probabilistic random walk after 164629 steps, saw 82347 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:37:00] [INFO ] Invariants computation overflowed in 22 ms
[2025-06-01 02:37:00] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 348/463 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 568/1031 variables, 363/483 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 33/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1031 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 119/1150 variables, 102/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1150 variables, 11/629 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1150 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1150 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1150/1150 variables, and 629 constraints, problems are : Problem set: 0 solved, 12 unsolved in 15115 ms.
Refiners :[State Equation: 580/580 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 348/463 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 568/1031 variables, 363/483 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 33/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1031 variables, 10/526 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:16] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:37:17] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1031 variables, 7/533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1031 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 119/1150 variables, 102/635 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1150 variables, 11/646 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:07] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:07] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:07] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:07] [INFO ] Deduced a trap composed of 23 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-01 02:38:08] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:08] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:08] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:09] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:10] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:10] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:10] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:10] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:11] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:11] [INFO ] Deduced a trap composed of 76 places in 216 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:11] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:12] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:12] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 54 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1150 variables, 20/666 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:24] [INFO ] Deduced a trap composed of 36 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-01 02:38:24] [INFO ] Deduced a trap composed of 38 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-01 02:38:24] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:25] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:25] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:26] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:26] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:27] [INFO ] Deduced a trap composed of 153 places in 274 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:27] [INFO ] Deduced a trap composed of 153 places in 283 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:28] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:28] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:28] [INFO ] Deduced a trap composed of 154 places in 276 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:29] [INFO ] Deduced a trap composed of 155 places in 267 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:29] [INFO ] Deduced a trap composed of 159 places in 242 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:29] [INFO ] Deduced a trap composed of 156 places in 263 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:30] [INFO ] Deduced a trap composed of 155 places in 276 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:30] [INFO ] Deduced a trap composed of 159 places in 245 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:30] [INFO ] Deduced a trap composed of 154 places in 358 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:31] [INFO ] Deduced a trap composed of 155 places in 338 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:31] [INFO ] Deduced a trap composed of 157 places in 240 ms of which 98 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1150 variables, 20/686 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:36] [INFO ] Deduced a trap composed of 151 places in 279 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:37] [INFO ] Deduced a trap composed of 151 places in 274 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:37] [INFO ] Deduced a trap composed of 154 places in 304 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:37] [INFO ] Deduced a trap composed of 154 places in 327 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:38] [INFO ] Deduced a trap composed of 149 places in 293 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:38] [INFO ] Deduced a trap composed of 155 places in 335 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:39] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:39] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:40] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:40] [INFO ] Deduced a trap composed of 155 places in 241 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:40] [INFO ] Deduced a trap composed of 156 places in 308 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:41] [INFO ] Deduced a trap composed of 159 places in 220 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:41] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:41] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:42] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:42] [INFO ] Deduced a trap composed of 156 places in 301 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:42] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:43] [INFO ] Deduced a trap composed of 157 places in 239 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:43] [INFO ] Deduced a trap composed of 157 places in 321 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:43] [INFO ] Deduced a trap composed of 160 places in 311 ms of which 160 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1150 variables, 20/706 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:47] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:47] [INFO ] Deduced a trap composed of 154 places in 245 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:48] [INFO ] Deduced a trap composed of 157 places in 247 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:48] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:48] [INFO ] Deduced a trap composed of 159 places in 253 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:49] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:49] [INFO ] Deduced a trap composed of 158 places in 234 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:49] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:50] [INFO ] Deduced a trap composed of 159 places in 250 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:50] [INFO ] Deduced a trap composed of 159 places in 249 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:50] [INFO ] Deduced a trap composed of 161 places in 248 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:51] [INFO ] Deduced a trap composed of 157 places in 320 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:51] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:52] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:52] [INFO ] Deduced a trap composed of 159 places in 214 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:52] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:53] [INFO ] Deduced a trap composed of 155 places in 293 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:53] [INFO ] Deduced a trap composed of 157 places in 244 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:53] [INFO ] Deduced a trap composed of 158 places in 317 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:54] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 89 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1150 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:58] [INFO ] Deduced a trap composed of 155 places in 436 ms of which 283 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:58] [INFO ] Deduced a trap composed of 156 places in 353 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:58] [INFO ] Deduced a trap composed of 156 places in 308 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:59] [INFO ] Deduced a trap composed of 155 places in 319 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:59] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:38:59] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:00] [INFO ] Deduced a trap composed of 157 places in 259 ms of which 109 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1150/1150 variables, and 733 constraints, problems are : Problem set: 0 solved, 12 unsolved in 105007 ms.
Refiners :[State Equation: 580/580 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 120161ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 570/570 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 580/580 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 570/570 transitions.
Applied a total of 0 rules in 11 ms. Remains 580 /580 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:39:00] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:39:00] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:39:00] [INFO ] Invariants computation overflowed in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:39:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 02:39:11] [INFO ] Implicit Places using invariants and state equation in 10975 ms returned []
Implicit Place search using SMT with State Equation took 11184 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:39:11] [INFO ] Redundant transitions in 32 ms returned []
Running 569 sub problems to find dead transitions.
// Phase 1: matrix 570 rows 580 cols
[2025-06-01 02:39:11] [INFO ] Invariants computation overflowed in 21 ms
[2025-06-01 02:39:11] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 570/1149 variables, 579/579 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1149 variables, 49/628 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1149 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41415 ms. Remains : 580/580 places, 570/570 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 575 transition count 565
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 10 place count 575 transition count 549
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 42 place count 559 transition count 549
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 556 transition count 546
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 556 transition count 546
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 556 transition count 541
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 58 place count 551 transition count 541
Applied a total of 58 rules in 54 ms. Remains 551 /580 variables (removed 29) and now considering 541/570 (removed 29) transitions.
Running SMT prover for 12 properties.
Excessive predecessor constraint size, skipping predecessor.
// Phase 1: matrix 541 rows 551 cols
[2025-06-01 02:39:41] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:39:42] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:39:43] [INFO ] After 1651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2025-06-01 02:39:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 02:39:45] [INFO ] After 1583ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:45] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:46] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:46] [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-01 02:39:46] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:46] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:46] [INFO ] Deduced a trap composed of 31 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-01 02:39:47] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:47] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:47] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:47] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:48] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:48] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:48] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:48] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:48] [INFO ] Deduced a trap composed of 153 places in 230 ms of which 77 ms to minimize.
[2025-06-01 02:39:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3292 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:49] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:49] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:49] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:50] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 20 ms to minimize.
[2025-06-01 02:39:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 757 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:50] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 8 ms to minimize.
[2025-06-01 02:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:50] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:50] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:51] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:51] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 19 ms to minimize.
[2025-06-01 02:39:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 744 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:51] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:52] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 13 ms to minimize.
[2025-06-01 02:39:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:52] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 21 ms to minimize.
[2025-06-01 02:39:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:52] [INFO ] Deduced a trap composed of 73 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-01 02:39:52] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:52] [INFO ] Deduced a trap composed of 87 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-01 02:39:52] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 15 ms to minimize.
[2025-06-01 02:39:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 574 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:53] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 16 ms to minimize.
[2025-06-01 02:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:54] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:54] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:54] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:54] [INFO ] Deduced a trap composed of 112 places in 92 ms of which 10 ms to minimize.
[2025-06-01 02:39:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 899 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 151 places in 147 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 163 places in 135 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:55] [INFO ] Deduced a trap composed of 163 places in 139 ms of which 40 ms to minimize.
[2025-06-01 02:39:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1001 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:56] [INFO ] Deduced a trap composed of 148 places in 246 ms of which 84 ms to minimize.
[2025-06-01 02:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:57] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 15 ms to minimize.
[2025-06-01 02:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:59] [INFO ] Deduced a trap composed of 157 places in 220 ms of which 72 ms to minimize.
[2025-06-01 02:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:39:59] [INFO ] Deduced a trap composed of 107 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-01 02:40:00] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 10 ms to minimize.
[2025-06-01 02:40:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:01] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 10 ms to minimize.
[2025-06-01 02:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:04] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:04] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:04] [INFO ] Deduced a trap composed of 116 places in 215 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:04] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:05] [INFO ] Deduced a trap composed of 160 places in 243 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:05] [INFO ] Deduced a trap composed of 158 places in 260 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:05] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:06] [INFO ] Deduced a trap composed of 161 places in 246 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:06] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:06] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:06] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:07] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:07] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:07] [INFO ] Deduced a trap composed of 161 places in 242 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:07] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:08] [INFO ] Deduced a trap composed of 161 places in 242 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:08] [INFO ] Deduced a trap composed of 161 places in 247 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:08] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:09] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:09] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:09] [INFO ] Deduced a trap composed of 165 places in 251 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:09] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:10] [INFO ] Deduced a trap composed of 167 places in 263 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:10] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:10] [INFO ] Deduced a trap composed of 169 places in 263 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:10] [INFO ] Deduced a trap composed of 163 places in 243 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:11] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:11] [INFO ] Deduced a trap composed of 167 places in 279 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:11] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:12] [INFO ] Deduced a trap composed of 169 places in 258 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:12] [INFO ] Deduced a trap composed of 172 places in 245 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:12] [INFO ] Deduced a trap composed of 169 places in 258 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:12] [INFO ] Deduced a trap composed of 172 places in 241 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:13] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 92 ms to minimize.
[2025-06-01 02:40:13] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9283 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:15] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:15] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:15] [INFO ] Deduced a trap composed of 143 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:15] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:15] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:16] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:17] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:18] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:18] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:18] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:18] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:18] [INFO ] Deduced a trap composed of 144 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:19] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:20] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:20] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:20] [INFO ] Deduced a trap composed of 146 places in 498 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:21] [INFO ] Deduced a trap composed of 148 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-01 02:40:21] [INFO ] Deduced a trap composed of 144 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-01 02:40:21] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:21] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:21] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:21] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:22] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:23] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:23] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:23] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:23] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:23] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:24] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:24] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:24] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:24] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:24] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:25] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:25] [INFO ] Deduced a trap composed of 146 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-01 02:40:25] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:25] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:25] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:25] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:26] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:26] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:26] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:26] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:26] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 148 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:27] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:28] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 26 ms to minimize.
[2025-06-01 02:40:28] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 13292 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:30] [INFO ] Deduced a trap composed of 155 places in 136 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:30] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:31] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:31] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:31] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:31] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:31] [INFO ] Deduced a trap composed of 156 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:32] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:40:32] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 25 ms to minimize.
[2025-06-01 02:40:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1559 ms
TRAPS : Iteration 4
[2025-06-01 02:40:40] [INFO ] After 56546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
[2025-06-01 02:40:43] [INFO ] After 61604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2025-06-01 02:40:43] [INFO ] Flatten gal took : 94 ms
[2025-06-01 02:40:43] [INFO ] Flatten gal took : 46 ms
[2025-06-01 02:40:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9291485656356081443.gal : 5 ms
[2025-06-01 02:40:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5471596310518025529.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9291485656356081443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5471596310518025529.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5471596310518025529.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :9 after 21
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :21 after 49
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :49 after 93
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :93 after 528
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :528 after 2076
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :2076 after 46984
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :46984 after 87820
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :87820 after 417088
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :417088 after 1.00923e+06
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.00923e+06 after 5.45171e+06
Detected timeout of ITS tools.
[2025-06-01 02:40:58] [INFO ] Flatten gal took : 27 ms
[2025-06-01 02:40:58] [INFO ] Applying decomposition
[2025-06-01 02:40:58] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4848407771654286448.txt' '-o' '/tmp/graph4848407771654286448.bin' '-w' '/tmp/graph4848407771654286448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4848407771654286448.bin' '-l' '-1' '-v' '-w' '/tmp/graph4848407771654286448.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:40:59] [INFO ] Decomposing Gal with order
[2025-06-01 02:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:40:59] [INFO ] Removed a total of 304 redundant transitions.
[2025-06-01 02:40:59] [INFO ] Flatten gal took : 92 ms
[2025-06-01 02:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 20 ms.
[2025-06-01 02:40:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15529957947657780371.gal : 13 ms
[2025-06-01 02:40:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6026250593176743025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15529957947657780371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6026250593176743025.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6026250593176743025.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :21 after 135
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :135 after 1054
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :1054 after 53825
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 92912 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 02:41:14] [INFO ] Flatten gal took : 31 ms
[2025-06-01 02:41:14] [INFO ] Applying decomposition
[2025-06-01 02:41: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/graph3890785113907998117.txt' '-o' '/tmp/graph3890785113907998117.bin' '-w' '/tmp/graph3890785113907998117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3890785113907998117.bin' '-l' '-1' '-v' '-w' '/tmp/graph3890785113907998117.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:41:14] [INFO ] Decomposing Gal with order
[2025-06-01 02:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:41:14] [INFO ] Removed a total of 280 redundant transitions.
[2025-06-01 02:41:14] [INFO ] Flatten gal took : 57 ms
[2025-06-01 02:41:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 20 ms.
[2025-06-01 02:41:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5294833303653868851.gal : 14 ms
[2025-06-01 02:41:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6462027956411870047.prop : 11 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5294833303653868851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6462027956411870047.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6462027956411870047.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :1 after 18
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :18 after 165
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :165 after 928
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :928 after 7154
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :7154 after 565106
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :565106 after 1.5809e+06
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.5809e+06 after 1.58194e+06
Detected timeout of ITS tools.
[2025-06-01 03:11:15] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11051100316501301362
[2025-06-01 03:11:15] [INFO ] Applying decomposition
[2025-06-01 03:11:15] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2025-06-01 03:11:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 03:11:15] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2025-06-01 03:11:15] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 03:11:15] [INFO ] Flatten gal took : 18 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/graph5020774363164887477.txt' '-o' '/tmp/graph5020774363164887477.bin' '-w' '/tmp/graph5020774363164887477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5020774363164887477.bin' '-l' '-1' '-v' '-w' '/tmp/graph5020774363164887477.weights' '-q' '0' '-e' '0.001'
[2025-06-01 03:11:15] [INFO ] Decomposing Gal with order
[2025-06-01 03:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 03:11:15] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-01 03:11:15] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2025-06-01 03:11:15] [INFO ] Flatten gal took : 35 ms
[2025-06-01 03:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 14 ms.
[2025-06-01 03:11:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14546426282293559303.gal : 7 ms
[2025-06-01 03:11:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8569124707976170051.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14546426282293559303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8569124707976170051.prop' '--nowitness'
[2025-06-01 03:11:15] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-06-01 03:11:15] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11051100316501301362
Running compilation step : cd /tmp/ltsmin11051100316501301362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '60' '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'
Loading property file /tmp/ReachabilityFireability8569124707976170051.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :10 after 23
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :23 after 50
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :50 after 154
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :154 after 589
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :589 after 2240
Compilation finished in 1578 ms.
Running link step : cd /tmp/ltsmin11051100316501301362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202500==true'
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :2240 after 11655
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202501==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202501==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202503==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202503==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202504==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202507==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202507==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202508==true'
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :11655 after 339059
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202508==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202509==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202509==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202411==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202512==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202512==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202313==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202313==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202314==true'
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :339059 after 509785
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202314==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202415==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202500==true'
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :509785 after 509857
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202501==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202501==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202503==true'
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :509857 after 949040
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202503==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202504==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin11051100316501301362;'/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' '-i' 'DoubleExponentPT020ReachabilityFireability202507==true'
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="DoubleExponent-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
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 DoubleExponent-PT-020, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067600503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;