About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1800000.00 | 0.00 | 0.00 | [undef] | Time out reached |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r091-smll-174860108100248.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-smll-174860108100248
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 247K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1748652378638
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-05-31 00:46:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-31 00:46:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:46:21] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-05-31 00:46:21] [INFO ] Transformed 626 places.
[2025-05-31 00:46:21] [INFO ] Transformed 1031 transitions.
[2025-05-31 00:46:21] [INFO ] Found NUPN structural information;
[2025-05-31 00:46:21] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 351 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 6 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 37 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
[2025-05-31 00:46:22] [INFO ] Flatten gal took : 349 ms
RANDOM walk for 40000 steps (455 resets) in 4012 ms. (9 steps per ms) remains 367/533 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 367/367 properties
[2025-05-31 00:46:22] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 367/367 properties
BEST_FIRST walk for 401 steps (8 resets) in 20 ms. (19 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 367/367 properties
BEST_FIRST walk for 402 steps (8 resets) in 24 ms. (16 steps per ms) remains 367/367 properties
[2025-05-31 00:46:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11590218403809247792.gal : 71 ms
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 28 ms. (13 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 35 ms. (11 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 367/367 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
[2025-05-31 00:46:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10990669467938809605.prop : 15 ms
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11590218403809247792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10990669467938809605.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 367/367 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 367/367 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 367/367 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 367/367 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2025-05-31 00:46:23] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
// Phase 1: matrix 1019 rows 617 cols
[2025-05-31 00:46:23] [INFO ] Computed 13 invariants in 30 ms
[2025-05-31 00:46:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality10990669467938809605.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,367 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,367 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,367 properties remain. new max is 16
SDD size :3 after 14
SDD proceeding with computation,367 properties remain. new max is 32
SDD size :14 after 60
SDD proceeding with computation,367 properties remain. new max is 64
SDD size :60 after 178
SDD proceeding with computation,367 properties remain. new max is 128
SDD size :178 after 349
SDD proceeding with computation,367 properties remain. new max is 256
SDD size :349 after 737
SDD proceeding with computation,367 properties remain. new max is 512
SDD size :737 after 4955
Invariant property smplace_225 does not hold.
Invariant property smplace_224 does not hold.
SDD proceeding with computation,365 properties remain. new max is 512
SDD size :4955 after 12609
Invariant property smplace_223 does not hold.
Invariant property smplace_222 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_59 does not hold.
SDD proceeding with computation,354 properties remain. new max is 512
SDD size :12609 after 17194
Invariant property smplace_217 does not hold.
SDD proceeding with computation,353 properties remain. new max is 512
SDD size :17194 after 28401
SDD proceeding with computation,353 properties remain. new max is 1024
SDD size :28401 after 31913
Invariant property smplace_60 does not hold.
Invariant property smplace_58 does not hold.
SDD proceeding with computation,351 properties remain. new max is 1024
SDD size :31913 after 41697
SDD proceeding with computation,351 properties remain. new max is 2048
SDD size :41697 after 46965
Invariant property smplace_57 does not hold.
SDD proceeding with computation,350 properties remain. new max is 2048
SDD size :46965 after 56021
Error getting values : (error "ParserException while parsing response: ((s4 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s86 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s113 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s188 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s199 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s274 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s299 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s308 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s317 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s324 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s343 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s364 (/ 1.0 2.0))
(s372 (/ 1.0 2.0))
(s373 (/ 1.0 2.0))
(s374 (/ 1.0 2.0))
(s375 (/ 1.0 2.0))
(s376 (/ 1.0 2.0))
(s377 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s380 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s382 (/ 1.0 2.0))
(s383 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s385 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s387 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s394 (/ 1.0 2.0))
(s395 (/ 1.0 2.0))
(s396 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s399 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 367/367 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1636 variables, and 367 constraints, problems are : Problem set: 17 solved, 350 unsolved in 5163 ms.
Refiners :[Domain max(s): 367/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 350 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,350 properties remain. new max is 4096
SDD size :56021 after 59925
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 17 solved, 350 unsolved
Invariant property smplace_216 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_214 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_211 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_204 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_202 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_93 does not hold.
SDD proceeding with computation,330 properties remain. new max is 4096
SDD size :59925 after 177849
Invariant property smplace_196 does not hold.
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_111 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_94 does not hold.
SDD proceeding with computation,304 properties remain. new max is 4096
SDD size :177849 after 248033
Invariant property smplace_165 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
Invariant property smplace_121 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
SDD proceeding with computation,278 properties remain. new max is 4096
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SDD size :248033 after 392319
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1636 variables, and 350 constraints, problems are : Problem set: 89 solved, 278 unsolved in 5032 ms.
Refiners :[Domain max(s): 350/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10471ms problems are : Problem set: 89 solved, 278 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 278 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 608 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.16 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 608 transition count 933
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 175 place count 524 transition count 931
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 523 transition count 931
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 176 place count 523 transition count 921
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 196 place count 513 transition count 921
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 227 place count 482 transition count 888
Iterating global reduction 3 with 31 rules applied. Total rules applied 258 place count 482 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 261 place count 482 transition count 885
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 261 place count 482 transition count 884
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 481 transition count 884
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 270 place count 474 transition count 790
Iterating global reduction 4 with 7 rules applied. Total rules applied 277 place count 474 transition count 790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 279 place count 474 transition count 788
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 473 transition count 786
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 473 transition count 786
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 349 place count 439 transition count 752
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 395 place count 416 transition count 799
Free-agglomeration rule applied 27 times.
Iterating global reduction 5 with 27 rules applied. Total rules applied 422 place count 416 transition count 772
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 455 place count 389 transition count 766
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 457 place count 387 transition count 764
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 387 transition count 764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 462 place count 387 transition count 761
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 474 place count 387 transition count 749
Applied a total of 474 rules in 543 ms. Remains 387 /617 variables (removed 230) and now considering 749/1021 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 387/617 places, 749/1021 transitions.
SDD proceeding with computation,278 properties remain. new max is 8192
SDD size :392319 after 562841
SDD proceeding with computation,278 properties remain. new max is 16384
SDD size :562841 after 868407
Invariant property smplace_200 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_198 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_133 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_16 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
Invariant property smplace_4 does not hold.
SDD proceeding with computation,228 properties remain. new max is 16384
SDD size :868407 after 2.45197e+06
SDD proceeding with computation,228 properties remain. new max is 32768
SDD size :2.45197e+06 after 2.92249e+06
RANDOM walk for 4000000 steps (183802 resets) in 84540 ms. (47 steps per ms) remains 152/278 properties
BEST_FIRST walk for 40004 steps (333 resets) in 191 ms. (208 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (324 resets) in 176 ms. (226 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (319 resets) in 155 ms. (256 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (350 resets) in 220 ms. (181 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (318 resets) in 194 ms. (205 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (326 resets) in 157 ms. (253 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (346 resets) in 169 ms. (235 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (348 resets) in 142 ms. (279 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (328 resets) in 194 ms. (205 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (337 resets) in 177 ms. (224 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (342 resets) in 200 ms. (199 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (347 resets) in 159 ms. (250 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (350 resets) in 184 ms. (216 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (330 resets) in 185 ms. (215 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (337 resets) in 195 ms. (204 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (321 resets) in 192 ms. (207 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (332 resets) in 227 ms. (175 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (349 resets) in 247 ms. (161 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (340 resets) in 205 ms. (194 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (343 resets) in 217 ms. (183 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (329 resets) in 253 ms. (157 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (331 resets) in 209 ms. (190 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (323 resets) in 222 ms. (179 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (330 resets) in 233 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (337 resets) in 250 ms. (159 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (327 resets) in 182 ms. (218 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (334 resets) in 224 ms. (177 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (334 resets) in 223 ms. (178 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (343 resets) in 242 ms. (164 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (353 resets) in 250 ms. (159 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (333 resets) in 200 ms. (199 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (335 resets) in 218 ms. (182 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (338 resets) in 187 ms. (212 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (322 resets) in 220 ms. (181 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (330 resets) in 216 ms. (184 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (333 resets) in 224 ms. (177 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (336 resets) in 197 ms. (202 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (324 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (313 resets) in 205 ms. (194 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (342 resets) in 176 ms. (226 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (344 resets) in 161 ms. (246 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (351 resets) in 188 ms. (211 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (337 resets) in 192 ms. (207 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (337 resets) in 197 ms. (202 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (324 resets) in 213 ms. (186 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (346 resets) in 245 ms. (162 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (321 resets) in 218 ms. (182 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (323 resets) in 181 ms. (219 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40004 steps (334 resets) in 168 ms. (236 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (341 resets) in 208 ms. (191 steps per ms) remains 152/152 properties
[2025-05-31 00:46:59] [INFO ] Flow matrix only has 744 transitions (discarded 5 similar events)
// Phase 1: matrix 744 rows 387 cols
[2025-05-31 00:46:59] [INFO ] Computed 10 invariants in 6 ms
[2025-05-31 00:46:59] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 149/274 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 101/375 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
SDD proceeding with computation,228 properties remain. new max is 65536
SDD size :2.92249e+06 after 4.02943e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 743/1118 variables, 375/385 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 49/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1118 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 12/1130 variables, 11/445 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1130 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/1131 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 446 constraints, problems are : Problem set: 0 solved, 125 unsolved in 20135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 387/387 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 149/274 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_413 does not hold.
Invariant property smplace_412 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_409 does not hold.
Invariant property smplace_408 does not hold.
Invariant property smplace_405 does not hold.
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,219 properties remain. new max is 65536
SDD size :4.02943e+06 after 6.16926e+07
[2025-05-31 00:47:21] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:23] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:24] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:25] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:26] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:26] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:27] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 101/375 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:30] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:33] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 743/1118 variables, 375/403 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1118 variables, 49/452 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1118 variables, 125/577 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:38] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:38] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 79 places in 297 ms of which 61 ms to minimize.
SDD proceeding with computation,219 properties remain. new max is 131072
SDD size :6.16926e+07 after 8.1301e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/1118 variables, 9/586 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1118 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 16 (OVERLAPS) 12/1130 variables, 11/597 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/1131 variables, and 597 constraints, problems are : Problem set: 0 solved, 125 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 386/387 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65200ms problems are : Problem set: 0 solved, 125 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 749/749 transitions.
Graph (complete) has 1417 edges and 387 vertex of which 386 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 386 transition count 717
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 355 transition count 717
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 64 place count 355 transition count 713
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 351 transition count 713
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 88 place count 335 transition count 694
Iterating global reduction 2 with 16 rules applied. Total rules applied 104 place count 335 transition count 694
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 104 place count 335 transition count 691
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 332 transition count 691
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 326 transition count 679
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 326 transition count 679
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 323 transition count 674
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 323 transition count 674
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 135 place count 323 transition count 667
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 321 transition count 667
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 169 place count 305 transition count 651
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 304 transition count 650
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 304 transition count 650
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 193 place count 293 transition count 674
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 197 place count 293 transition count 670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 292 transition count 664
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 292 transition count 664
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 291 transition count 662
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 291 transition count 662
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 290 transition count 659
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 290 transition count 659
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 289 transition count 657
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 289 transition count 657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 288 transition count 654
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 288 transition count 654
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 287 transition count 652
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 287 transition count 652
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 286 transition count 649
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 286 transition count 649
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 212 place count 285 transition count 647
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 285 transition count 647
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 284 transition count 644
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 284 transition count 644
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 216 place count 283 transition count 642
Iterating global reduction 5 with 1 rules applied. Total rules applied 217 place count 283 transition count 642
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 218 place count 282 transition count 640
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 282 transition count 640
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 281 transition count 638
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 281 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 232 place count 281 transition count 627
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 237 place count 281 transition count 622
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 242 place count 276 transition count 622
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 276 transition count 621
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 246 place count 276 transition count 794
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 249 place count 273 transition count 794
Applied a total of 249 rules in 246 ms. Remains 273 /387 variables (removed 114) and now considering 794/749 (removed -45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 273/387 places, 794/749 transitions.
RANDOM walk for 4000000 steps (90598 resets) in 57128 ms. (70 steps per ms) remains 50/125 properties
Invariant property smplace_407 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_403 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_400 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_385 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_358 does not hold.
BEST_FIRST walk for 400002 steps (1861 resets) in 1104 ms. (361 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1935 resets) in 1176 ms. (339 steps per ms) remains 50/50 properties
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
SDD proceeding with computation,205 properties remain. new max is 131072
SDD size :8.1301e+07 after 3.28123e+08
BEST_FIRST walk for 400002 steps (1898 resets) in 1196 ms. (334 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1905 resets) in 1124 ms. (355 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1882 resets) in 1044 ms. (382 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1893 resets) in 1126 ms. (354 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1880 resets) in 1084 ms. (368 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1870 resets) in 1086 ms. (367 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1899 resets) in 1055 ms. (378 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1859 resets) in 1197 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 1102 ms. (362 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 1041 ms. (383 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1909 resets) in 1158 ms. (345 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 1123 ms. (355 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1862 resets) in 1376 ms. (290 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1890 resets) in 1230 ms. (324 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1869 resets) in 1261 ms. (316 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1868 resets) in 1005 ms. (397 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1867 resets) in 1209 ms. (330 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1862 resets) in 1274 ms. (313 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1876 resets) in 1007 ms. (396 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1867 resets) in 1029 ms. (388 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1896 resets) in 1126 ms. (354 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1921 resets) in 1163 ms. (343 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1859 resets) in 1239 ms. (322 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1892 resets) in 1162 ms. (343 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1915 resets) in 1255 ms. (318 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1857 resets) in 1149 ms. (347 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (1905 resets) in 1227 ms. (325 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1860 resets) in 1119 ms. (357 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1877 resets) in 1198 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1914 resets) in 1194 ms. (334 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1931 resets) in 1162 ms. (343 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1900 resets) in 1292 ms. (309 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1878 resets) in 1134 ms. (352 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 1269 ms. (314 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 1314 ms. (304 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1881 resets) in 1087 ms. (367 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 1143 ms. (349 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1919 resets) in 1079 ms. (370 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1901 resets) in 1178 ms. (339 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1855 resets) in 1080 ms. (370 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1875 resets) in 1209 ms. (330 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1874 resets) in 988 ms. (404 steps per ms) remains 48/50 properties
BEST_FIRST walk for 400002 steps (1887 resets) in 1108 ms. (360 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1893 resets) in 1041 ms. (383 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1869 resets) in 1240 ms. (322 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1923 resets) in 1029 ms. (388 steps per ms) remains 48/48 properties
[2025-05-31 00:48:40] [INFO ] Flow matrix only has 785 transitions (discarded 9 similar events)
// Phase 1: matrix 785 rows 273 cols
[2025-05-31 00:48:40] [INFO ] Computed 10 invariants in 5 ms
[2025-05-31 00:48:40] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 123/171 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 85/256 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 780/1036 variables, 256/266 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 91/357 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1036 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 21/1057 variables, 16/373 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/1058 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1058 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/1058 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1058/1058 variables, and 374 constraints, problems are : Problem set: 0 solved, 48 unsolved in 4711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 273/273 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 123/171 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 85/256 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:45] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:46] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:46] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 780/1036 variables, 256/269 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1036 variables, 91/360 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1036 variables, 48/408 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:48] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 25 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1036 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Invariant property smplace_597 does not hold.
Invariant property smplace_596 does not hold.
Invariant property smplace_593 does not hold.
Invariant property smplace_398 does not hold.
Invariant property smplace_397 does not hold.
Invariant property smplace_395 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
At refinement iteration 10 (INCLUDED_ONLY) 0/1036 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Invariant property smplace_309 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_295 does not hold.
SDD proceeding with computation,183 properties remain. new max is 131072
SDD size :3.28123e+08 after 1.62605e+09
At refinement iteration 11 (OVERLAPS) 21/1057 variables, 16/425 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1057 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 1/1058 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1058 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (OVERLAPS) 0/1058 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1058/1058 variables, and 426 constraints, problems are : Problem set: 0 solved, 48 unsolved in 24456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 273/273 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29199ms problems are : Problem set: 0 solved, 48 unsolved
Parikh walk visited 0 properties in 7079 ms.
Support contains 48 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 794/794 transitions.
Graph (complete) has 1262 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 272 transition count 789
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 268 transition count 789
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 268 transition count 788
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 267 transition count 788
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 28 place count 251 transition count 772
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 251 transition count 772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 44 place count 251 transition count 771
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 250 transition count 771
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 243 transition count 761
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 243 transition count 761
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 241 transition count 757
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 241 transition count 757
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 90 place count 228 transition count 744
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 223 transition count 733
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 223 transition count 733
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 215 transition count 744
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 215 transition count 740
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 215 transition count 738
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 213 transition count 738
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 213 transition count 738
Applied a total of 125 rules in 127 ms. Remains 213 /273 variables (removed 60) and now considering 738/794 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 213/273 places, 738/794 transitions.
RANDOM walk for 4000000 steps (90503 resets) in 44426 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1874 resets) in 1207 ms. (331 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1883 resets) in 1066 ms. (374 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1899 resets) in 1146 ms. (348 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1874 resets) in 1351 ms. (295 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1882 resets) in 1101 ms. (362 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1903 resets) in 1249 ms. (320 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1903 resets) in 1089 ms. (366 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1886 resets) in 1050 ms. (380 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1917 resets) in 1060 ms. (377 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1899 resets) in 1264 ms. (316 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1885 resets) in 1060 ms. (377 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1878 resets) in 1011 ms. (395 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 1083 ms. (369 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1882 resets) in 1245 ms. (321 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1894 resets) in 1086 ms. (367 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1862 resets) in 1051 ms. (380 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1902 resets) in 927 ms. (431 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1910 resets) in 1043 ms. (383 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1895 resets) in 993 ms. (402 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1883 resets) in 1045 ms. (382 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1884 resets) in 1014 ms. (394 steps per ms) remains 48/48 properties
Invariant property smplace_595 does not hold.
Invariant property smplace_592 does not hold.
Invariant property smplace_591 does not hold.
BEST_FIRST walk for 400004 steps (1902 resets) in 1204 ms. (331 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1890 resets) in 1104 ms. (361 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1878 resets) in 1138 ms. (351 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1882 resets) in 1151 ms. (347 steps per ms) remains 48/48 properties
SDD proceeding with computation,180 properties remain. new max is 131072
SDD size :1.62605e+09 after 1.70943e+09
BEST_FIRST walk for 400003 steps (1873 resets) in 1096 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1889 resets) in 1189 ms. (336 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1880 resets) in 1082 ms. (369 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1887 resets) in 1202 ms. (332 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1940 resets) in 1105 ms. (361 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1881 resets) in 1230 ms. (324 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1892 resets) in 1240 ms. (322 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1883 resets) in 1238 ms. (322 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1887 resets) in 1113 ms. (359 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (1858 resets) in 1200 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1870 resets) in 1121 ms. (356 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1912 resets) in 1295 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1867 resets) in 1245 ms. (321 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1914 resets) in 1085 ms. (368 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1849 resets) in 1100 ms. (363 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (1890 resets) in 1081 ms. (369 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (1907 resets) in 1160 ms. (344 steps per ms) remains 44/48 properties
BEST_FIRST walk for 400002 steps (1916 resets) in 1068 ms. (374 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1874 resets) in 1147 ms. (348 steps per ms) remains 44/44 properties
Invariant property smplace_590 does not hold.
Invariant property smplace_589 does not hold.
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_580 does not hold.
Invariant property smplace_579 does not hold.
Invariant property smplace_578 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_575 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_573 does not hold.
Invariant property smplace_572 does not hold.
Invariant property smplace_571 does not hold.
Invariant property smplace_554 does not hold.
Invariant property smplace_553 does not hold.
Invariant property smplace_552 does not hold.
Invariant property smplace_547 does not hold.
Invariant property smplace_546 does not hold.
Invariant property smplace_543 does not hold.
Invariant property smplace_542 does not hold.
Invariant property smplace_541 does not hold.
Invariant property smplace_540 does not hold.
Invariant property smplace_539 does not hold.
Invariant property smplace_538 does not hold.
Invariant property smplace_489 does not hold.
Invariant property smplace_488 does not hold.
Invariant property smplace_484 does not hold.
Invariant property smplace_483 does not hold.
Invariant property smplace_482 does not hold.
SDD proceeding with computation,151 properties remain. new max is 131072
SDD size :1.70943e+09 after 2.61934e+09
SDD proceeding with computation,151 properties remain. new max is 262144
SDD size :2.61934e+09 after 4.03562e+09
Interrupted probabilistic random walk after 8853068 steps, run timeout after 87001 ms. (steps per millisecond=101 ) properties seen :30 out of 44
Probabilistic random walk after 8853068 steps, saw 2297344 distinct states, run finished after 87019 ms. (steps per millisecond=101 ) properties seen :30
[2025-05-31 00:51:12] [INFO ] Flow matrix only has 729 transitions (discarded 9 similar events)
// Phase 1: matrix 729 rows 213 cols
[2025-05-31 00:51:12] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 00:51:12] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 136/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 729/925 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 93/299 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 17/942 variables, 17/316 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/942 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 942/942 variables, and 316 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 213/213 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 136/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:14] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:14] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:14] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:14] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:14] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:15] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 729/925 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 93/305 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 14/319 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:15] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:16] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 30 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 17/942 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/942 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/942 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 942/942 variables, and 338 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4606 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 213/213 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5714ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 10822 ms.
Support contains 14 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 738/738 transitions.
Graph (complete) has 1163 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 210 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 210 transition count 736
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 209 transition count 736
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 9 place count 205 transition count 732
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 205 transition count 732
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 205 transition count 731
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 204 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 203 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 203 transition count 727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 202 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 200 transition count 718
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 200 transition count 718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 198 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 197 transition count 709
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 197 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 196 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 196 transition count 707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 195 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 195 transition count 700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 194 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 194 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 193 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 193 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 192 transition count 689
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 192 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 191 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 191 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 190 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 190 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 189 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 189 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 188 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 188 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 187 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 187 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 186 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 186 transition count 665
Applied a total of 51 rules in 145 ms. Remains 186 /213 variables (removed 27) and now considering 665/738 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 186/213 places, 665/738 transitions.
RANDOM walk for 4000000 steps (90416 resets) in 28516 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18952 resets) in 6840 ms. (584 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (18948 resets) in 7236 ms. (552 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18896 resets) in 7172 ms. (557 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18908 resets) in 7182 ms. (556 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18842 resets) in 6903 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18941 resets) in 6964 ms. (574 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18824 resets) in 6758 ms. (591 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18799 resets) in 6927 ms. (577 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (18950 resets) in 6795 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18933 resets) in 7304 ms. (547 steps per ms) remains 14/14 properties
SDD proceeding with computation,151 properties remain. new max is 524288
SDD size :4.03562e+09 after 4.20094e+09
BEST_FIRST walk for 4000003 steps (18799 resets) in 7189 ms. (556 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18894 resets) in 7097 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (18925 resets) in 6693 ms. (597 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (18960 resets) in 6818 ms. (586 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 10898532 steps, run timeout after 108001 ms. (steps per millisecond=100 ) properties seen :0 out of 14
Probabilistic random walk after 10898532 steps, saw 2774384 distinct states, run finished after 108005 ms. (steps per millisecond=100 ) properties seen :0
[2025-05-31 00:53:53] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
// Phase 1: matrix 656 rows 186 cols
[2025-05-31 00:53:53] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 00:53:53] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 656/829 variables, 173/183 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 87/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/842 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/842 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 283 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:54] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:55] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 656/829 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 87/272 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 13/842 variables, 13/299 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:56] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/842 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/842 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 300 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4376ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 10587 ms.
Support contains 14 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 665/665 transitions.
Applied a total of 0 rules in 15 ms. Remains 186 /186 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 186/186 places, 665/665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 665/665 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2025-05-31 00:54:08] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
[2025-05-31 00:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:09] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2025-05-31 00:54:09] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
[2025-05-31 00:54:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:10] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 00:54:10] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:54:10] [INFO ] Redundant transitions in 86 ms returned [362, 363]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 655 sub problems to find dead transitions.
[2025-05-31 00:54:10] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 00:54:10] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 00:54:10] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,151 properties remain. new max is 1048576
SDD size :4.20094e+09 after 7.25682e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:20] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:22] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:23] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:24] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:24] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:25] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:26] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/838 variables, 184/206 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/840 variables, and 293 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/838 variables, 184/206 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 646/939 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/840 variables, and 939 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 646/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61337ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 61346ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 186/186 places, 663/665 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63569 ms. Remains : 186/186 places, 663/665 transitions.
RANDOM walk for 4000000 steps (91208 resets) in 28538 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19106 resets) in 7119 ms. (561 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19205 resets) in 6613 ms. (604 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19177 resets) in 7099 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19156 resets) in 7475 ms. (535 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19202 resets) in 7342 ms. (544 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19114 resets) in 7126 ms. (561 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19212 resets) in 6550 ms. (610 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19178 resets) in 6567 ms. (609 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19111 resets) in 6496 ms. (615 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19261 resets) in 7258 ms. (551 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19196 resets) in 6981 ms. (572 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19092 resets) in 6564 ms. (609 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19059 resets) in 6977 ms. (573 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19190 resets) in 7701 ms. (519 steps per ms) remains 14/14 properties
Detected timeout of ITS tools.
[2025-05-31 00:56:23] [INFO ] Flatten gal took : 106 ms
[2025-05-31 00:56:23] [INFO ] Applying decomposition
[2025-05-31 00:56:23] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16265464656952424026.txt' '-o' '/tmp/graph16265464656952424026.bin' '-w' '/tmp/graph16265464656952424026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16265464656952424026.bin' '-l' '-1' '-v' '-w' '/tmp/graph16265464656952424026.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:56:24] [INFO ] Decomposing Gal with order
[2025-05-31 00:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:56:24] [INFO ] Removed a total of 984 redundant transitions.
[2025-05-31 00:56:24] [INFO ] Flatten gal took : 309 ms
[2025-05-31 00:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 52 ms.
[2025-05-31 00:56:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18036097194993854447.gal : 25 ms
[2025-05-31 00:56:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11551859988185631051.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18036097194993854447.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11551859988185631051.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11551859988185631051.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :175 after 552975
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :552975 after 8.75274e+07
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :8.75274e+07 after 1.76196e+08
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.76196e+08 after 1.26633e+09
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.26633e+09 after 8.41113e+10
Interrupted probabilistic random walk after 10533587 steps, run timeout after 108001 ms. (steps per millisecond=97 ) properties seen :0 out of 14
Probabilistic random walk after 10533587 steps, saw 2687212 distinct states, run finished after 108001 ms. (steps per millisecond=97 ) properties seen :0
[2025-05-31 00:57:36] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 00:57:36] [INFO ] Invariant cache hit.
[2025-05-31 00:57:36] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 654/827 variables, 173/183 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 87/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/840 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:38] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:38] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 654/827 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 87/272 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:39] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 13/840 variables, 13/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/840 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :8.41113e+10 after 8.77441e+12
After SMT solving in domain Int declared 840/840 variables, and 300 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4374ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 7911 ms.
Support contains 14 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Applied a total of 0 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 186/186 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Applied a total of 0 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2025-05-31 00:57:49] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 00:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:49] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-31 00:57:49] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 00:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:49] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 00:57:50] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:57:50] [INFO ] Redundant transitions in 12 ms returned []
Running 655 sub problems to find dead transitions.
[2025-05-31 00:57:50] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 00:57:50] [INFO ] Invariant cache hit.
[2025-05-31 00:57:50] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:59] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:59] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:59] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:59] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:59] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:00] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:00] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:01] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:03] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:04] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:04] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:07] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :8.77441e+12 after 1.39898e+13
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
SMT process timed out in 30463ms, After SMT, problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 30467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31382 ms. Remains : 186/186 places, 663/663 transitions.
RANDOM walk for 400000 steps (9086 resets) in 4814 ms. (83 steps per ms) remains 14/14 properties
Running SMT prover for 14 properties.
[2025-05-31 00:58:22] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 00:58:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:58:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 00:58:22] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2025-05-31 00:58:22] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 00:58:22] [INFO ] After 131ms SMT Verify possible using 87 Read/Feed constraints in real domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2025-05-31 00:58:23] [INFO ] After 808ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2025-05-31 00:58:23] [INFO ] After 1172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:58:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 00:58:23] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2025-05-31 00:58:24] [INFO ] After 171ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:24] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 5 ms to minimize.
[2025-05-31 00:58:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 1
[2025-05-31 00:58:25] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2025-05-31 00:58:25] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
RANDOM walk for 4000000 steps (91565 resets) in 28133 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19160 resets) in 6932 ms. (576 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (18995 resets) in 6763 ms. (591 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19120 resets) in 7029 ms. (568 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19088 resets) in 8099 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19213 resets) in 6831 ms. (585 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19122 resets) in 6928 ms. (577 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19137 resets) in 7100 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19077 resets) in 7295 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19218 resets) in 6816 ms. (586 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19153 resets) in 6878 ms. (581 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19088 resets) in 6925 ms. (577 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (19109 resets) in 6449 ms. (620 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (19291 resets) in 7075 ms. (565 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (19150 resets) in 6876 ms. (581 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 12247825 steps, run timeout after 108001 ms. (steps per millisecond=113 ) properties seen :0 out of 14
Probabilistic random walk after 12247825 steps, saw 3137251 distinct states, run finished after 108005 ms. (steps per millisecond=113 ) properties seen :0
[2025-05-31 01:00:50] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:00:50] [INFO ] Invariant cache hit.
[2025-05-31 01:00:50] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 654/827 variables, 173/183 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 87/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/840 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 14 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 113/173 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:51] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:51] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 654/827 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 87/272 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:52] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 13/840 variables, 13/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/840 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 300 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3944ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 5582 ms.
Support contains 14 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Applied a total of 0 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 186/186 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2025-05-31 01:00:59] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:00:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:00:59] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 01:00:59] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:00:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:00] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 01:01:00] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:01:00] [INFO ] Redundant transitions in 10 ms returned []
Running 655 sub problems to find dead transitions.
[2025-05-31 01:01:00] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:01:00] [INFO ] Invariant cache hit.
[2025-05-31 01:01:00] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:09] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:09] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:09] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:09] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:10] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:10] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:10] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:12] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:12] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:13] [INFO ] Deduced a trap composed of 99 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:13] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:14] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/838 variables, 184/206 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/840 variables, and 293 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/838 variables, 184/206 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 646/939 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/840 variables, and 939 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 646/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61341 ms. Remains : 186/186 places, 663/663 transitions.
RANDOM walk for 400000 steps (9130 resets) in 2919 ms. (136 steps per ms) remains 14/14 properties
Running SMT prover for 14 properties.
[2025-05-31 01:02:01] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:02:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:02:01] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 01:02:02] [INFO ] After 280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2025-05-31 01:02:02] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 01:02:02] [INFO ] After 124ms SMT Verify possible using 87 Read/Feed constraints in real domain returned unsat :0 sat :14
TRAPS : Iteration 0
[2025-05-31 01:02:02] [INFO ] After 750ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2025-05-31 01:02:02] [INFO ] After 1116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:02:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 01:02:03] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2025-05-31 01:02:03] [INFO ] After 149ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :14
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:03] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 4 ms to minimize.
[2025-05-31 01:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
TRAPS : Iteration 1
[2025-05-31 01:02:04] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
[2025-05-31 01:02:04] [INFO ] After 1608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
RANDOM walk for 40000 steps (937 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (194 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 630868 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 630868 steps, saw 164659 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2025-05-31 01:02:07] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:02:07] [INFO ] Invariant cache hit.
[2025-05-31 01:02:07] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 165/194 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 642/836 variables, 177/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 87/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/840 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/194 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:08] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 642/836 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 87/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:08] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:09] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 37 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/840 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1635ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 183 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 183 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 182 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 181 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 181 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 180 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 179 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 179 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 178 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 178 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 177 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 177 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 176 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 176 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 175 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 175 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 174 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 174 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 173 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 173 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 172 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 172 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 171 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 171 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 170 transition count 612
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 170 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 169 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 169 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 168 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 168 transition count 606
Applied a total of 35 rules in 57 ms. Remains 168 /186 variables (removed 18) and now considering 606/663 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 168/186 places, 606/663 transitions.
RANDOM walk for 40000 steps (913 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 600872 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 600872 steps, saw 155809 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-05-31 01:02:12] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
// Phase 1: matrix 597 rows 168 cols
[2025-05-31 01:02:12] [INFO ] Computed 10 invariants in 6 ms
[2025-05-31 01:02:12] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 149/176 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 585/761 variables, 159/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/761 variables, 82/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/761 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/765 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:13] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:13] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 28 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 585/761 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/761 variables, 82/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/765 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/765 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/765 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 606/606 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 168/168 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 606/606 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2025-05-31 01:02:13] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:14] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-31 01:02:14] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:14] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-31 01:02:14] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:02:14] [INFO ] Redundant transitions in 14 ms returned []
Running 598 sub problems to find dead transitions.
[2025-05-31 01:02:14] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:02:14] [INFO ] Invariant cache hit.
[2025-05-31 01:02:14] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:24] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:24] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:24] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:24] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:24] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:25] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:25] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:27] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:27] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:28] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:28] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:29] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/765 variables, and 271 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 590/861 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/765 variables, and 861 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 590/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60601ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61646 ms. Remains : 168/168 places, 606/606 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 168 vertex of which 33 / 168 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 138 transition count 441
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 138 transition count 441
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 138 transition count 430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 137 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 137 transition count 407
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 137 transition count 403
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 133 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 133 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 132 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 131 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 131 transition count 387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 130 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 129 transition count 353
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 129 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 93 place count 129 transition count 332
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 129 transition count 328
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 103 place count 125 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 125 transition count 322
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 125 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 123 transition count 320
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 123 transition count 320
Applied a total of 117 rules in 74 ms. Remains 123 /168 variables (removed 45) and now considering 320/606 (removed 286) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:03:15] [INFO ] Flow matrix only has 316 transitions (discarded 4 similar events)
// Phase 1: matrix 316 rows 123 cols
[2025-05-31 01:03:15] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:03:15] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:03:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 01:03:15] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:03:15] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 01:03:15] [INFO ] After 33ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:15] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:16] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 8 ms to minimize.
[2025-05-31 01:03:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
TRAPS : Iteration 1
[2025-05-31 01:03:16] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:03:16] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 605 ms.
RANDOM walk for 40000 steps (943 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (203 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 636104 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 636104 steps, saw 165505 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2025-05-31 01:03:19] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:03:19] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:03:19] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 165/195 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 641/836 variables, 176/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 87/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/840 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/27 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/195 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:19] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:19] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 26 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 641/836 variables, 176/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 87/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:20] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/840 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/840 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 182 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 182 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 180 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 180 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 179 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 178 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 178 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 176 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 176 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 175 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 175 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 174 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 174 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 173 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 173 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 172 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 172 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 171 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 171 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 170 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 170 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 169 transition count 612
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 169 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 168 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 168 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 167 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 167 transition count 606
Applied a total of 35 rules in 55 ms. Remains 167 /186 variables (removed 19) and now considering 606/663 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 167/186 places, 606/663 transitions.
RANDOM walk for 40000 steps (889 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (180 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 679862 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 1
Probabilistic random walk after 679862 steps, saw 175960 distinct states, run finished after 3004 ms. (steps per millisecond=226 ) properties seen :0
[2025-05-31 01:03:23] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
// Phase 1: matrix 597 rows 167 cols
[2025-05-31 01:03:23] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:03:23] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 149/176 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 584/760 variables, 158/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 82/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/764 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/764 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 584/760 variables, 158/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 82/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:24] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/760 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/764 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/764 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/764 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 606/606 transitions.
Applied a total of 0 rules in 7 ms. Remains 167 /167 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 167/167 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 606/606 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2025-05-31 01:03:24] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:03:24] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-05-31 01:03:24] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:03:25] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-31 01:03:25] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:03:25] [INFO ] Redundant transitions in 8 ms returned []
Running 598 sub problems to find dead transitions.
[2025-05-31 01:03:25] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:03:25] [INFO ] Invariant cache hit.
[2025-05-31 01:03:25] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:33] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:33] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:33] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:34] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:34] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:34] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:34] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:35] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:36] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:36] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 271 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 598/869 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 869 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61280 ms. Remains : 167/167 places, 606/606 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 167 vertex of which 33 / 167 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 137 transition count 441
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 137 transition count 441
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 137 transition count 430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 136 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 136 transition count 407
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 136 transition count 403
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 132 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 132 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 131 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 130 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 130 transition count 387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 129 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 128 transition count 353
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 128 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 93 place count 128 transition count 332
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 128 transition count 328
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 103 place count 124 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 124 transition count 322
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 124 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 122 transition count 320
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 122 transition count 320
Applied a total of 117 rules in 51 ms. Remains 122 /167 variables (removed 45) and now considering 320/606 (removed 286) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:04:26] [INFO ] Flow matrix only has 316 transitions (discarded 4 similar events)
// Phase 1: matrix 316 rows 122 cols
[2025-05-31 01:04:26] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:04:26] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:04:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 01:04:26] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:04:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 01:04:26] [INFO ] After 31ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:26] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:26] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 6 ms to minimize.
[2025-05-31 01:04:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
TRAPS : Iteration 1
[2025-05-31 01:04:26] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:04:26] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 559 ms.
RANDOM walk for 40000 steps (919 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (199 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 657745 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 657745 steps, saw 170183 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2025-05-31 01:04:29] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:04:29] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:04:29] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 165/194 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 642/836 variables, 177/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 87/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/840 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/26 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/194 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:30] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:30] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:30] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:31] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 642/836 variables, 177/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 87/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:31] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 28 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/840 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/840 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/840 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2308ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 184 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 183 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 183 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 182 transition count 660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 181 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 181 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 180 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 179 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 179 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 178 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 178 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 177 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 177 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 176 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 176 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 175 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 175 transition count 632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 174 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 174 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 173 transition count 623
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 173 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 172 transition count 621
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 172 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 171 transition count 614
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 171 transition count 614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 170 transition count 612
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 170 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 169 transition count 608
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 169 transition count 608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 168 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 168 transition count 606
Applied a total of 35 rules in 84 ms. Remains 168 /186 variables (removed 18) and now considering 606/663 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 168/186 places, 606/663 transitions.
RANDOM walk for 40000 steps (894 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 633063 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 633063 steps, saw 164590 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2025-05-31 01:04:35] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
// Phase 1: matrix 597 rows 168 cols
[2025-05-31 01:04:35] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:04:35] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 149/176 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 585/761 variables, 159/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/761 variables, 82/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/761 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/765 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/765 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/765 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:35] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:36] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 585/761 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/761 variables, 82/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/765 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/765 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/765 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 606/606 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 168/168 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 606/606 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2025-05-31 01:04:36] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:04:36] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-05-31 01:04:36] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:04:37] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-31 01:04:38] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:04:38] [INFO ] Redundant transitions in 12 ms returned []
Running 598 sub problems to find dead transitions.
[2025-05-31 01:04:38] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2025-05-31 01:04:38] [INFO ] Invariant cache hit.
[2025-05-31 01:04:38] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:48] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:48] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:48] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:48] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:48] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:49] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:49] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:50] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:51] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:51] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:52] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:52] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/765 variables, and 271 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 597/764 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 82/271 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 590/861 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/765 variables, and 861 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/168 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 590/598 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61904 ms. Remains : 168/168 places, 606/606 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 168 vertex of which 33 / 168 are part of one of the 6 SCC in 4 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 138 transition count 441
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 138 transition count 441
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 138 transition count 430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 137 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 137 transition count 407
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 137 transition count 403
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 133 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 133 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 132 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 131 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 131 transition count 387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 130 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 129 transition count 353
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 129 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 93 place count 129 transition count 332
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 129 transition count 328
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 103 place count 125 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 125 transition count 322
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 125 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 123 transition count 320
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 123 transition count 320
Applied a total of 117 rules in 76 ms. Remains 123 /168 variables (removed 45) and now considering 320/606 (removed 286) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:05:38] [INFO ] Flow matrix only has 316 transitions (discarded 4 similar events)
// Phase 1: matrix 316 rows 123 cols
[2025-05-31 01:05:38] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:05:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:05:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 01:05:38] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:05:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-31 01:05:38] [INFO ] After 28ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:38] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
[2025-05-31 01:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
TRAPS : Iteration 1
[2025-05-31 01:05:38] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:05:39] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 472 ms.
RANDOM walk for 40000 steps (917 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (186 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 646976 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 646976 steps, saw 167969 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
[2025-05-31 01:05:42] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:05:42] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:05:42] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:43] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/840 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 182 transition count 661
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 182 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 180 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 180 transition count 659
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 659
Applied a total of 10 rules in 40 ms. Remains 180 /186 variables (removed 6) and now considering 659/663 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 180/186 places, 659/663 transitions.
RANDOM walk for 40000 steps (912 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (196 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 653728 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 653728 steps, saw 169343 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :0
[2025-05-31 01:05:46] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
// Phase 1: matrix 650 rows 180 cols
[2025-05-31 01:05:46] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:05:46] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 650/818 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/830 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/830 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:46] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 650/818 variables, 168/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 87/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:47] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/830 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 659/659 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 180/180 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 659/659 transitions.
Applied a total of 0 rules in 8 ms. Remains 180 /180 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2025-05-31 01:05:47] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:47] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-31 01:05:47] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:48] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 01:05:49] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:05:49] [INFO ] Redundant transitions in 9 ms returned []
Running 651 sub problems to find dead transitions.
[2025-05-31 01:05:49] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:05:49] [INFO ] Invariant cache hit.
[2025-05-31 01:05:49] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:58] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:58] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:58] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:58] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:59] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:05:59] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:00] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:01] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:02] [INFO ] Deduced a trap composed of 97 places in 273 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:02] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:03] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 650/830 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 87/288 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 830/830 variables, and 288 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 650/830 variables, 180/201 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 87/288 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/830 variables, 651/939 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/830 variables, and 939 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62059 ms. Remains : 180/180 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 180 vertex of which 33 / 180 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 494
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 149 transition count 460
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 149 transition count 456
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 145 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 145 transition count 454
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 144 transition count 454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 143 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 143 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 142 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 141 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 141 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 141 transition count 374
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 141 transition count 370
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 108 place count 137 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 137 transition count 364
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 137 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 135 transition count 362
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 121 place count 135 transition count 362
Applied a total of 121 rules in 54 ms. Remains 135 /180 variables (removed 45) and now considering 362/659 (removed 297) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:06:49] [INFO ] Flow matrix only has 358 transitions (discarded 4 similar events)
// Phase 1: matrix 358 rows 135 cols
[2025-05-31 01:06:49] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:06:49] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:06:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 01:06:50] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:06:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:06:50] [INFO ] After 53ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:06:50] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:06:50] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 426 ms.
RANDOM walk for 40000 steps (931 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (197 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 593728 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 593728 steps, saw 154932 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2025-05-31 01:06:53] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:06:53] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:06:53] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:53] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 654/824 variables, 170/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 87/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/840 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1019ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 665
Applied a total of 9 rules in 26 ms. Remains 180 /186 variables (removed 6) and now considering 665/663 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 180/186 places, 665/663 transitions.
RANDOM walk for 40000 steps (925 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (185 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 609052 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 609052 steps, saw 158765 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2025-05-31 01:06:57] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
// Phase 1: matrix 656 rows 180 cols
[2025-05-31 01:06:57] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:06:57] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 656/824 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/836 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/836 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:57] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:58] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 656/824 variables, 168/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 88/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:06:58] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 29 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/824 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/836 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/836 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 665/665 transitions.
Applied a total of 0 rules in 16 ms. Remains 180 /180 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 180/180 places, 665/665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 665/665 transitions.
Applied a total of 0 rules in 13 ms. Remains 180 /180 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2025-05-31 01:06:59] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
[2025-05-31 01:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:59] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-05-31 01:06:59] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
[2025-05-31 01:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:59] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-31 01:07:00] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:07:00] [INFO ] Redundant transitions in 17 ms returned []
Running 657 sub problems to find dead transitions.
[2025-05-31 01:07:00] [INFO ] Flow matrix only has 656 transitions (discarded 9 similar events)
[2025-05-31 01:07:00] [INFO ] Invariant cache hit.
[2025-05-31 01:07:00] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:14] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:14] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:14] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:15] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:15] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:16] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:16] [INFO ] Deduced a trap composed of 98 places in 312 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:16] [INFO ] Deduced a trap composed of 97 places in 271 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:17] [INFO ] Deduced a trap composed of 97 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:17] [INFO ] Deduced a trap composed of 97 places in 297 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:17] [INFO ] Deduced a trap composed of 97 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:18] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:20] [INFO ] Deduced a trap composed of 51 places in 319 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:21] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:22] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:23] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:26] [INFO ] Deduced a trap composed of 61 places in 334 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/836 variables, and 27 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/180 constraints, ReadFeed: 0/88 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 4 (OVERLAPS) 656/836 variables, 180/207 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 88/295 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 657/952 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/836 variables, and 952 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60787ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 60790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62648 ms. Remains : 180/180 places, 665/665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 180 vertex of which 33 / 180 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 500
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 150 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 149 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 149 transition count 466
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 149 transition count 462
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 145 transition count 461
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 145 transition count 460
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 144 transition count 460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 143 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 143 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 142 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 141 transition count 405
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 141 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 99 place count 141 transition count 378
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 141 transition count 374
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 109 place count 137 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 137 transition count 368
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 137 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 135 transition count 366
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 124 place count 135 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 135 transition count 365
Applied a total of 125 rules in 64 ms. Remains 135 /180 variables (removed 45) and now considering 365/665 (removed 300) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:08:01] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
// Phase 1: matrix 361 rows 135 cols
[2025-05-31 01:08:01] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:08:01] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:08:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-31 01:08:02] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:08:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:08:02] [INFO ] After 50ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:08:02] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:08:02] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 412 ms.
RANDOM walk for 40000 steps (907 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571436 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571436 steps, saw 148967 distinct states, run finished after 3004 ms. (steps per millisecond=190 ) properties seen :0
[2025-05-31 01:08:05] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:08:05] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:08:05] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Applied a total of 9 rules in 25 ms. Remains 180 /186 variables (removed 6) and now considering 659/663 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 180/186 places, 659/663 transitions.
RANDOM walk for 40000 steps (902 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (185 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571018 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571018 steps, saw 148839 distinct states, run finished after 3004 ms. (steps per millisecond=190 ) properties seen :0
[2025-05-31 01:08:09] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
// Phase 1: matrix 650 rows 180 cols
[2025-05-31 01:08:09] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:08:09] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 650/818 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/830 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/830 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:10] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 650/818 variables, 168/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 87/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:10] [INFO ] Deduced a trap composed of 16 places in 323 ms of which 31 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/830 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/830 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 659/659 transitions.
Applied a total of 0 rules in 13 ms. Remains 180 /180 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 180/180 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 659/659 transitions.
Applied a total of 0 rules in 12 ms. Remains 180 /180 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2025-05-31 01:08:11] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:08:11] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-05-31 01:08:11] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:08:11] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 01:08:12] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:08:12] [INFO ] Redundant transitions in 13 ms returned []
Running 651 sub problems to find dead transitions.
[2025-05-31 01:08:12] [INFO ] Flow matrix only has 650 transitions (discarded 9 similar events)
[2025-05-31 01:08:12] [INFO ] Invariant cache hit.
[2025-05-31 01:08:12] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:25] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:26] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:27] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:27] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:27] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:30] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:31] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:31] [INFO ] Deduced a trap composed of 97 places in 249 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:32] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:33] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/830 variables, and 22 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/180 constraints, ReadFeed: 0/87 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 650/830 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 87/289 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/830 variables, 651/940 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/830 variables, and 940 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60772ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62073 ms. Remains : 180/180 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 180 vertex of which 33 / 180 are part of one of the 6 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 494
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 149 transition count 460
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 149 transition count 456
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 145 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 145 transition count 454
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 144 transition count 454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 143 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 143 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 142 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 141 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 141 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 141 transition count 374
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 141 transition count 370
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 108 place count 137 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 137 transition count 364
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 137 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 135 transition count 362
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 135 transition count 362
Applied a total of 122 rules in 83 ms. Remains 135 /180 variables (removed 45) and now considering 362/659 (removed 297) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:09:13] [INFO ] Flow matrix only has 358 transitions (discarded 4 similar events)
// Phase 1: matrix 358 rows 135 cols
[2025-05-31 01:09:13] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:09:13] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:09:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 01:09:13] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:09:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:09:13] [INFO ] After 53ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:09:13] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:09:13] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 527 ms.
RANDOM walk for 40000 steps (884 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 569525 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569525 steps, saw 148265 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-05-31 01:09:16] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:09:16] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:09:16] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Applied a total of 11 rules in 25 ms. Remains 179 /186 variables (removed 7) and now considering 658/663 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 179/186 places, 658/663 transitions.
RANDOM walk for 40000 steps (923 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (191 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 595154 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 595154 steps, saw 155303 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2025-05-31 01:09:20] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
// Phase 1: matrix 649 rows 179 cols
[2025-05-31 01:09:20] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:09:20] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 649/816 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 87/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/828 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/828 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/828 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:21] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 649/816 variables, 167/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 87/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/828 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/828 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/828 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 658/658 transitions.
Applied a total of 0 rules in 13 ms. Remains 179 /179 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 179/179 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 658/658 transitions.
Applied a total of 0 rules in 12 ms. Remains 179 /179 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2025-05-31 01:09:22] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
[2025-05-31 01:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:22] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-05-31 01:09:22] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
[2025-05-31 01:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:22] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-31 01:09:24] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:09:24] [INFO ] Redundant transitions in 16 ms returned []
Running 650 sub problems to find dead transitions.
[2025-05-31 01:09:24] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
[2025-05-31 01:09:24] [INFO ] Invariant cache hit.
[2025-05-31 01:09:24] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:38] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:38] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:38] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:39] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:39] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:39] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:42] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:43] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:44] [INFO ] Deduced a trap composed of 96 places in 300 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:44] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:45] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/828 variables, and 21 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/179 constraints, ReadFeed: 0/87 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 649/828 variables, 179/200 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 87/287 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 650/937 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 937 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60757ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62895 ms. Remains : 179/179 places, 658/658 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 179 vertex of which 33 / 179 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 493
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 149 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 148 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 148 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 148 transition count 455
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 144 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 144 transition count 453
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 143 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 142 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 69 place count 142 transition count 438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 141 transition count 437
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 140 transition count 398
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 140 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 99 place count 140 transition count 372
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 140 transition count 368
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 109 place count 136 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 136 transition count 362
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 136 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 134 transition count 360
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 123 place count 134 transition count 360
Applied a total of 123 rules in 51 ms. Remains 134 /179 variables (removed 45) and now considering 360/658 (removed 298) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:10:25] [INFO ] Flow matrix only has 356 transitions (discarded 4 similar events)
// Phase 1: matrix 356 rows 134 cols
[2025-05-31 01:10:25] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:10:25] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:10:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 01:10:25] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:10:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:10:25] [INFO ] After 45ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:25] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:25] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 4 ms to minimize.
[2025-05-31 01:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
TRAPS : Iteration 1
[2025-05-31 01:10:25] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:10:25] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 663 ms.
RANDOM walk for 40000 steps (897 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 581676 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 1
Probabilistic random walk after 581676 steps, saw 151825 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2025-05-31 01:10:28] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:10:28] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 01:10:28] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 178 transition count 663
Applied a total of 13 rules in 30 ms. Remains 178 /186 variables (removed 8) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 178/186 places, 663/663 transitions.
RANDOM walk for 40000 steps (894 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519282 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519282 steps, saw 135185 distinct states, run finished after 3004 ms. (steps per millisecond=172 ) properties seen :0
[2025-05-31 01:10:33] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 178 cols
[2025-05-31 01:10:33] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:10:33] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/820 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 88/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/832 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/832 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/832 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:33] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 654/820 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/832 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/832 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/832 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 663/663 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 178/178 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 663/663 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2025-05-31 01:10:34] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:10:34] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-05-31 01:10:34] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:10:35] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-05-31 01:10:36] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:10:36] [INFO ] Redundant transitions in 16 ms returned []
Running 655 sub problems to find dead transitions.
[2025-05-31 01:10:36] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
[2025-05-31 01:10:36] [INFO ] Invariant cache hit.
[2025-05-31 01:10:36] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:49] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:50] [INFO ] Deduced a trap composed of 59 places in 329 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:50] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:50] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:50] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:51] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:51] [INFO ] Deduced a trap composed of 95 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:52] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:54] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:55] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:56] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:57] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 178/832 variables, and 22 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/178 constraints, ReadFeed: 0/88 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 654/832 variables, 178/200 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 88/288 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 655/943 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 943 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60786ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62590 ms. Remains : 178/178 places, 663/663 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 178 vertex of which 33 / 178 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 498
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 148 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 147 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 43 place count 147 transition count 463
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 147 transition count 459
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 143 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 143 transition count 457
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 142 transition count 457
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 141 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 75 place count 141 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 140 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 139 transition count 397
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 139 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 105 place count 139 transition count 371
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 139 transition count 367
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 135 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 135 transition count 361
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 135 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 133 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 133 transition count 359
Applied a total of 129 rules in 89 ms. Remains 133 /178 variables (removed 45) and now considering 359/663 (removed 304) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:11:37] [INFO ] Flow matrix only has 355 transitions (discarded 4 similar events)
// Phase 1: matrix 355 rows 133 cols
[2025-05-31 01:11:37] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:11:37] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:11:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 01:11:37] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:11:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:11:37] [INFO ] After 64ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:11:37] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:11:37] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 551 ms.
RANDOM walk for 40000 steps (896 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (195 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 529350 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529350 steps, saw 137652 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2025-05-31 01:11:40] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:11:40] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 01:11:40] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 950ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 178 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 649
Applied a total of 15 rules in 34 ms. Remains 177 /186 variables (removed 9) and now considering 649/663 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 177/186 places, 649/663 transitions.
RANDOM walk for 40000 steps (925 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (183 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 574801 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 574801 steps, saw 150008 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
[2025-05-31 01:11:44] [INFO ] Flow matrix only has 640 transitions (discarded 9 similar events)
// Phase 1: matrix 640 rows 177 cols
[2025-05-31 01:11:44] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:11:44] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 640/805 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 86/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/817 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/817 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/817 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:45] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 640/805 variables, 165/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 86/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/805 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/817 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/817 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/817 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 649/649 transitions.
Applied a total of 0 rules in 13 ms. Remains 177 /177 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 177/177 places, 649/649 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2025-05-31 01:11:46] [INFO ] Flow matrix only has 640 transitions (discarded 9 similar events)
[2025-05-31 01:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:11:46] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-05-31 01:11:46] [INFO ] Flow matrix only has 640 transitions (discarded 9 similar events)
[2025-05-31 01:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:11:46] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-31 01:11:47] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:11:47] [INFO ] Redundant transitions in 9 ms returned []
Running 641 sub problems to find dead transitions.
[2025-05-31 01:11:47] [INFO ] Flow matrix only has 640 transitions (discarded 9 similar events)
[2025-05-31 01:11:47] [INFO ] Invariant cache hit.
[2025-05-31 01:11:47] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:00] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:00] [INFO ] Deduced a trap composed of 59 places in 310 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:01] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:01] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:01] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:02] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:02] [INFO ] Deduced a trap composed of 95 places in 291 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:02] [INFO ] Deduced a trap composed of 95 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:03] [INFO ] Deduced a trap composed of 95 places in 282 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:03] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:03] [INFO ] Deduced a trap composed of 95 places in 264 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:04] [INFO ] Deduced a trap composed of 95 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:04] [INFO ] Deduced a trap composed of 95 places in 281 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:04] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:06] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:07] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:08] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:09] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 177/817 variables, and 28 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/177 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (OVERLAPS) 640/817 variables, 177/205 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 86/291 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 641/932 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/817 variables, and 932 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60673ms problems are : Problem set: 0 solved, 641 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62339 ms. Remains : 177/177 places, 649/649 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 177 vertex of which 33 / 177 are part of one of the 6 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 484
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 147 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 146 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 146 transition count 450
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 146 transition count 446
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 142 transition count 445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 142 transition count 444
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 141 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 140 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 140 transition count 430
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 139 transition count 429
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 138 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 138 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 97 place count 138 transition count 366
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 138 transition count 362
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 134 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 134 transition count 356
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 134 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 132 transition count 354
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 121 place count 132 transition count 354
Applied a total of 121 rules in 67 ms. Remains 132 /177 variables (removed 45) and now considering 354/649 (removed 295) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:12:48] [INFO ] Flow matrix only has 350 transitions (discarded 4 similar events)
// Phase 1: matrix 350 rows 132 cols
[2025-05-31 01:12:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:12:48] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:12:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 01:12:48] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:12:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:12:48] [INFO ] After 53ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:12:49] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:12:49] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 484 ms.
RANDOM walk for 40000 steps (913 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (179 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 534523 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 534523 steps, saw 139150 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2025-05-31 01:12:52] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:12:52] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 01:12:52] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 178 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 176 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 176 transition count 647
Applied a total of 17 rules in 41 ms. Remains 176 /186 variables (removed 10) and now considering 647/663 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 176/186 places, 647/663 transitions.
RANDOM walk for 40000 steps (890 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (197 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527780 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527780 steps, saw 137049 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2025-05-31 01:12:56] [INFO ] Flow matrix only has 638 transitions (discarded 9 similar events)
// Phase 1: matrix 638 rows 176 cols
[2025-05-31 01:12:56] [INFO ] Computed 10 invariants in 17 ms
[2025-05-31 01:12:56] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 638/802 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 86/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/814 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/814 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:56] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:56] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 638/802 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 86/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/814 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/814 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/814 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 647/647 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 647/647 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 176/176 places, 647/647 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 647/647 transitions.
Applied a total of 0 rules in 13 ms. Remains 176 /176 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2025-05-31 01:12:57] [INFO ] Flow matrix only has 638 transitions (discarded 9 similar events)
[2025-05-31 01:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:12:57] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-31 01:12:57] [INFO ] Flow matrix only has 638 transitions (discarded 9 similar events)
[2025-05-31 01:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:12:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-31 01:12:58] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:12:58] [INFO ] Redundant transitions in 16 ms returned []
Running 639 sub problems to find dead transitions.
[2025-05-31 01:12:58] [INFO ] Flow matrix only has 638 transitions (discarded 9 similar events)
[2025-05-31 01:12:58] [INFO ] Invariant cache hit.
[2025-05-31 01:12:58] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:11] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:12] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:12] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:12] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:12] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:13] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:13] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:15] [INFO ] Deduced a trap composed of 50 places in 317 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:17] [INFO ] Deduced a trap composed of 94 places in 289 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:18] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:19] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:26] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/814 variables, and 22 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/176 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 638/814 variables, 176/198 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/814 variables, 86/284 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 639/923 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 923 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60782ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62100 ms. Remains : 176/176 places, 647/647 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 176 vertex of which 33 / 176 are part of one of the 6 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 482
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 482
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 146 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 145 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 145 transition count 448
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 145 transition count 444
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 141 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 141 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 140 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 139 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 139 transition count 428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 138 transition count 427
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 137 transition count 389
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 137 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 97 place count 137 transition count 364
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 137 transition count 360
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 133 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 133 transition count 354
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 133 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 131 transition count 352
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 121 place count 131 transition count 352
Applied a total of 121 rules in 47 ms. Remains 131 /176 variables (removed 45) and now considering 352/647 (removed 295) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:13:59] [INFO ] Flow matrix only has 348 transitions (discarded 4 similar events)
// Phase 1: matrix 348 rows 131 cols
[2025-05-31 01:13:59] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:13:59] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:13:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-31 01:13:59] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:13:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:13:59] [INFO ] After 24ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:13:59] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:13:59] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 313 ms.
RANDOM walk for 40000 steps (915 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (180 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 585901 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 585901 steps, saw 152779 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2025-05-31 01:14:02] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:14:02] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:14:02] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 178 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 176 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 176 transition count 647
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 175 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 175 transition count 640
Applied a total of 19 rules in 40 ms. Remains 175 /186 variables (removed 11) and now considering 640/663 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 175/186 places, 640/663 transitions.
RANDOM walk for 40000 steps (905 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (174 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487936 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487936 steps, saw 127876 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2025-05-31 01:14:07] [INFO ] Flow matrix only has 631 transitions (discarded 9 similar events)
// Phase 1: matrix 631 rows 175 cols
[2025-05-31 01:14:07] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 01:14:07] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 631/794 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 85/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/806 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/806 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:07] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:08] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 631/794 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 85/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/806 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/806 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 640/640 transitions.
Applied a total of 0 rules in 12 ms. Remains 175 /175 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 175/175 places, 640/640 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 640/640 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2025-05-31 01:14:08] [INFO ] Flow matrix only has 631 transitions (discarded 9 similar events)
[2025-05-31 01:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:14:09] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-05-31 01:14:09] [INFO ] Flow matrix only has 631 transitions (discarded 9 similar events)
[2025-05-31 01:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:14:09] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-31 01:14:10] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:14:10] [INFO ] Redundant transitions in 12 ms returned []
Running 632 sub problems to find dead transitions.
[2025-05-31 01:14:10] [INFO ] Flow matrix only has 631 transitions (discarded 9 similar events)
[2025-05-31 01:14:10] [INFO ] Invariant cache hit.
[2025-05-31 01:14:10] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:23] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:24] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:24] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:24] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:24] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:25] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:25] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:27] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:29] [INFO ] Deduced a trap composed of 94 places in 301 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:30] [INFO ] Deduced a trap composed of 40 places in 306 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:30] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:31] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/806 variables, and 22 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/175 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 631/806 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 85/282 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 632/914 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 914 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60865ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62536 ms. Remains : 175/175 places, 640/640 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 175 vertex of which 33 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 162 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 475
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 18 place count 145 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 144 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 144 transition count 441
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 144 transition count 437
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 140 transition count 436
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 140 transition count 435
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 139 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 138 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 138 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 137 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 136 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 136 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 136 transition count 359
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 136 transition count 355
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 132 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 132 transition count 349
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 132 transition count 347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 130 transition count 347
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 130 transition count 347
Applied a total of 120 rules in 55 ms. Remains 130 /175 variables (removed 45) and now considering 347/640 (removed 293) transitions.
Running SMT prover for 1 properties.
[2025-05-31 01:15:11] [INFO ] Flow matrix only has 343 transitions (discarded 4 similar events)
// Phase 1: matrix 343 rows 130 cols
[2025-05-31 01:15:11] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:15:11] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 01:15:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 01:15:11] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 01:15:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-31 01:15:11] [INFO ] After 35ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 01:15:11] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 01:15:11] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 402 ms.
RANDOM walk for 40000 steps (903 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 515855 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 515855 steps, saw 134579 distinct states, run finished after 3004 ms. (steps per millisecond=171 ) properties seen :0
[2025-05-31 01:15:14] [INFO ] Flow matrix only has 654 transitions (discarded 9 similar events)
// Phase 1: matrix 654 rows 186 cols
[2025-05-31 01:15:14] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 01:15:14] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/840 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/840 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 654/824 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/840 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 186/186 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1036ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 663/663 transitions.
Graph (complete) has 1050 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 183 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 181 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 181 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 180 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 179 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 179 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 178 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 176 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 176 transition count 647
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 175 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 175 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 174 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 174 transition count 638
Applied a total of 21 rules in 41 ms. Remains 174 /186 variables (removed 12) and now considering 638/663 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 174/186 places, 638/663 transitions.
RANDOM walk for 40000 steps (910 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (198 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 578223 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 578223 steps, saw 150843 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2025-05-31 01:15:19] [INFO ] Flow matrix only has 629 transitions (discarded 9 similar events)
// Phase 1: matrix 629 rows 174 cols
[2025-05-31 01:15:19] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 01:15:19] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 629/791 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/791 variables, 85/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/791 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/803 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/803 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/803 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 803/803 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:19] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:19] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/791 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/791 variables, 85/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:20] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 30 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/791 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/803 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/803 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/803 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 803/803 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 638/638 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 174/174 places, 638/638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 638/638 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2025-05-31 01:15:20] [INFO ] Flow matrix only has 629 transitions (discarded 9 similar events)
[2025-05-31 01:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:15:20] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-05-31 01:15:20] [INFO ] Flow matrix only has 629 transitions (discarded 9 similar events)
[2025-05-31 01:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:15:21] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-31 01:15:22] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:15:22] [INFO ] Redundant transitions in 19 ms returned []
Running 630 sub problems to find dead transitions.
[2025-05-31 01:15:22] [INFO ] Flow matrix only has 629 transitions (discarded 9 similar events)
[2025-05-31 01:15:22] [INFO ] Invariant cache hit.
[2025-05-31 01:15:22] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:35] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:35] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:35] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:35] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:35] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:36] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:36] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:36] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:37] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:37] [INFO ] Deduced a trap composed of 93 places in 260 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:37] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:37] [INFO ] Deduced a trap composed of 93 places in 272 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:38] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:38] [INFO ] Deduced a trap composed of 93 places in 272 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:38] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:41] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:42] [INFO ] Deduced a trap composed of 39 places in 307 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:43] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:15:44] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/803 variables, and 29 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/174 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 629/803 variables, 174/203 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 85/288 constraints. Problems are: Problem set: 0 solved, 630 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="FireWire-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-20, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-smll-174860108100248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;