About the Execution of 2024-gold for BugTracking-PT-q8m128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 875113.00 | 0.00 | 0.00 | 0 0 ? 0 0 0 0 0 0 0 0 0 0 0 0 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300075.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 gold2024
Input is BugTracking-PT-q8m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748553196530
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 21:13:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 21:13:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:13:20] [INFO ] Load time of PNML (sax parser for PT used): 1478 ms
[2025-05-29 21:13:20] [INFO ] Transformed 754 places.
[2025-05-29 21:13:20] [INFO ] Transformed 27370 transitions.
[2025-05-29 21:13:20] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1821 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 474 places in 162 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 21:13:20] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-05-29 21:13:20] [INFO ] Computed 10 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1, 1]
RANDOM walk for 10000 steps (5 resets) in 107 ms. (92 steps per ms)
FORMULA BugTracking-PT-q8m128-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110008 steps (22 resets) in 362 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-05-29 21:13:21] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-05-29 21:13:21] [INFO ] Invariant cache hit.
[2025-05-29 21:13:21] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-05-29 21:13:23] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2025-05-29 21:13:23] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-05-29 21:13:23] [INFO ] [Real]Added 303 Read/Feed constraints in 196 ms returned sat
[2025-05-29 21:13:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 21:13:25] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2025-05-29 21:13:25] [INFO ] [Nat]Added 303 Read/Feed constraints in 362 ms returned sat
[2025-05-29 21:13:26] [INFO ] Deduced a trap composed of 62 places in 1059 ms of which 47 ms to minimize.
[2025-05-29 21:13:28] [INFO ] Deduced a trap composed of 89 places in 992 ms of which 4 ms to minimize.
[2025-05-29 21:13:29] [INFO ] Deduced a trap composed of 72 places in 1251 ms of which 3 ms to minimize.
[2025-05-29 21:13:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:13:29] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:13:30] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2025-05-29 21:13:30] [INFO ] [Real]Added 303 Read/Feed constraints in 121 ms returned sat
[2025-05-29 21:13:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:13:31] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2025-05-29 21:13:32] [INFO ] [Nat]Added 303 Read/Feed constraints in 194 ms returned sat
[2025-05-29 21:13:33] [INFO ] Deduced a trap composed of 117 places in 1025 ms of which 4 ms to minimize.
[2025-05-29 21:13:34] [INFO ] Deduced a trap composed of 144 places in 1040 ms of which 5 ms to minimize.
[2025-05-29 21:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2471 ms
[2025-05-29 21:13:35] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 613 ms.
Maximisation of solution failed !
Minimization took 9 ms.
[2025-05-29 21:13:35] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 21:13:37] [INFO ] [Real]Absence check using state equation in 1207 ms returned sat
[2025-05-29 21:13:37] [INFO ] [Real]Added 303 Read/Feed constraints in 108 ms returned sat
[2025-05-29 21:13:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:13:38] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2025-05-29 21:13:38] [INFO ] [Nat]Added 303 Read/Feed constraints in 340 ms returned sat
[2025-05-29 21:13:39] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 969 ms.
[2025-05-29 21:13:42] [INFO ] Deduced a trap composed of 12 places in 987 ms of which 4 ms to minimize.
[2025-05-29 21:13:43] [INFO ] Deduced a trap composed of 64 places in 895 ms of which 4 ms to minimize.
[2025-05-29 21:13:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:13:43] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-29 21:13:44] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2025-05-29 21:13:44] [INFO ] [Real]Added 303 Read/Feed constraints in 145 ms returned sat
[2025-05-29 21:13:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:13:45] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2025-05-29 21:13:46] [INFO ] [Nat]Added 303 Read/Feed constraints in 393 ms returned sat
[2025-05-29 21:13:46] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 318 ms.
[2025-05-29 21:13:47] [INFO ] Added : 11 causal constraints over 3 iterations in 1217 ms. Result :sat
Minimization took 1507 ms.
[2025-05-29 21:13:49] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 21:13:50] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2025-05-29 21:13:50] [INFO ] [Real]Added 303 Read/Feed constraints in 95 ms returned sat
[2025-05-29 21:13:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:13:51] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2025-05-29 21:13:51] [INFO ] [Nat]Added 303 Read/Feed constraints in 242 ms returned sat
[2025-05-29 21:13:53] [INFO ] Deduced a trap composed of 129 places in 1352 ms of which 7 ms to minimize.
[2025-05-29 21:13:54] [INFO ] Deduced a trap composed of 56 places in 1162 ms of which 4 ms to minimize.
[2025-05-29 21:13:56] [INFO ] Deduced a trap composed of 120 places in 1396 ms of which 5 ms to minimize.
[2025-05-29 21:13:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:13:56] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:13:57] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2025-05-29 21:13:57] [INFO ] [Real]Added 303 Read/Feed constraints in 170 ms returned sat
[2025-05-29 21:13:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:13:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:13:59] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2025-05-29 21:13:59] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 21:13:59] [INFO ] [Nat]Added 303 Read/Feed constraints in 816 ms returned sat
[2025-05-29 21:14:00] [INFO ] Deduced a trap composed of 12 places in 924 ms of which 2 ms to minimize.
[2025-05-29 21:14:01] [INFO ] Deduced a trap composed of 21 places in 731 ms of which 3 ms to minimize.
[2025-05-29 21:14:02] [INFO ] Deduced a trap composed of 49 places in 703 ms of which 2 ms to minimize.
[2025-05-29 21:14:03] [INFO ] Deduced a trap composed of 57 places in 643 ms of which 3 ms to minimize.
[2025-05-29 21:14:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:14:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:14:04] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2025-05-29 21:14:04] [INFO ] [Real]Added 303 Read/Feed constraints in 103 ms returned sat
[2025-05-29 21:14:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:14:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:14:05] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2025-05-29 21:14:06] [INFO ] [Nat]Added 303 Read/Feed constraints in 182 ms returned sat
[2025-05-29 21:14:06] [INFO ] Deduced a trap composed of 35 places in 826 ms of which 3 ms to minimize.
[2025-05-29 21:14:07] [INFO ] Deduced a trap composed of 48 places in 882 ms of which 3 ms to minimize.
[2025-05-29 21:14:08] [INFO ] Deduced a trap composed of 26 places in 849 ms of which 2 ms to minimize.
[2025-05-29 21:14:10] [INFO ] Deduced a trap composed of 14 places in 967 ms of which 4 ms to minimize.
[2025-05-29 21:14:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:14:10] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:14:11] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2025-05-29 21:14:11] [INFO ] [Real]Added 303 Read/Feed constraints in 115 ms returned sat
[2025-05-29 21:14:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:14:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 21:14:12] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2025-05-29 21:14:13] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-29 21:14:13] [INFO ] [Nat]Added 303 Read/Feed constraints in 628 ms returned sat
[2025-05-29 21:14:13] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 2 ms to minimize.
[2025-05-29 21:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2025-05-29 21:14:14] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 660 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 21:14:16] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 21:14:17] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2025-05-29 21:14:17] [INFO ] [Real]Added 303 Read/Feed constraints in 113 ms returned sat
[2025-05-29 21:14:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:14:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 21:14:19] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2025-05-29 21:14:19] [INFO ] [Nat]Added 303 Read/Feed constraints in 237 ms returned sat
[2025-05-29 21:14:20] [INFO ] Deduced a trap composed of 64 places in 1016 ms of which 4 ms to minimize.
[2025-05-29 21:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1286 ms
[2025-05-29 21:14:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 521 ms.
[2025-05-29 21:14:22] [INFO ] Added : 8 causal constraints over 2 iterations in 1605 ms. Result :sat
Minimization took 661 ms.
[2025-05-29 21:14:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 21:14:24] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2025-05-29 21:14:24] [INFO ] [Real]Added 303 Read/Feed constraints in 129 ms returned sat
[2025-05-29 21:14:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:14:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 21:14:25] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2025-05-29 21:14:25] [INFO ] [Nat]Added 303 Read/Feed constraints in 114 ms returned sat
[2025-05-29 21:14:26] [INFO ] Deduced a trap composed of 11 places in 1012 ms of which 4 ms to minimize.
[2025-05-29 21:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1285 ms
[2025-05-29 21:14:27] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 522 ms.
[2025-05-29 21:14:29] [INFO ] Deduced a trap composed of 37 places in 1293 ms of which 3 ms to minimize.
[2025-05-29 21:14:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 21:14:29] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 21:14:30] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2025-05-29 21:14:30] [INFO ] [Real]Added 303 Read/Feed constraints in 142 ms returned sat
[2025-05-29 21:14:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:14:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 21:14:31] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2025-05-29 21:14:31] [INFO ] [Nat]Added 303 Read/Feed constraints in 123 ms returned sat
[2025-05-29 21:14:33] [INFO ] Deduced a trap composed of 89 places in 1288 ms of which 5 ms to minimize.
[2025-05-29 21:14:34] [INFO ] Deduced a trap composed of 51 places in 1035 ms of which 4 ms to minimize.
[2025-05-29 21:14:35] [INFO ] Deduced a trap composed of 60 places in 1010 ms of which 2 ms to minimize.
[2025-05-29 21:14:35] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 3985 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 601 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-05-29 21:14:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 11) seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-05-29 21:14:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-05-29 21:14:38] [INFO ] Computed 8 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
RANDOM walk for 1000050 steps (2 resets) in 922 ms. (1083 steps per ms)
BEST_FIRST walk for 11000008 steps (22 resets) in 28681 ms. (383 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-05-29 21:15:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:15:08] [INFO ] Invariant cache hit.
[2025-05-29 21:15:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:15:09] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2025-05-29 21:15:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:15:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:15:10] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2025-05-29 21:15:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 21:15:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 322 ms returned sat
[2025-05-29 21:15:12] [INFO ] Deduced a trap composed of 17 places in 1054 ms of which 4 ms to minimize.
[2025-05-29 21:15:13] [INFO ] Deduced a trap composed of 63 places in 704 ms of which 3 ms to minimize.
[2025-05-29 21:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2123 ms
[2025-05-29 21:15:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 473 ms.
[2025-05-29 21:15:14] [INFO ] Added : 2 causal constraints over 1 iterations in 832 ms. Result :sat
Minimization took 4211 ms.
[2025-05-29 21:15:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:15:19] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2025-05-29 21:15:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:15:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:15:20] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2025-05-29 21:15:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 142 ms returned sat
[2025-05-29 21:15:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 463 ms.
[2025-05-29 21:15:22] [INFO ] Added : 4 causal constraints over 2 iterations in 1323 ms. Result :sat
Minimization took 4309 ms.
[2025-05-29 21:15:26] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:15:27] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2025-05-29 21:15:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:15:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:15:29] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2025-05-29 21:15:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 351 ms returned sat
[2025-05-29 21:15:31] [INFO ] Deduced a trap composed of 21 places in 1451 ms of which 5 ms to minimize.
[2025-05-29 21:15:32] [INFO ] Deduced a trap composed of 54 places in 1342 ms of which 5 ms to minimize.
[2025-05-29 21:15:34] [INFO ] Deduced a trap composed of 23 places in 1424 ms of which 5 ms to minimize.
[2025-05-29 21:15:35] [INFO ] Deduced a trap composed of 31 places in 1231 ms of which 4 ms to minimize.
[2025-05-29 21:15:36] [INFO ] Deduced a trap composed of 44 places in 827 ms of which 3 ms to minimize.
[2025-05-29 21:15:37] [INFO ] Deduced a trap composed of 17 places in 783 ms of which 3 ms to minimize.
[2025-05-29 21:15:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8324 ms
[2025-05-29 21:15:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 274 ms.
[2025-05-29 21:15:38] [INFO ] Added : 6 causal constraints over 2 iterations in 924 ms. Result :sat
Minimization took 4501 ms.
[2025-05-29 21:15:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:15:44] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2025-05-29 21:15:44] [INFO ] [Real]Added 283 Read/Feed constraints in 120 ms returned sat
[2025-05-29 21:15:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:15:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 21:15:45] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2025-05-29 21:15:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 537 ms returned sat
[2025-05-29 21:15:46] [INFO ] Deduced a trap composed of 16 places in 701 ms of which 10 ms to minimize.
[2025-05-29 21:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1015 ms
[2025-05-29 21:15:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 496 ms.
[2025-05-29 21:15:48] [INFO ] Added : 11 causal constraints over 4 iterations in 1728 ms. Result :sat
Minimization took 4507 ms.
[2025-05-29 21:15:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:15:54] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2025-05-29 21:15:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:15:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:15:55] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2025-05-29 21:15:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 348 ms returned sat
[2025-05-29 21:15:57] [INFO ] Deduced a trap composed of 26 places in 1095 ms of which 5 ms to minimize.
[2025-05-29 21:15:58] [INFO ] Deduced a trap composed of 52 places in 1079 ms of which 3 ms to minimize.
[2025-05-29 21:15:59] [INFO ] Deduced a trap composed of 14 places in 1154 ms of which 4 ms to minimize.
[2025-05-29 21:16:00] [INFO ] Deduced a trap composed of 64 places in 882 ms of which 3 ms to minimize.
[2025-05-29 21:16:01] [INFO ] Deduced a trap composed of 46 places in 753 ms of which 3 ms to minimize.
[2025-05-29 21:16:02] [INFO ] Deduced a trap composed of 62 places in 748 ms of which 2 ms to minimize.
[2025-05-29 21:16:03] [INFO ] Deduced a trap composed of 59 places in 633 ms of which 3 ms to minimize.
[2025-05-29 21:16:04] [INFO ] Deduced a trap composed of 23 places in 587 ms of which 5 ms to minimize.
[2025-05-29 21:16:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8257 ms
[2025-05-29 21:16:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 370 ms.
[2025-05-29 21:16:06] [INFO ] Deduced a trap composed of 91 places in 1138 ms of which 4 ms to minimize.
[2025-05-29 21:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1542 ms
[2025-05-29 21:16:07] [INFO ] Added : 5 causal constraints over 2 iterations in 2830 ms. Result :sat
Minimization took 4493 ms.
[2025-05-29 21:16:11] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 21:16:12] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2025-05-29 21:16:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:16:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:16:14] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2025-05-29 21:16:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 318 ms returned sat
[2025-05-29 21:16:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2025-05-29 21:16:15] [INFO ] Added : 3 causal constraints over 1 iterations in 719 ms. Result :sat
Minimization took 4317 ms.
[2025-05-29 21:16:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:16:20] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2025-05-29 21:16:20] [INFO ] [Real]Added 283 Read/Feed constraints in 61 ms returned sat
[2025-05-29 21:16:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:16:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:16:22] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2025-05-29 21:16:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 219 ms returned sat
[2025-05-29 21:16:23] [INFO ] Deduced a trap composed of 144 places in 1024 ms of which 4 ms to minimize.
[2025-05-29 21:16:24] [INFO ] Deduced a trap composed of 87 places in 997 ms of which 3 ms to minimize.
[2025-05-29 21:16:25] [INFO ] Deduced a trap composed of 102 places in 975 ms of which 3 ms to minimize.
[2025-05-29 21:16:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3483 ms
[2025-05-29 21:16:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2025-05-29 21:16:26] [INFO ] Added : 2 causal constraints over 1 iterations in 692 ms. Result :sat
Minimization took 4298 ms.
[2025-05-29 21:16:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:16:31] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2025-05-29 21:16:31] [INFO ] [Real]Added 283 Read/Feed constraints in 85 ms returned sat
[2025-05-29 21:16:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:16:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:16:32] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2025-05-29 21:16:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 282 ms returned sat
[2025-05-29 21:16:33] [INFO ] Deduced a trap composed of 54 places in 500 ms of which 2 ms to minimize.
[2025-05-29 21:16:34] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 2 ms to minimize.
[2025-05-29 21:16:34] [INFO ] Deduced a trap composed of 33 places in 473 ms of which 2 ms to minimize.
[2025-05-29 21:16:35] [INFO ] Deduced a trap composed of 54 places in 513 ms of which 2 ms to minimize.
[2025-05-29 21:16:36] [INFO ] Deduced a trap composed of 60 places in 483 ms of which 4 ms to minimize.
[2025-05-29 21:16:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2971 ms
[2025-05-29 21:16:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2025-05-29 21:16:37] [INFO ] Added : 8 causal constraints over 2 iterations in 905 ms. Result :sat
Minimization took 4508 ms.
[2025-05-29 21:16:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:16:42] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2025-05-29 21:16:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:16:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:16:43] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2025-05-29 21:16:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 422 ms returned sat
[2025-05-29 21:16:45] [INFO ] Deduced a trap composed of 35 places in 898 ms of which 5 ms to minimize.
[2025-05-29 21:16:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1113 ms
[2025-05-29 21:16:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 464 ms.
[2025-05-29 21:16:46] [INFO ] Added : 3 causal constraints over 1 iterations in 930 ms. Result :sat
Minimization took 4315 ms.
[2025-05-29 21:16:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:16:52] [INFO ] [Real]Absence check using state equation in 1113 ms returned sat
[2025-05-29 21:16:52] [INFO ] [Real]Added 283 Read/Feed constraints in 84 ms returned sat
[2025-05-29 21:16:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:16:53] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2025-05-29 21:16:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 119 ms returned sat
[2025-05-29 21:16:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 315 ms.
[2025-05-29 21:16:54] [INFO ] Deduced a trap composed of 35 places in 632 ms of which 3 ms to minimize.
[2025-05-29 21:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2025-05-29 21:16:55] [INFO ] Added : 3 causal constraints over 2 iterations in 1882 ms. Result :sat
Minimization took 4230 ms.
[2025-05-29 21:16:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:17:00] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2025-05-29 21:17:00] [INFO ] [Real]Added 283 Read/Feed constraints in 119 ms returned sat
[2025-05-29 21:17:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:17:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:17:02] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2025-05-29 21:17:02] [INFO ] [Nat]Added 283 Read/Feed constraints in 132 ms returned sat
[2025-05-29 21:17:03] [INFO ] Deduced a trap composed of 121 places in 1125 ms of which 3 ms to minimize.
[2025-05-29 21:17:04] [INFO ] Deduced a trap composed of 58 places in 887 ms of which 4 ms to minimize.
[2025-05-29 21:17:06] [INFO ] Deduced a trap composed of 15 places in 1017 ms of which 7 ms to minimize.
[2025-05-29 21:17:07] [INFO ] Deduced a trap composed of 60 places in 825 ms of which 5 ms to minimize.
[2025-05-29 21:17:08] [INFO ] Deduced a trap composed of 53 places in 658 ms of which 3 ms to minimize.
[2025-05-29 21:17:08] [INFO ] Deduced a trap composed of 10 places in 638 ms of which 2 ms to minimize.
[2025-05-29 21:17:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6687 ms
[2025-05-29 21:17:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 473 ms.
[2025-05-29 21:17:10] [INFO ] Deduced a trap composed of 102 places in 927 ms of which 3 ms to minimize.
[2025-05-29 21:17:11] [INFO ] Deduced a trap composed of 61 places in 754 ms of which 3 ms to minimize.
[2025-05-29 21:17:12] [INFO ] Deduced a trap composed of 61 places in 807 ms of which 3 ms to minimize.
[2025-05-29 21:17:14] [INFO ] Deduced a trap composed of 97 places in 1032 ms of which 4 ms to minimize.
[2025-05-29 21:17:14] [INFO ] Deduced a trap composed of 60 places in 718 ms of which 2 ms to minimize.
[2025-05-29 21:17:15] [INFO ] Deduced a trap composed of 56 places in 772 ms of which 2 ms to minimize.
[2025-05-29 21:17:16] [INFO ] Deduced a trap composed of 55 places in 706 ms of which 2 ms to minimize.
[2025-05-29 21:17:17] [INFO ] Deduced a trap composed of 97 places in 858 ms of which 4 ms to minimize.
[2025-05-29 21:17:18] [INFO ] Deduced a trap composed of 57 places in 746 ms of which 3 ms to minimize.
[2025-05-29 21:17:19] [INFO ] Deduced a trap composed of 64 places in 749 ms of which 3 ms to minimize.
[2025-05-29 21:17:20] [INFO ] Deduced a trap composed of 55 places in 742 ms of which 3 ms to minimize.
[2025-05-29 21:17:21] [INFO ] Deduced a trap composed of 61 places in 771 ms of which 3 ms to minimize.
[2025-05-29 21:17:22] [INFO ] Deduced a trap composed of 60 places in 745 ms of which 2 ms to minimize.
[2025-05-29 21:17:23] [INFO ] Deduced a trap composed of 60 places in 791 ms of which 3 ms to minimize.
[2025-05-29 21:17:24] [INFO ] Deduced a trap composed of 59 places in 800 ms of which 3 ms to minimize.
[2025-05-29 21:17:25] [INFO ] Deduced a trap composed of 60 places in 726 ms of which 2 ms to minimize.
[2025-05-29 21:17:26] [INFO ] Deduced a trap composed of 62 places in 737 ms of which 2 ms to minimize.
[2025-05-29 21:17:27] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 2 ms to minimize.
[2025-05-29 21:17:27] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 17631 ms
[2025-05-29 21:17:28] [INFO ] Added : 10 causal constraints over 4 iterations in 19393 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-05-29 21:17:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:17:33] [INFO ] Invariant cache hit.
[2025-05-29 21:17:34] [INFO ] Implicit Places using invariants in 896 ms returned []
[2025-05-29 21:17:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:17:34] [INFO ] Invariant cache hit.
[2025-05-29 21:17:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 21:17:38] [INFO ] Implicit Places using invariants and state equation in 3872 ms returned []
Implicit Place search using SMT with State Equation took 4774 ms to find 0 implicit places.
[2025-05-29 21:17:39] [INFO ] Redundant transitions in 740 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-05-29 21:17:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 21:17:39] [INFO ] Invariant cache hit.
[2025-05-29 21:17:39] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2025-05-29 21:19:25] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 2 ms to minimize.
[2025-05-29 21:19:26] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
[2025-05-29 21:19:29] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 2 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
[2025-05-29 21:19:29] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2025-05-29 21:19:29] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
[2025-05-29 21:19:30] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 2 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 14 constraints, problems are : Problem set: 468 solved, 3402 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 6/6 constraints]
After SMT, in 112736ms problems are : Problem set: 468 solved, 3402 unsolved
Search for dead transitions found 468 dead transitions in 112839ms
Found 468 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 468 transitions
Dead transitions reduction (with SMT) removed 468 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3403/3871 transitions.
Reduce places removed 12 places and 425 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 257 transition count 2978
Reduce places removed 8 places and 233 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 249 transition count 2745
Reduce places removed 10 places and 290 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 30 place count 239 transition count 2455
Reduce places removed 5 places and 167 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 234 transition count 2288
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 48 place count 221 transition count 2262
Deduced a syphon composed of 4 places in 2 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 61 place count 221 transition count 2262
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 72 place count 210 transition count 2163
Deduced a syphon composed of 4 places in 2 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 83 place count 210 transition count 2163
Deduced a syphon composed of 4 places in 2 ms
Applied a total of 83 rules in 150 ms. Remains 210 /269 variables (removed 59) and now considering 2163/3403 (removed 1240) transitions.
[2025-05-29 21:19:32] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
// Phase 1: matrix 2016 rows 210 cols
[2025-05-29 21:19:32] [INFO ] Computed 12 invariants in 11 ms
[2025-05-29 21:19:32] [INFO ] Implicit Places using invariants in 674 ms returned []
[2025-05-29 21:19:32] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
[2025-05-29 21:19:32] [INFO ] Invariant cache hit.
[2025-05-29 21:19:33] [INFO ] State equation strengthened by 185 read => feed constraints.
[2025-05-29 21:19:34] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/269 places, 2163/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 121444 ms. Remains : 210/269 places, 2163/3871 transitions.
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:19:34] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
Found an invariant !
This invariant on transitions {3=1, 1562=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 1562=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, 1, 1]
[2025-05-29 21:19:36] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
// Phase 1: matrix 2016 rows 206 cols
[2025-05-29 21:19:36] [INFO ] Computed 8 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000109 steps (2 resets) in 1013 ms. (986 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 14157 ms. (494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:19:51] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
[2025-05-29 21:19:51] [INFO ] Invariant cache hit.
[2025-05-29 21:19:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:19:52] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2025-05-29 21:19:52] [INFO ] State equation strengthened by 185 read => feed constraints.
[2025-05-29 21:19:52] [INFO ] [Real]Added 185 Read/Feed constraints in 52 ms returned sat
[2025-05-29 21:19:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:19:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:19:53] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2025-05-29 21:19:53] [INFO ] [Nat]Added 185 Read/Feed constraints in 152 ms returned sat
[2025-05-29 21:19:53] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 2 ms to minimize.
[2025-05-29 21:19:54] [INFO ] Deduced a trap composed of 39 places in 494 ms of which 2 ms to minimize.
[2025-05-29 21:19:54] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 3 ms to minimize.
[2025-05-29 21:19:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1710 ms
[2025-05-29 21:19:55] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 269 ms.
[2025-05-29 21:19:55] [INFO ] Added : 2 causal constraints over 1 iterations in 603 ms. Result :sat
Minimization took 1904 ms.
[2025-05-29 21:19:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:19:58] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2025-05-29 21:19:58] [INFO ] [Real]Added 185 Read/Feed constraints in 59 ms returned sat
[2025-05-29 21:19:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:19:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:19:59] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2025-05-29 21:19:59] [INFO ] [Nat]Added 185 Read/Feed constraints in 97 ms returned sat
[2025-05-29 21:20:00] [INFO ] Deduced a trap composed of 37 places in 564 ms of which 3 ms to minimize.
[2025-05-29 21:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2025-05-29 21:20:00] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 269 ms.
[2025-05-29 21:20:01] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 3 ms to minimize.
[2025-05-29 21:20:01] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 2 ms to minimize.
[2025-05-29 21:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1109 ms
[2025-05-29 21:20:02] [INFO ] Added : 5 causal constraints over 2 iterations in 1924 ms. Result :sat
Minimization took 1499 ms.
[2025-05-29 21:20:03] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 21:20:04] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-05-29 21:20:04] [INFO ] [Real]Added 185 Read/Feed constraints in 48 ms returned sat
[2025-05-29 21:20:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:20:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:20:05] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2025-05-29 21:20:05] [INFO ] [Nat]Added 185 Read/Feed constraints in 514 ms returned sat
[2025-05-29 21:20:06] [INFO ] Deduced a trap composed of 10 places in 400 ms of which 2 ms to minimize.
[2025-05-29 21:20:06] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 2 ms to minimize.
[2025-05-29 21:20:07] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 2 ms to minimize.
[2025-05-29 21:20:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1571 ms
[2025-05-29 21:20:07] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 262 ms.
[2025-05-29 21:20:08] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 2 ms to minimize.
[2025-05-29 21:20:09] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 3 ms to minimize.
[2025-05-29 21:20:09] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 2 ms to minimize.
[2025-05-29 21:20:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1557 ms
[2025-05-29 21:20:10] [INFO ] Added : 16 causal constraints over 4 iterations in 3011 ms. Result :sat
Minimization took 1708 ms.
[2025-05-29 21:20:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:20:12] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2025-05-29 21:20:12] [INFO ] [Real]Added 185 Read/Feed constraints in 47 ms returned sat
[2025-05-29 21:20:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:20:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:20:13] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2025-05-29 21:20:13] [INFO ] [Nat]Added 185 Read/Feed constraints in 127 ms returned sat
[2025-05-29 21:20:14] [INFO ] Deduced a trap composed of 100 places in 851 ms of which 4 ms to minimize.
[2025-05-29 21:20:15] [INFO ] Deduced a trap composed of 71 places in 829 ms of which 4 ms to minimize.
[2025-05-29 21:20:16] [INFO ] Deduced a trap composed of 69 places in 829 ms of which 4 ms to minimize.
[2025-05-29 21:20:17] [INFO ] Deduced a trap composed of 62 places in 827 ms of which 4 ms to minimize.
[2025-05-29 21:20:18] [INFO ] Deduced a trap composed of 71 places in 748 ms of which 3 ms to minimize.
[2025-05-29 21:20:19] [INFO ] Deduced a trap composed of 25 places in 812 ms of which 4 ms to minimize.
[2025-05-29 21:20:21] [INFO ] Deduced a trap composed of 33 places in 833 ms of which 4 ms to minimize.
[2025-05-29 21:20:21] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 3 ms to minimize.
[2025-05-29 21:20:23] [INFO ] Deduced a trap composed of 18 places in 602 ms of which 3 ms to minimize.
[2025-05-29 21:20:23] [INFO ] Deduced a trap composed of 56 places in 623 ms of which 3 ms to minimize.
[2025-05-29 21:20:24] [INFO ] Deduced a trap composed of 33 places in 717 ms of which 3 ms to minimize.
[2025-05-29 21:20:25] [INFO ] Deduced a trap composed of 45 places in 717 ms of which 3 ms to minimize.
[2025-05-29 21:20:26] [INFO ] Deduced a trap composed of 57 places in 731 ms of which 4 ms to minimize.
[2025-05-29 21:20:27] [INFO ] Deduced a trap composed of 41 places in 723 ms of which 8 ms to minimize.
[2025-05-29 21:20:28] [INFO ] Deduced a trap composed of 44 places in 720 ms of which 3 ms to minimize.
[2025-05-29 21:20:29] [INFO ] Deduced a trap composed of 32 places in 741 ms of which 4 ms to minimize.
[2025-05-29 21:20:30] [INFO ] Deduced a trap composed of 47 places in 700 ms of which 3 ms to minimize.
[2025-05-29 21:20:31] [INFO ] Deduced a trap composed of 103 places in 707 ms of which 4 ms to minimize.
[2025-05-29 21:20:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 17551 ms
[2025-05-29 21:20:31] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 274 ms.
[2025-05-29 21:20:31] [INFO ] Added : 7 causal constraints over 2 iterations in 784 ms. Result :sat
Minimization took 1621 ms.
[2025-05-29 21:20:33] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:20:34] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2025-05-29 21:20:34] [INFO ] [Real]Added 185 Read/Feed constraints in 41 ms returned sat
[2025-05-29 21:20:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:20:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:20:35] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2025-05-29 21:20:35] [INFO ] [Nat]Added 185 Read/Feed constraints in 153 ms returned sat
[2025-05-29 21:20:35] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2025-05-29 21:20:36] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 2 ms to minimize.
[2025-05-29 21:20:36] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 1 ms to minimize.
[2025-05-29 21:20:37] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 2 ms to minimize.
[2025-05-29 21:20:37] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 2 ms to minimize.
[2025-05-29 21:20:37] [INFO ] Deduced a trap composed of 36 places in 382 ms of which 2 ms to minimize.
[2025-05-29 21:20:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2559 ms
[2025-05-29 21:20:38] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 262 ms.
[2025-05-29 21:20:38] [INFO ] Added : 10 causal constraints over 2 iterations in 828 ms. Result :sat
Minimization took 1737 ms.
[2025-05-29 21:20:40] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:20:41] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2025-05-29 21:20:41] [INFO ] [Real]Added 185 Read/Feed constraints in 66 ms returned sat
[2025-05-29 21:20:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:20:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:20:42] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2025-05-29 21:20:42] [INFO ] [Nat]Added 185 Read/Feed constraints in 281 ms returned sat
[2025-05-29 21:20:43] [INFO ] Deduced a trap composed of 24 places in 373 ms of which 2 ms to minimize.
[2025-05-29 21:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2025-05-29 21:20:43] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 293 ms.
[2025-05-29 21:20:43] [INFO ] Added : 4 causal constraints over 1 iterations in 634 ms. Result :sat
Minimization took 1702 ms.
[2025-05-29 21:20:45] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:20:46] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2025-05-29 21:20:46] [INFO ] [Real]Added 185 Read/Feed constraints in 74 ms returned sat
[2025-05-29 21:20:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:20:47] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2025-05-29 21:20:47] [INFO ] [Nat]Added 185 Read/Feed constraints in 96 ms returned sat
[2025-05-29 21:20:48] [INFO ] Deduced a trap composed of 11 places in 624 ms of which 4 ms to minimize.
[2025-05-29 21:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 775 ms
[2025-05-29 21:20:48] [INFO ] Computed and/alt/rep : 459/1712/459 causal constraints (skipped 1556 transitions) in 298 ms.
[2025-05-29 21:20:48] [INFO ] Added : 1 causal constraints over 1 iterations in 639 ms. Result :sat
Minimization took 1764 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2163/2163 transitions.
Applied a total of 0 rules in 36 ms. Remains 206 /206 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 206/206 places, 2163/2163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2163/2163 transitions.
Applied a total of 0 rules in 50 ms. Remains 206 /206 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
[2025-05-29 21:20:51] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
[2025-05-29 21:20:51] [INFO ] Invariant cache hit.
[2025-05-29 21:20:52] [INFO ] Implicit Places using invariants in 640 ms returned []
[2025-05-29 21:20:52] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
[2025-05-29 21:20:52] [INFO ] Invariant cache hit.
[2025-05-29 21:20:53] [INFO ] State equation strengthened by 185 read => feed constraints.
[2025-05-29 21:20:54] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2025-05-29 21:20:55] [INFO ] Redundant transitions in 270 ms returned []
Running 2162 sub problems to find dead transitions.
[2025-05-29 21:20:55] [INFO ] Flow matrix only has 2016 transitions (discarded 147 similar events)
[2025-05-29 21:20:55] [INFO ] Invariant cache hit.
[2025-05-29 21:20:55] [INFO ] State equation strengthened by 185 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
[2025-05-29 21:21:41] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2025-05-29 21:21:41] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/2222 variables, and 10 constraints, problems are : Problem set: 0 solved, 2162 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/185 constraints, PredecessorRefiner: 2162/2162 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2162 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 2150 unsolved
[2025-05-29 21:21:59] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
[2025-05-29 21:22:01] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
[2025-05-29 21:22:02] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
Problem TDEAD1617 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
[2025-05-29 21:22:07] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
[2025-05-29 21:22:07] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 5/15 constraints. Problems are: Problem set: 316 solved, 1846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/2222 variables, and 15 constraints, problems are : Problem set: 316 solved, 1846 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/185 constraints, PredecessorRefiner: 0/2162 constraints, Known Traps: 7/7 constraints]
After SMT, in 79863ms problems are : Problem set: 316 solved, 1846 unsolved
Search for dead transitions found 316 dead transitions in 79913ms
Found 316 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 316 transitions
Dead transitions reduction (with SMT) removed 316 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 1847/2163 transitions.
Graph (complete) has 2326 edges and 206 vertex of which 195 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 431 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 180 transition count 1416
Reduce places removed 14 places and 223 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 166 transition count 1193
Reduce places removed 8 places and 109 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 158 transition count 1084
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 42 place count 154 transition count 1055
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 44 place count 152 transition count 1009
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 45 place count 151 transition count 993
Reduce places removed 0 places and 9 transitions.
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 56 place count 140 transition count 845
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 6 with 13 rules applied. Total rules applied 69 place count 138 transition count 813
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 69 rules in 70 ms. Remains 138 /206 variables (removed 68) and now considering 813/1847 (removed 1034) transitions.
[2025-05-29 21:22:15] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
// Phase 1: matrix 718 rows 138 cols
[2025-05-29 21:22:15] [INFO ] Computed 11 invariants in 4 ms
[2025-05-29 21:22:15] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-29 21:22:15] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
[2025-05-29 21:22:15] [INFO ] Invariant cache hit.
[2025-05-29 21:22:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 21:22:16] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/206 places, 813/2163 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84591 ms. Remains : 138/206 places, 813/2163 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:22:16] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {0=1, 560=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 560=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:22:16] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
// Phase 1: matrix 718 rows 134 cols
[2025-05-29 21:22:16] [INFO ] Computed 7 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000053 steps (2 resets) in 960 ms. (1040 steps per ms)
BEST_FIRST walk for 3000000 steps (6 resets) in 3542 ms. (846 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:22:21] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
[2025-05-29 21:22:21] [INFO ] Invariant cache hit.
[2025-05-29 21:22:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:22:21] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-05-29 21:22:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 21:22:21] [INFO ] [Real]Added 96 Read/Feed constraints in 26 ms returned sat
[2025-05-29 21:22:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:22:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:22:22] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-05-29 21:22:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 53 ms returned sat
[2025-05-29 21:22:22] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2025-05-29 21:22:22] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2025-05-29 21:22:22] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2025-05-29 21:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2025-05-29 21:22:22] [INFO ] Computed and/alt/rep : 290/1140/290 causal constraints (skipped 427 transitions) in 88 ms.
[2025-05-29 21:22:23] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2025-05-29 21:22:23] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 2 ms to minimize.
[2025-05-29 21:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2025-05-29 21:22:23] [INFO ] Added : 10 causal constraints over 3 iterations in 837 ms. Result :sat
Minimization took 332 ms.
[2025-05-29 21:22:24] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:22:24] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-05-29 21:22:24] [INFO ] [Real]Added 96 Read/Feed constraints in 27 ms returned sat
[2025-05-29 21:22:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:22:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:22:24] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-05-29 21:22:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 47 ms returned sat
[2025-05-29 21:22:25] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 2 ms to minimize.
[2025-05-29 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2025-05-29 21:22:25] [INFO ] Computed and/alt/rep : 290/1140/290 causal constraints (skipped 427 transitions) in 90 ms.
[2025-05-29 21:22:25] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 3 ms to minimize.
[2025-05-29 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2025-05-29 21:22:26] [INFO ] Added : 18 causal constraints over 5 iterations in 854 ms. Result :sat
Minimization took 328 ms.
[2025-05-29 21:22:26] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 21:22:26] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-05-29 21:22:26] [INFO ] [Real]Added 96 Read/Feed constraints in 25 ms returned sat
[2025-05-29 21:22:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:22:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:22:27] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-29 21:22:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 50 ms returned sat
[2025-05-29 21:22:27] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
[2025-05-29 21:22:27] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 2 ms to minimize.
[2025-05-29 21:22:27] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2025-05-29 21:22:28] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 2 ms to minimize.
[2025-05-29 21:22:28] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 2 ms to minimize.
[2025-05-29 21:22:28] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 2 ms to minimize.
[2025-05-29 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1418 ms
[2025-05-29 21:22:28] [INFO ] Computed and/alt/rep : 290/1140/290 causal constraints (skipped 427 transitions) in 92 ms.
[2025-05-29 21:22:28] [INFO ] Added : 10 causal constraints over 2 iterations in 287 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 813/813 transitions.
Applied a total of 0 rules in 28 ms. Remains 134 /134 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 134/134 places, 813/813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 813/813 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 813/813 (removed 0) transitions.
[2025-05-29 21:22:29] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
[2025-05-29 21:22:29] [INFO ] Invariant cache hit.
[2025-05-29 21:22:29] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-05-29 21:22:29] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
[2025-05-29 21:22:29] [INFO ] Invariant cache hit.
[2025-05-29 21:22:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 21:22:30] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2025-05-29 21:22:30] [INFO ] Redundant transitions in 12 ms returned []
Running 812 sub problems to find dead transitions.
[2025-05-29 21:22:30] [INFO ] Flow matrix only has 718 transitions (discarded 95 similar events)
[2025-05-29 21:22:30] [INFO ] Invariant cache hit.
[2025-05-29 21:22:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2025-05-29 21:22:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-29 21:22:37] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2025-05-29 21:22:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 718/852 variables, 134/144 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 96/240 constraints. Problems are: Problem set: 4 solved, 808 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/852 variables, and 240 constraints, problems are : Problem set: 4 solved, 808 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 4 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 3 (OVERLAPS) 718/852 variables, 134/144 constraints. Problems are: Problem set: 4 solved, 808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 96/240 constraints. Problems are: Problem set: 4 solved, 808 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 808/1048 constraints. Problems are: Problem set: 121 solved, 691 unsolved
[2025-05-29 21:23:25] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2025-05-29 21:23:28] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/852 variables, and 1050 constraints, problems are : Problem set: 176 solved, 636 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 808/812 constraints, Known Traps: 5/5 constraints]
After SMT, in 62143ms problems are : Problem set: 176 solved, 636 unsolved
Search for dead transitions found 176 dead transitions in 62159ms
Found 176 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 176 transitions
Dead transitions reduction (with SMT) removed 176 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 637/813 transitions.
Graph (complete) has 912 edges and 134 vertex of which 131 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 16 places and 181 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 115 transition count 456
Reduce places removed 4 places and 39 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 111 transition count 417
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 108 transition count 391
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 106 transition count 375
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 105 transition count 370
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 32 place count 100 transition count 324
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 37 place count 100 transition count 324
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 37 rules in 26 ms. Remains 100 /134 variables (removed 34) and now considering 324/637 (removed 313) transitions.
[2025-05-29 21:23:33] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
// Phase 1: matrix 303 rows 100 cols
[2025-05-29 21:23:33] [INFO ] Computed 9 invariants in 3 ms
[2025-05-29 21:23:33] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-29 21:23:33] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
[2025-05-29 21:23:33] [INFO ] Invariant cache hit.
[2025-05-29 21:23:33] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 21:23:33] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/134 places, 324/813 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64257 ms. Remains : 100/134 places, 324/813 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:23:33] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
Found an invariant !
This invariant on transitions {4=1, 230=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 230=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:23:34] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
// Phase 1: matrix 303 rows 98 cols
[2025-05-29 21:23:34] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000115 steps (2 resets) in 776 ms. (1287 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 718 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:23:35] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
[2025-05-29 21:23:35] [INFO ] Invariant cache hit.
[2025-05-29 21:23:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:23:35] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-05-29 21:23:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 21:23:35] [INFO ] [Real]Added 60 Read/Feed constraints in 15 ms returned sat
[2025-05-29 21:23:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:23:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:23:35] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-29 21:23:35] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2025-05-29 21:23:36] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2025-05-29 21:23:36] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2025-05-29 21:23:36] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2025-05-29 21:23:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2025-05-29 21:23:36] [INFO ] Computed and/alt/rep : 212/1009/212 causal constraints (skipped 90 transitions) in 35 ms.
[2025-05-29 21:23:36] [INFO ] Added : 29 causal constraints over 7 iterations in 248 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 324/324 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 324/324 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2025-05-29 21:23:36] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
[2025-05-29 21:23:36] [INFO ] Invariant cache hit.
[2025-05-29 21:23:37] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-29 21:23:37] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
[2025-05-29 21:23:37] [INFO ] Invariant cache hit.
[2025-05-29 21:23:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 21:23:37] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2025-05-29 21:23:37] [INFO ] Redundant transitions in 2 ms returned []
Running 323 sub problems to find dead transitions.
[2025-05-29 21:23:37] [INFO ] Flow matrix only has 303 transitions (discarded 21 similar events)
[2025-05-29 21:23:37] [INFO ] Invariant cache hit.
[2025-05-29 21:23:37] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 2 (OVERLAPS) 303/401 variables, 98/105 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 60/165 constraints. Problems are: Problem set: 4 solved, 319 unsolved
[2025-05-29 21:23:45] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 1/166 constraints. Problems are: Problem set: 4 solved, 319 unsolved
[2025-05-29 21:23:48] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 1/167 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 167 constraints, problems are : Problem set: 4 solved, 319 unsolved in 22362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 303/401 variables, 98/107 constraints. Problems are: Problem set: 4 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 60/167 constraints. Problems are: Problem set: 4 solved, 319 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 319/486 constraints. Problems are: Problem set: 6 solved, 317 unsolved
[2025-05-29 21:24:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2025-05-29 21:24:06] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2025-05-29 21:24:10] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 3/489 constraints. Problems are: Problem set: 6 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/489 constraints. Problems are: Problem set: 6 solved, 317 unsolved
[2025-05-29 21:24:20] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-05-29 21:24:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2025-05-29 21:24:25] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2025-05-29 21:24:25] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/401 variables, 4/493 constraints. Problems are: Problem set: 6 solved, 317 unsolved
[2025-05-29 21:24:27] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 494 constraints, problems are : Problem set: 6 solved, 317 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 319/323 constraints, Known Traps: 10/10 constraints]
After SMT, in 52904ms problems are : Problem set: 6 solved, 317 unsolved
Search for dead transitions found 6 dead transitions in 52910ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 318/324 transitions.
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 309
Applied a total of 1 rules in 8 ms. Remains 97 /98 variables (removed 1) and now considering 309/318 (removed 9) transitions.
[2025-05-29 21:24:30] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
// Phase 1: matrix 289 rows 97 cols
[2025-05-29 21:24:30] [INFO ] Computed 7 invariants in 3 ms
[2025-05-29 21:24:30] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-29 21:24:30] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:30] [INFO ] Invariant cache hit.
[2025-05-29 21:24:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-29 21:24:31] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/98 places, 309/324 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54415 ms. Remains : 97/98 places, 309/324 transitions.
[2025-05-29 21:24:31] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {3=1, 38=1, 50=1, 216=1, 278=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 216=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:24:31] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000035 steps (2 resets) in 809 ms. (1234 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 732 ms. (1364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:24:33] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:33] [INFO ] Invariant cache hit.
[2025-05-29 21:24:33] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:24:33] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-29 21:24:33] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-29 21:24:33] [INFO ] [Real]Added 59 Read/Feed constraints in 12 ms returned sat
[2025-05-29 21:24:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:24:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:24:33] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-29 21:24:33] [INFO ] [Nat]Added 59 Read/Feed constraints in 27 ms returned sat
[2025-05-29 21:24:33] [INFO ] Computed and/alt/rep : 235/1278/235 causal constraints (skipped 53 transitions) in 33 ms.
[2025-05-29 21:24:33] [INFO ] Added : 8 causal constraints over 3 iterations in 136 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 309/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 309/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2025-05-29 21:24:33] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:33] [INFO ] Invariant cache hit.
[2025-05-29 21:24:34] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-29 21:24:34] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:34] [INFO ] Invariant cache hit.
[2025-05-29 21:24:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-29 21:24:34] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2025-05-29 21:24:34] [INFO ] Redundant transitions in 2 ms returned []
Running 308 sub problems to find dead transitions.
[2025-05-29 21:24:34] [INFO ] Flow matrix only has 289 transitions (discarded 20 similar events)
[2025-05-29 21:24:34] [INFO ] Invariant cache hit.
[2025-05-29 21:24:34] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 2 (OVERLAPS) 289/386 variables, 97/104 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 59/163 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/163 constraints. Problems are: Problem set: 32 solved, 276 unsolved
[2025-05-29 21:24:44] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2025-05-29 21:24:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/386 variables, 2/165 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/165 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/165 constraints. Problems are: Problem set: 32 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 165 constraints, problems are : Problem set: 32 solved, 276 unsolved in 19943 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 32 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/9 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 289/386 variables, 97/106 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 59/165 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 276/441 constraints. Problems are: Problem set: 32 solved, 276 unsolved
[2025-05-29 21:24:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2025-05-29 21:24:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2025-05-29 21:25:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-05-29 21:25:02] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2025-05-29 21:25:02] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 5/446 constraints. Problems are: Problem set: 32 solved, 276 unsolved
[2025-05-29 21:25:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/447 constraints. Problems are: Problem set: 32 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/447 constraints. Problems are: Problem set: 32 solved, 276 unsolved
[2025-05-29 21:25:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2025-05-29 21:25:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-05-29 21:25:17] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/386 variables, 3/450 constraints. Problems are: Problem set: 32 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 450 constraints, problems are : Problem set: 32 solved, 276 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 276/308 constraints, Known Traps: 11/11 constraints]
After SMT, in 50396ms problems are : Problem set: 32 solved, 276 unsolved
Search for dead transitions found 32 dead transitions in 50401ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 277/309 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2025-05-29 21:25:24] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51149 ms. Remains : 97/97 places, 277/309 transitions.
[2025-05-29 21:25:24] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {4=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:25:25] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
// Phase 1: matrix 257 rows 97 cols
[2025-05-29 21:25:25] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 1000097 steps (2 resets) in 707 ms. (1412 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 747 ms. (1336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
[2025-05-29 21:25:26] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:26] [INFO ] Invariant cache hit.
[2025-05-29 21:25:26] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:25:26] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-29 21:25:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 21:25:26] [INFO ] [Real]Added 55 Read/Feed constraints in 9 ms returned sat
[2025-05-29 21:25:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:25:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:25:26] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-05-29 21:25:26] [INFO ] [Nat]Added 55 Read/Feed constraints in 15 ms returned sat
[2025-05-29 21:25:26] [INFO ] Computed and/alt/rep : 216/1057/216 causal constraints (skipped 40 transitions) in 25 ms.
[2025-05-29 21:25:27] [INFO ] Added : 9 causal constraints over 3 iterations in 109 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2025-05-29 21:25:27] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:27] [INFO ] Invariant cache hit.
[2025-05-29 21:25:27] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-29 21:25:27] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:27] [INFO ] Invariant cache hit.
[2025-05-29 21:25:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 21:25:27] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2025-05-29 21:25:27] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-29 21:25:27] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:27] [INFO ] Invariant cache hit.
[2025-05-29 21:25:27] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 159 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9960 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 276/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 435 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 24855ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 24860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25490 ms. Remains : 97/97 places, 277/277 transitions.
[2025-05-29 21:25:52] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {4=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
RANDOM walk for 40275 steps (8 resets) in 167 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
[2025-05-29 21:25:53] [INFO ] Flatten gal took : 190 ms
[2025-05-29 21:25:53] [INFO ] Flatten gal took : 84 ms
[2025-05-29 21:25:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality751239291088938060.gal : 30 ms
[2025-05-29 21:25:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7360188965094922299.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality751239291088938060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7360188965094922299.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality7360188965094922299.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 701630 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 701630 steps, saw 426572 distinct states, run finished after 3009 ms. (steps per millisecond=233 ) properties seen :0
[2025-05-29 21:25:56] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:56] [INFO ] Invariant cache hit.
[2025-05-29 21:25:56] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/257 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/261 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/261 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/334 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/334 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/334 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/354 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/354 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/103 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/107 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/181 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 76/257 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/261 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/261 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/334 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/334 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/334 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/354 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/354 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/354 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/354 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/354 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 277/277 transitions.
RANDOM walk for 40207 steps (8 resets) in 38 ms. (1030 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37221 steps (8 resets) in 112 ms. (329 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, 1, 1]
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-29 21:25:56] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10088 steps (2 resets) in 9 ms. (1008 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-29 21:25:56] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:56] [INFO ] Invariant cache hit.
[2025-05-29 21:25:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:25:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-29 21:25:56] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 21:25:56] [INFO ] [Real]Added 55 Read/Feed constraints in 21 ms returned sat
[2025-05-29 21:25:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:25:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:25:56] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-29 21:25:56] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
[2025-05-29 21:25:57] [INFO ] Computed and/alt/rep : 216/1057/216 causal constraints (skipped 40 transitions) in 26 ms.
[2025-05-29 21:25:57] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2025-05-29 21:25:57] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2025-05-29 21:25:57] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2025-05-29 21:25:57] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2025-05-29 21:25:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2025-05-29 21:25:58] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-05-29 21:25:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 688 ms
[2025-05-29 21:25:58] [INFO ] Added : 86 causal constraints over 18 iterations in 1160 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 277/277 transitions.
[2025-05-29 21:25:58] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {4=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-05-29 21:25:58] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:25:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000087 steps (2 resets) in 799 ms. (1250 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 727 ms. (1373 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-29 21:26:00] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:26:00] [INFO ] Invariant cache hit.
[2025-05-29 21:26:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:26:00] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-29 21:26:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 21:26:00] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-05-29 21:26:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:26:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:26:00] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-29 21:26:00] [INFO ] [Nat]Added 55 Read/Feed constraints in 18 ms returned sat
[2025-05-29 21:26:00] [INFO ] Computed and/alt/rep : 216/1057/216 causal constraints (skipped 40 transitions) in 30 ms.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-05-29 21:26:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 738 ms
[2025-05-29 21:26:01] [INFO ] Added : 86 causal constraints over 18 iterations in 1327 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2025-05-29 21:26:01] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:26:01] [INFO ] Invariant cache hit.
[2025-05-29 21:26:02] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-29 21:26:02] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:26:02] [INFO ] Invariant cache hit.
[2025-05-29 21:26:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-29 21:26:02] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2025-05-29 21:26:02] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-29 21:26:02] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
[2025-05-29 21:26:02] [INFO ] Invariant cache hit.
[2025-05-29 21:26:02] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 159 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 257/354 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 276/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 435 constraints, problems are : Problem set: 0 solved, 276 unsolved in 15151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 24195ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 24203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24824 ms. Remains : 97/97 places, 277/277 transitions.
[2025-05-29 21:26:26] [INFO ] Flow matrix only has 257 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {4=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 31387 steps (6 resets) in 32 ms. (951 steps per ms) remains 0/1 properties
[2025-05-29 21:26:27] [INFO ] Flatten gal took : 33 ms
[2025-05-29 21:26:27] [INFO ] Flatten gal took : 30 ms
[2025-05-29 21:26:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13815822121780937625.gal : 7 ms
[2025-05-29 21:26:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13365086477858663962.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13815822121780937625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13365086477858663962.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-02 in 30437 ms.
[2025-05-29 21:26:27] [INFO ] Flatten gal took : 48 ms
[2025-05-29 21:26:27] [INFO ] Applying decomposition
[2025-05-29 21:26:27] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15530492068838366058.txt' '-o' '/tmp/graph15530492068838366058.bin' '-w' '/tmp/graph15530492068838366058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15530492068838366058.bin' '-l' '-1' '-v' '-w' '/tmp/graph15530492068838366058.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:26:27] [INFO ] Decomposing Gal with order
[2025-05-29 21:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:26:27] [INFO ] Removed a total of 5 redundant transitions.
[2025-05-29 21:26:27] [INFO ] Flatten gal took : 119 ms
[2025-05-29 21:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2025-05-29 21:26:27] [INFO ] Time to serialize gal into /tmp/UpperBounds2707283771711068757.gal : 9 ms
[2025-05-29 21:26:27] [INFO ] Time to serialize properties into /tmp/UpperBounds1675310475734176974.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2707283771711068757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1675310475734176974.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds1675310475734176974.prop.
BK_STOP 1748554071643
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="BugTracking-PT-q8m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is BugTracking-PT-q8m128, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r027-smll-174853774300075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;