About the Execution of GreatSPN+red for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1041.228 | 316767.00 | 380041.00 | 959.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898300309.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300309
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717373428209
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:10:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-03 00:10:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:10:29] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-03 00:10:29] [INFO ] Transformed 437 places.
[2024-06-03 00:10:29] [INFO ] Transformed 707 transitions.
[2024-06-03 00:10:29] [INFO ] Found NUPN structural information;
[2024-06-03 00:10:29] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 707 rows 437 cols
[2024-06-03 00:10:29] [INFO ] Computed 9 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (5 resets) in 38 ms. (256 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130000 steps (45 resets) in 261 ms. (496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 00:10:29] [INFO ] Invariant cache hit.
[2024-06-03 00:10:30] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-06-03 00:10:30] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-06-03 00:10:30] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 15 ms to minimize.
[2024-06-03 00:10:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:10:31] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-06-03 00:10:31] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-06-03 00:10:31] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 51 ms.
Maximisation of solution failed !
Minimization took 10 ms.
[2024-06-03 00:10:35] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:10:36] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-03 00:10:36] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-06-03 00:10:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:10:36] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-03 00:10:36] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-06-03 00:10:36] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 3 ms to minimize.
[2024-06-03 00:10:37] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:10:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 573 ms
[2024-06-03 00:10:37] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 43 ms.
[2024-06-03 00:10:41] [INFO ] Added : 460 causal constraints over 92 iterations in 4186 ms. Result :unknown
[2024-06-03 00:10:41] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:41] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-03 00:10:41] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 40 ms.
[2024-06-03 00:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:42] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-03 00:10:42] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 41 ms.
[2024-06-03 00:10:46] [INFO ] Added : 463 causal constraints over 93 iterations in 4591 ms. Result :sat
Minimization took 136 ms.
[2024-06-03 00:10:46] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:47] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-03 00:10:47] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-06-03 00:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:10:47] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-03 00:10:47] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-06-03 00:10:47] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-06-03 00:10:48] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 4 ms to minimize.
[2024-06-03 00:10:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2024-06-03 00:10:48] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 31 ms.
[2024-06-03 00:10:52] [INFO ] Added : 465 causal constraints over 93 iterations in 4253 ms. Result :unknown
[2024-06-03 00:10:52] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:52] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-03 00:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:52] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-03 00:10:53] [INFO ] Deduced a trap composed of 247 places in 158 ms of which 3 ms to minimize.
[2024-06-03 00:10:53] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 3 ms to minimize.
[2024-06-03 00:10:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2024-06-03 00:10:53] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-03 00:10:57] [INFO ] Added : 460 causal constraints over 92 iterations in 4328 ms. Result :unknown
[2024-06-03 00:10:57] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:10:57] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-03 00:10:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:10:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:10:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2024-06-03 00:10:58] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 33 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-03 00:11:02] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-03 00:11:03] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-03 00:11:03] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 3 ms to minimize.
[2024-06-03 00:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:03] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-03 00:11:03] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 4 ms to minimize.
[2024-06-03 00:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-03 00:11:03] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 47 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-03 00:11:08] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:08] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-06-03 00:11:08] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:11:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:09] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 3 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-06-03 00:11:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 687 ms
[2024-06-03 00:11:09] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-03 00:11:13] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-03 00:11:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:14] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2024-06-03 00:11:14] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 35 ms.
[2024-06-03 00:11:19] [INFO ] Deduced a trap composed of 128 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-06-03 00:11:19] [INFO ] Added : 435 causal constraints over 87 iterations in 4252 ms. Result :sat
Minimization took 162 ms.
[2024-06-03 00:11:19] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:19] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-03 00:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:19] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-03 00:11:20] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-06-03 00:11:20] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-06-03 00:11:20] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 3 ms to minimize.
[2024-06-03 00:11:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2024-06-03 00:11:20] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 34 ms.
[2024-06-03 00:11:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:11:24] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-03 00:11:24] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:25] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-06-03 00:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2024-06-03 00:11:25] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 37 ms.
[2024-06-03 00:11:30] [INFO ] Added : 475 causal constraints over 96 iterations in 4436 ms. Result :unknown
[2024-06-03 00:11:30] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-03 00:11:30] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-03 00:11:30] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-06-03 00:11:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:30] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-03 00:11:30] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:11:31] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-06-03 00:11:31] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:11:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2024-06-03 00:11:31] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 36 ms.
[2024-06-03 00:11:35] [INFO ] Added : 442 causal constraints over 89 iterations in 4021 ms. Result :sat
Minimization took 244 ms.
[2024-06-03 00:11:35] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:35] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-03 00:11:35] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-03 00:11:36] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:11:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2024-06-03 00:11:36] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 32 ms.
[2024-06-03 00:11:41] [INFO ] Added : 460 causal constraints over 92 iterations in 4418 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 13 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 308 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 418 transition count 612
Reduce places removed 81 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 83 rules applied. Total rules applied 167 place count 337 transition count 610
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 336 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 335 transition count 609
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 170 place count 335 transition count 598
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 192 place count 324 transition count 598
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 250 place count 266 transition count 536
Iterating global reduction 4 with 58 rules applied. Total rules applied 308 place count 266 transition count 536
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 310 place count 266 transition count 534
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 310 place count 266 transition count 530
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 318 place count 262 transition count 530
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 333 place count 247 transition count 473
Iterating global reduction 5 with 15 rules applied. Total rules applied 348 place count 247 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 349 place count 247 transition count 472
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 354 place count 242 transition count 463
Iterating global reduction 6 with 5 rules applied. Total rules applied 359 place count 242 transition count 463
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 6 with 2 rules applied. Total rules applied 361 place count 242 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 362 place count 241 transition count 461
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 364 place count 239 transition count 455
Iterating global reduction 8 with 2 rules applied. Total rules applied 366 place count 239 transition count 455
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 368 place count 237 transition count 451
Iterating global reduction 8 with 2 rules applied. Total rules applied 370 place count 237 transition count 451
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 372 place count 235 transition count 445
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 235 transition count 445
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 375 place count 234 transition count 443
Iterating global reduction 8 with 1 rules applied. Total rules applied 376 place count 234 transition count 443
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 377 place count 233 transition count 440
Iterating global reduction 8 with 1 rules applied. Total rules applied 378 place count 233 transition count 440
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 379 place count 232 transition count 438
Iterating global reduction 8 with 1 rules applied. Total rules applied 380 place count 232 transition count 438
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 381 place count 231 transition count 435
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 231 transition count 435
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 383 place count 230 transition count 433
Iterating global reduction 8 with 1 rules applied. Total rules applied 384 place count 230 transition count 433
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 385 place count 229 transition count 430
Iterating global reduction 8 with 1 rules applied. Total rules applied 386 place count 229 transition count 430
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 387 place count 228 transition count 428
Iterating global reduction 8 with 1 rules applied. Total rules applied 388 place count 228 transition count 428
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 389 place count 227 transition count 426
Iterating global reduction 8 with 1 rules applied. Total rules applied 390 place count 227 transition count 426
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 391 place count 226 transition count 424
Iterating global reduction 8 with 1 rules applied. Total rules applied 392 place count 226 transition count 424
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 460 place count 192 transition count 390
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 516 place count 164 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 518 place count 164 transition count 479
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 538 place count 164 transition count 459
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 563 place count 144 transition count 454
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 567 place count 140 transition count 450
Iterating global reduction 9 with 4 rules applied. Total rules applied 571 place count 140 transition count 450
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 579 place count 140 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 595 place count 140 transition count 426
Applied a total of 595 rules in 262 ms. Remains 140 /437 variables (removed 297) and now considering 426/707 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 140/437 places, 426/707 transitions.
[2024-06-03 00:11:43] [INFO ] Flow matrix only has 416 transitions (discarded 10 similar events)
// Phase 1: matrix 416 rows 140 cols
[2024-06-03 00:11:43] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (45655 resets) in 1665 ms. (600 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (43680 resets) in 1902 ms. (2101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-03 00:11:46] [INFO ] Flow matrix only has 416 transitions (discarded 10 similar events)
[2024-06-03 00:11:46] [INFO ] Invariant cache hit.
[2024-06-03 00:11:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-03 00:11:46] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-03 00:11:46] [INFO ] [Real]Added 66 Read/Feed constraints in 23 ms returned sat
[2024-06-03 00:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:46] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-03 00:11:47] [INFO ] [Nat]Added 66 Read/Feed constraints in 37 ms returned sat
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-06-03 00:11:47] [INFO ] Computed and/alt/rep : 162/874/162 causal constraints (skipped 250 transitions) in 22 ms.
[2024-06-03 00:11:47] [INFO ] Added : 47 causal constraints over 13 iterations in 321 ms. Result :sat
Minimization took 150 ms.
[2024-06-03 00:11:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:47] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-03 00:11:47] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2024-06-03 00:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:47] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-03 00:11:47] [INFO ] [Nat]Added 66 Read/Feed constraints in 32 ms returned sat
[2024-06-03 00:11:47] [INFO ] Computed and/alt/rep : 162/874/162 causal constraints (skipped 250 transitions) in 24 ms.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2024-06-03 00:11:48] [INFO ] Added : 53 causal constraints over 12 iterations in 580 ms. Result :sat
Minimization took 144 ms.
[2024-06-03 00:11:48] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:11:48] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-03 00:11:48] [INFO ] [Real]Added 66 Read/Feed constraints in 30 ms returned sat
[2024-06-03 00:11:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:48] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-03 00:11:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 39 ms returned sat
[2024-06-03 00:11:49] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:11:49] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:11:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-06-03 00:11:49] [INFO ] Computed and/alt/rep : 162/874/162 causal constraints (skipped 250 transitions) in 24 ms.
[2024-06-03 00:11:49] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-06-03 00:11:49] [INFO ] Added : 45 causal constraints over 12 iterations in 402 ms. Result :sat
Minimization took 136 ms.
[2024-06-03 00:11:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:49] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-03 00:11:49] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2024-06-03 00:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:49] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-03 00:11:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2024-06-03 00:11:50] [INFO ] Computed and/alt/rep : 162/874/162 causal constraints (skipped 250 transitions) in 35 ms.
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-06-03 00:11:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2024-06-03 00:11:50] [INFO ] Added : 70 causal constraints over 20 iterations in 837 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 426/426 transitions.
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 2 place count 140 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 139 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 139 transition count 422
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 137 transition count 422
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 134 transition count 418
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 134 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 133 transition count 415
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 133 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 132 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 132 transition count 413
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 131 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 131 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 130 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 130 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 129 transition count 405
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 129 transition count 405
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 128 transition count 403
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 128 transition count 403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 127 transition count 401
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 127 transition count 401
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 126 transition count 399
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 126 transition count 399
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 124 transition count 397
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 124 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 40 place count 123 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 3 with 74 rules applied. Total rules applied 114 place count 123 transition count 320
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 123 transition count 319
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 122 transition count 316
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 122 transition count 316
Applied a total of 121 rules in 58 ms. Remains 122 /140 variables (removed 18) and now considering 316/426 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 122/140 places, 316/426 transitions.
[2024-06-03 00:11:51] [INFO ] Flow matrix only has 285 transitions (discarded 31 similar events)
// Phase 1: matrix 285 rows 122 cols
[2024-06-03 00:11:51] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (51032 resets) in 1184 ms. (843 steps per ms)
BEST_FIRST walk for 4000004 steps (51318 resets) in 1748 ms. (2287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-03 00:11:54] [INFO ] Flow matrix only has 285 transitions (discarded 31 similar events)
[2024-06-03 00:11:54] [INFO ] Invariant cache hit.
[2024-06-03 00:11:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-03 00:11:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-03 00:11:54] [INFO ] [Real]Added 64 Read/Feed constraints in 17 ms returned sat
[2024-06-03 00:11:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Nat]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:11:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-06-03 00:11:54] [INFO ] Computed and/alt/rep : 130/746/130 causal constraints (skipped 151 transitions) in 15 ms.
[2024-06-03 00:11:54] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2024-06-03 00:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-03 00:11:54] [INFO ] Added : 10 causal constraints over 4 iterations in 176 ms. Result :sat
Minimization took 92 ms.
[2024-06-03 00:11:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Real]Added 64 Read/Feed constraints in 14 ms returned sat
[2024-06-03 00:11:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-03 00:11:54] [INFO ] [Nat]Added 64 Read/Feed constraints in 26 ms returned sat
[2024-06-03 00:11:54] [INFO ] Computed and/alt/rep : 130/746/130 causal constraints (skipped 151 transitions) in 21 ms.
[2024-06-03 00:11:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:11:55] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-03 00:11:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-06-03 00:11:55] [INFO ] Added : 32 causal constraints over 9 iterations in 324 ms. Result :sat
Minimization took 97 ms.
[2024-06-03 00:11:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-03 00:11:55] [INFO ] [Real]Added 64 Read/Feed constraints in 23 ms returned sat
[2024-06-03 00:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:55] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-03 00:11:55] [INFO ] [Nat]Added 64 Read/Feed constraints in 25 ms returned sat
[2024-06-03 00:11:55] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:11:55] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:11:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:11:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2024-06-03 00:11:55] [INFO ] Computed and/alt/rep : 130/746/130 causal constraints (skipped 151 transitions) in 15 ms.
[2024-06-03 00:11:56] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 8 ms to minimize.
[2024-06-03 00:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-03 00:11:56] [INFO ] Added : 50 causal constraints over 11 iterations in 326 ms. Result :sat
Minimization took 116 ms.
[2024-06-03 00:11:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:11:56] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-03 00:11:56] [INFO ] [Real]Added 64 Read/Feed constraints in 15 ms returned sat
[2024-06-03 00:11:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:56] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-03 00:11:56] [INFO ] [Nat]Added 64 Read/Feed constraints in 30 ms returned sat
[2024-06-03 00:11:56] [INFO ] Computed and/alt/rep : 130/746/130 causal constraints (skipped 151 transitions) in 20 ms.
[2024-06-03 00:11:56] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:11:56] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:11:56] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:11:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2024-06-03 00:11:56] [INFO ] Added : 24 causal constraints over 6 iterations in 409 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 316/316 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 313
Applied a total of 4 rules in 10 ms. Remains 120 /122 variables (removed 2) and now considering 313/316 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 120/122 places, 313/316 transitions.
[2024-06-03 00:11:57] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
// Phase 1: matrix 282 rows 120 cols
[2024-06-03 00:11:57] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (51022 resets) in 1198 ms. (834 steps per ms)
BEST_FIRST walk for 3000002 steps (38451 resets) in 1253 ms. (2392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-03 00:11:59] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:11:59] [INFO ] Invariant cache hit.
[2024-06-03 00:11:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-03 00:11:59] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-03 00:11:59] [INFO ] [Real]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:11:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:11:59] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-03 00:11:59] [INFO ] [Nat]Added 64 Read/Feed constraints in 17 ms returned sat
[2024-06-03 00:11:59] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-03 00:11:59] [INFO ] Computed and/alt/rep : 128/741/128 causal constraints (skipped 150 transitions) in 14 ms.
[2024-06-03 00:12:00] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-06-03 00:12:00] [INFO ] Added : 28 causal constraints over 8 iterations in 226 ms. Result :sat
Minimization took 104 ms.
[2024-06-03 00:12:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-03 00:12:00] [INFO ] [Real]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:00] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-03 00:12:00] [INFO ] [Nat]Added 64 Read/Feed constraints in 26 ms returned sat
[2024-06-03 00:12:00] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:12:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:12:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-06-03 00:12:00] [INFO ] Computed and/alt/rep : 128/741/128 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-03 00:12:00] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-03 00:12:00] [INFO ] Added : 30 causal constraints over 6 iterations in 199 ms. Result :sat
Minimization took 105 ms.
[2024-06-03 00:12:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:12:01] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-03 00:12:01] [INFO ] [Real]Added 64 Read/Feed constraints in 13 ms returned sat
[2024-06-03 00:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:01] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-03 00:12:01] [INFO ] [Nat]Added 64 Read/Feed constraints in 26 ms returned sat
[2024-06-03 00:12:01] [INFO ] Computed and/alt/rep : 128/741/128 causal constraints (skipped 150 transitions) in 16 ms.
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-03 00:12:01] [INFO ] Added : 28 causal constraints over 7 iterations in 261 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 313/313 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 120/120 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 313/313 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-03 00:12:01] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:12:01] [INFO ] Invariant cache hit.
[2024-06-03 00:12:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-03 00:12:01] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:12:01] [INFO ] Invariant cache hit.
[2024-06-03 00:12:01] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-03 00:12:02] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-03 00:12:02] [INFO ] Redundant transitions in 15 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-03 00:12:02] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:12:02] [INFO ] Invariant cache hit.
[2024-06-03 00:12:02] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 282/402 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 196 constraints, problems are : Problem set: 0 solved, 309 unsolved in 9557 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 282/402 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 309/505 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 00:12:20] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 00:12:24] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-03 00:12:38] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 508 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 8/8 constraints]
After SMT, in 39885ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 39904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40350 ms. Remains : 120/120 places, 313/313 transitions.
[2024-06-03 00:12:42] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:12:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (50960 resets) in 1172 ms. (852 steps per ms)
BEST_FIRST walk for 2000002 steps (25498 resets) in 837 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-03 00:12:44] [INFO ] Flow matrix only has 282 transitions (discarded 31 similar events)
[2024-06-03 00:12:44] [INFO ] Invariant cache hit.
[2024-06-03 00:12:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-03 00:12:44] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-03 00:12:44] [INFO ] [Real]Added 64 Read/Feed constraints in 21 ms returned sat
[2024-06-03 00:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Nat]Added 64 Read/Feed constraints in 20 ms returned sat
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-06-03 00:12:44] [INFO ] Computed and/alt/rep : 128/741/128 causal constraints (skipped 150 transitions) in 13 ms.
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-03 00:12:44] [INFO ] Added : 28 causal constraints over 8 iterations in 221 ms. Result :sat
Minimization took 103 ms.
[2024-06-03 00:12:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Real]Added 64 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-03 00:12:44] [INFO ] [Nat]Added 64 Read/Feed constraints in 26 ms returned sat
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:12:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-03 00:12:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-06-03 00:12:45] [INFO ] Computed and/alt/rep : 128/741/128 causal constraints (skipped 150 transitions) in 16 ms.
[2024-06-03 00:12:45] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-03 00:12:45] [INFO ] Added : 30 causal constraints over 6 iterations in 218 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 313/313 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 309
Applied a total of 4 rules in 7 ms. Remains 118 /120 variables (removed 2) and now considering 309/313 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/120 places, 309/313 transitions.
[2024-06-03 00:12:45] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
// Phase 1: matrix 278 rows 118 cols
[2024-06-03 00:12:45] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (51199 resets) in 1157 ms. (863 steps per ms)
BEST_FIRST walk for 2000002 steps (25533 resets) in 854 ms. (2339 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-03 00:12:47] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:12:47] [INFO ] Invariant cache hit.
[2024-06-03 00:12:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:12:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-03 00:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:47] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-03 00:12:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:12:47] [INFO ] [Nat]Added 63 Read/Feed constraints in 16 ms returned sat
[2024-06-03 00:12:47] [INFO ] Computed and/alt/rep : 125/736/125 causal constraints (skipped 149 transitions) in 16 ms.
[2024-06-03 00:12:47] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:12:47] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2024-06-03 00:12:48] [INFO ] Added : 34 causal constraints over 8 iterations in 381 ms. Result :sat
Minimization took 104 ms.
[2024-06-03 00:12:48] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:48] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-03 00:12:48] [INFO ] [Real]Added 63 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:12:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:12:48] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-03 00:12:48] [INFO ] [Nat]Added 63 Read/Feed constraints in 28 ms returned sat
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2024-06-03 00:12:48] [INFO ] Computed and/alt/rep : 125/736/125 causal constraints (skipped 149 transitions) in 15 ms.
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:12:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-06-03 00:12:49] [INFO ] Added : 55 causal constraints over 13 iterations in 435 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 309/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 309/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-06-03 00:12:49] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:12:49] [INFO ] Invariant cache hit.
[2024-06-03 00:12:49] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-03 00:12:49] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:12:49] [INFO ] Invariant cache hit.
[2024-06-03 00:12:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:12:49] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-03 00:12:49] [INFO ] Redundant transitions in 5 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-03 00:12:49] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:12:49] [INFO ] Invariant cache hit.
[2024-06-03 00:12:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 3 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:12:52] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 278/396 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 195 constraints, problems are : Problem set: 0 solved, 305 unsolved in 8596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 278/396 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 305/500 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 500 constraints, problems are : Problem set: 0 solved, 305 unsolved in 21134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints]
After SMT, in 29901ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 29905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30207 ms. Remains : 118/118 places, 309/309 transitions.
RANDOM walk for 40000 steps (2066 resets) in 789 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (524 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (517 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (504 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (503 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 816193 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :2 out of 4
Probabilistic random walk after 816193 steps, saw 236912 distinct states, run finished after 3003 ms. (steps per millisecond=271 ) properties seen :2
[2024-06-03 00:13:22] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:13:22] [INFO ] Invariant cache hit.
[2024-06-03 00:13:22] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 104/127 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 267/394 variables, 111/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 63/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/396 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/396 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/23 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 104/127 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:13:23] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:13:23] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 267/394 variables, 111/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 63/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:13:23] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/396 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/396 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 309/309 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 307
Applied a total of 2 rules in 5 ms. Remains 117 /118 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 117/118 places, 307/309 transitions.
RANDOM walk for 40000 steps (2050 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (517 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (510 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1019794 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 2
Probabilistic random walk after 1019794 steps, saw 309839 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
[2024-06-03 00:13:26] [INFO ] Flow matrix only has 276 transitions (discarded 31 similar events)
// Phase 1: matrix 276 rows 117 cols
[2024-06-03 00:13:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:13:26] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 103/126 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 265/391 variables, 110/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 63/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/393 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/393 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/23 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 103/126 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 265/391 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:13:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/393 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/393 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/393 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 307/307 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 307/307 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2024-06-03 00:13:27] [INFO ] Flow matrix only has 276 transitions (discarded 31 similar events)
[2024-06-03 00:13:27] [INFO ] Invariant cache hit.
[2024-06-03 00:13:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-03 00:13:27] [INFO ] Flow matrix only has 276 transitions (discarded 31 similar events)
[2024-06-03 00:13:27] [INFO ] Invariant cache hit.
[2024-06-03 00:13:27] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:13:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-03 00:13:27] [INFO ] Redundant transitions in 5 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-03 00:13:27] [INFO ] Flow matrix only has 276 transitions (discarded 31 similar events)
[2024-06-03 00:13:27] [INFO ] Invariant cache hit.
[2024-06-03 00:13:27] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-03 00:13:29] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:13:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 276/393 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 0/393 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 194 constraints, problems are : Problem set: 0 solved, 303 unsolved in 8150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 276/393 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 303/497 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-03 00:13:43] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 498 constraints, problems are : Problem set: 0 solved, 303 unsolved in 28501 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 8/8 constraints]
After SMT, in 36835ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 36839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37118 ms. Remains : 117/117 places, 307/307 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 117 vertex of which 22 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 94 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 12 place count 97 transition count 204
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 14 place count 96 transition count 203
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 16 place count 95 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 95 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 95 transition count 192
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 2 rules applied. Total rules applied 30 place count 95 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 93 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 91 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 38 place count 91 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 41 place count 91 transition count 183
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 5 with 2 rules applied. Total rules applied 43 place count 90 transition count 182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 89 transition count 160
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 89 transition count 160
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 48 place count 89 transition count 157
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 52 place count 86 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 56 place count 86 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 58 place count 86 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 60 place count 84 transition count 150
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 64 place count 84 transition count 150
Applied a total of 64 rules in 52 ms. Remains 84 /117 variables (removed 33) and now considering 150/307 (removed 157) transitions.
Running SMT prover for 2 properties.
[2024-06-03 00:14:04] [INFO ] Flow matrix only has 148 transitions (discarded 2 similar events)
// Phase 1: matrix 148 rows 84 cols
[2024-06-03 00:14:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:14:04] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:14:04] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-03 00:14:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:14:04] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-03 00:14:04] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-03 00:14:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:14:04] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-03 00:14:04] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-03 00:14:04] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-03 00:14:04] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 261 ms.
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for FireWire-PT-18-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-03 00:14:04] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
// Phase 1: matrix 278 rows 118 cols
[2024-06-03 00:14:04] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (496 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (133 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-03 00:14:04] [INFO ] Flow matrix only has 278 transitions (discarded 31 similar events)
[2024-06-03 00:14:04] [INFO ] Invariant cache hit.
[2024-06-03 00:14:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:14:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-03 00:14:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:14:04] [INFO ] [Real]Added 63 Read/Feed constraints in 20 ms returned sat
[2024-06-03 00:14:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:14:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:14:04] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-03 00:14:04] [INFO ] [Nat]Added 63 Read/Feed constraints in 22 ms returned sat
[2024-06-03 00:14:04] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:14:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:14:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2024-06-03 00:14:05] [INFO ] Computed and/alt/rep : 125/736/125 causal constraints (skipped 149 transitions) in 19 ms.
[2024-06-03 00:14:05] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:14:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:14:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2024-06-03 00:14:05] [INFO ] Added : 55 causal constraints over 13 iterations in 461 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 118 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p254) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 308/308 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 306
Applied a total of 2 rules in 5 ms. Remains 117 /118 variables (removed 1) and now considering 306/308 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 117/118 places, 306/308 transitions.
[2024-06-03 00:14:05] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
// Phase 1: matrix 275 rows 117 cols
[2024-06-03 00:14:05] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (51016 resets) in 1095 ms. (912 steps per ms)
BEST_FIRST walk for 1000001 steps (12683 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-03 00:14:07] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:07] [INFO ] Invariant cache hit.
[2024-06-03 00:14:07] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:14:07] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-03 00:14:07] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:14:07] [INFO ] [Real]Added 63 Read/Feed constraints in 19 ms returned sat
[2024-06-03 00:14:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:14:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:14:07] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-03 00:14:07] [INFO ] [Nat]Added 63 Read/Feed constraints in 21 ms returned sat
[2024-06-03 00:14:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:14:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:14:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:14:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2024-06-03 00:14:07] [INFO ] Computed and/alt/rep : 124/730/124 causal constraints (skipped 147 transitions) in 15 ms.
[2024-06-03 00:14:07] [INFO ] Added : 34 causal constraints over 7 iterations in 166 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 117/117 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-03 00:14:07] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:07] [INFO ] Invariant cache hit.
[2024-06-03 00:14:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-03 00:14:08] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:08] [INFO ] Invariant cache hit.
[2024-06-03 00:14:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:14:08] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-03 00:14:08] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-03 00:14:08] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:08] [INFO ] Invariant cache hit.
[2024-06-03 00:14:08] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-03 00:14:09] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:14:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:14:09] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 275/391 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 194 constraints, problems are : Problem set: 0 solved, 302 unsolved in 13516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 275/391 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 295/488 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-03 00:14:26] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 497 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
After SMT, in 43702ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44006 ms. Remains : 117/117 places, 306/306 transitions.
RANDOM walk for 40000 steps (2039 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (509 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (514 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 999122 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 2
Probabilistic random walk after 999122 steps, saw 302837 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2024-06-03 00:14:55] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:55] [INFO ] Invariant cache hit.
[2024-06-03 00:14:55] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 103/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:14:55] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 265/390 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 63/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:14:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/392 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/392 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 103/125 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 265/390 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 63/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/392 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/392 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 117/117 places, 306/306 transitions.
RANDOM walk for 40000 steps (2046 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (520 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (500 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 911015 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 2
Probabilistic random walk after 911015 steps, saw 271777 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
[2024-06-03 00:14:58] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:58] [INFO ] Invariant cache hit.
[2024-06-03 00:14:58] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 103/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 265/390 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 63/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 00:14:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/392 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/392 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/19 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 103/125 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 265/390 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 63/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/392 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/392 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 117/117 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 306/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-03 00:14:59] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:59] [INFO ] Invariant cache hit.
[2024-06-03 00:14:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-03 00:14:59] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:59] [INFO ] Invariant cache hit.
[2024-06-03 00:14:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:14:59] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-03 00:14:59] [INFO ] Redundant transitions in 3 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-03 00:14:59] [INFO ] Flow matrix only has 275 transitions (discarded 31 similar events)
[2024-06-03 00:14:59] [INFO ] Invariant cache hit.
[2024-06-03 00:14:59] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 275/391 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 194 constraints, problems are : Problem set: 0 solved, 302 unsolved in 13437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 275/391 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 295/488 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-03 00:15:17] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 497 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 8/8 constraints]
After SMT, in 43633ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43930 ms. Remains : 117/117 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 117 vertex of which 22 / 117 are part of one of the 4 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 94 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 12 place count 97 transition count 203
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 14 place count 96 transition count 202
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 16 place count 95 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 95 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 95 transition count 191
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 2 rules applied. Total rules applied 30 place count 95 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 93 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 91 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 38 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 41 place count 91 transition count 182
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 5 with 2 rules applied. Total rules applied 43 place count 90 transition count 181
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 89 transition count 159
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 89 transition count 159
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 48 place count 89 transition count 156
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 52 place count 86 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 56 place count 86 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 58 place count 86 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 60 place count 84 transition count 149
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 64 place count 84 transition count 149
Applied a total of 64 rules in 30 ms. Remains 84 /117 variables (removed 33) and now considering 149/306 (removed 157) transitions.
Running SMT prover for 2 properties.
[2024-06-03 00:15:43] [INFO ] Flow matrix only has 147 transitions (discarded 2 similar events)
// Phase 1: matrix 147 rows 84 cols
[2024-06-03 00:15:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:15:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:15:43] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-03 00:15:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:15:43] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-03 00:15:43] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-03 00:15:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:15:43] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-03 00:15:43] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-03 00:15:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-06-03 00:15:43] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-03 00:15:43] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 288 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-18-UpperBounds-03 in 98914 ms.
[2024-06-03 00:15:43] [INFO ] Flatten gal took : 60 ms
[2024-06-03 00:15:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-03 00:15:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 309 transitions and 1233 arcs took 4 ms.
Total runtime 314472 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 118
TRANSITIONS: 309
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1269
MODEL NAME: /home/mcc/execution/413/model
118 places, 309 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717373744976
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898300309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;