About the Execution of 2023-gold for ShieldPPPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4299.308 | 726566.00 | 942604.00 | 20738.60 | TFFFFFFFFFFFFFFF | 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.r373-tall-171683789200408.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 gold2023
Input is ShieldPPPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200408
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716987380506
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 12:56:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:56:22] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-29 12:56:22] [INFO ] Transformed 2343 places.
[2024-05-29 12:56:22] [INFO ] Transformed 2133 transitions.
[2024-05-29 12:56:22] [INFO ] Found NUPN structural information;
[2024-05-29 12:56:22] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 317 place count 2026 transition count 1816
Iterating global reduction 0 with 317 rules applied. Total rules applied 634 place count 2026 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 635 place count 2025 transition count 1815
Iterating global reduction 0 with 1 rules applied. Total rules applied 636 place count 2025 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 2024 transition count 1814
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 2024 transition count 1814
Applied a total of 638 rules in 801 ms. Remains 2024 /2343 variables (removed 319) and now considering 1814/2133 (removed 319) transitions.
// Phase 1: matrix 1814 rows 2024 cols
[2024-05-29 12:56:23] [INFO ] Computed 331 invariants in 39 ms
[2024-05-29 12:56:24] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2024-05-29 12:56:24] [INFO ] Invariant cache hit.
[2024-05-29 12:56:26] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2932 ms to find 0 implicit places.
[2024-05-29 12:56:26] [INFO ] Invariant cache hit.
[2024-05-29 12:56:27] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2024/2343 places, 1814/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4887 ms. Remains : 2024/2343 places, 1814/2133 transitions.
Support contains 41 out of 2024 places after structural reductions.
[2024-05-29 12:56:28] [INFO ] Flatten gal took : 154 ms
[2024-05-29 12:56:28] [INFO ] Flatten gal took : 79 ms
[2024-05-29 12:56:28] [INFO ] Input system was already deterministic with 1814 transitions.
Support contains 36 out of 2024 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-29 12:56:29] [INFO ] Invariant cache hit.
[2024-05-29 12:56:30] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-29 12:56:31] [INFO ] [Nat]Absence check using 331 positive place invariants in 109 ms returned sat
[2024-05-29 12:56:33] [INFO ] After 2069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 13 ms to minimize.
[2024-05-29 12:56:34] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 20 places in 342 ms of which 1 ms to minimize.
[2024-05-29 12:56:35] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 2 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 1 ms to minimize.
[2024-05-29 12:56:36] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 2 ms to minimize.
[2024-05-29 12:56:37] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 1 ms to minimize.
[2024-05-29 12:56:37] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2024-05-29 12:56:38] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 1 ms to minimize.
[2024-05-29 12:56:39] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 1 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 0 ms to minimize.
[2024-05-29 12:56:40] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2024-05-29 12:56:41] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2024-05-29 12:56:41] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 0 ms to minimize.
[2024-05-29 12:56:41] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 1 ms to minimize.
[2024-05-29 12:56:42] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 0 ms to minimize.
[2024-05-29 12:56:42] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 0 ms to minimize.
[2024-05-29 12:56:42] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 0 ms to minimize.
[2024-05-29 12:56:42] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 0 ms to minimize.
[2024-05-29 12:56:43] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:56:43] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2024-05-29 12:56:43] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 1 ms to minimize.
[2024-05-29 12:56:43] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 0 ms to minimize.
[2024-05-29 12:56:44] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2024-05-29 12:56:44] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2024-05-29 12:56:44] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 1 ms to minimize.
[2024-05-29 12:56:44] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2024-05-29 12:56:44] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2024-05-29 12:56:45] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:56:45] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2024-05-29 12:56:45] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 0 ms to minimize.
[2024-05-29 12:56:45] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2024-05-29 12:56:45] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-05-29 12:56:46] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2024-05-29 12:56:46] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 12266 ms
[2024-05-29 12:56:46] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2024-05-29 12:56:46] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2024-05-29 12:56:46] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-29 12:56:46] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2024-05-29 12:56:47] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 0 ms to minimize.
[2024-05-29 12:56:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 891 ms
[2024-05-29 12:56:47] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2024-05-29 12:56:47] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2024-05-29 12:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2024-05-29 12:56:48] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2024-05-29 12:56:48] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2024-05-29 12:56:48] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2024-05-29 12:56:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 718 ms
[2024-05-29 12:56:49] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2024-05-29 12:56:50] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:56:50] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2024-05-29 12:56:50] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-05-29 12:56:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 775 ms
[2024-05-29 12:56:50] [INFO ] After 18996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1301 ms.
[2024-05-29 12:56:52] [INFO ] After 21840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 982 ms.
Support contains 23 out of 2024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Drop transitions removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 2024 transition count 1407
Reduce places removed 407 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 410 rules applied. Total rules applied 817 place count 1617 transition count 1404
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 820 place count 1614 transition count 1404
Performed 230 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 230 Pre rules applied. Total rules applied 820 place count 1614 transition count 1174
Deduced a syphon composed of 230 places in 2 ms
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 3 with 460 rules applied. Total rules applied 1280 place count 1384 transition count 1174
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1285 place count 1379 transition count 1169
Iterating global reduction 3 with 5 rules applied. Total rules applied 1290 place count 1379 transition count 1169
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1290 place count 1379 transition count 1164
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1300 place count 1374 transition count 1164
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2322 place count 863 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2323 place count 863 transition count 652
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2325 place count 862 transition count 651
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 2489 place count 780 transition count 651
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2491 place count 780 transition count 649
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2493 place count 778 transition count 649
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 5 with 85 rules applied. Total rules applied 2578 place count 778 transition count 649
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2579 place count 777 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2580 place count 776 transition count 648
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2580 place count 776 transition count 646
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2584 place count 774 transition count 646
Applied a total of 2584 rules in 677 ms. Remains 774 /2024 variables (removed 1250) and now considering 646/1814 (removed 1168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 677 ms. Remains : 774/2024 places, 646/1814 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 646 rows 774 cols
[2024-05-29 12:56:54] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:56:54] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-29 12:56:54] [INFO ] [Nat]Absence check using 330 positive place invariants in 55 ms returned sat
[2024-05-29 12:56:55] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-29 12:56:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:56:56] [INFO ] After 434ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-29 12:56:56] [INFO ] After 1110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 442 ms.
[2024-05-29 12:56:57] [INFO ] After 2731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 237 ms.
Support contains 21 out of 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 646/646 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 774 transition count 645
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 773 transition count 645
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 4 place count 772 transition count 644
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 771 transition count 644
Applied a total of 6 rules in 40 ms. Remains 771 /774 variables (removed 3) and now considering 644/646 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 771/774 places, 644/646 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 139773 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{9=1}
Probabilistic random walk after 139773 steps, saw 116162 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :1
Running SMT prover for 15 properties.
// Phase 1: matrix 644 rows 771 cols
[2024-05-29 12:57:00] [INFO ] Computed 330 invariants in 5 ms
[2024-05-29 12:57:01] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 12:57:01] [INFO ] [Nat]Absence check using 330 positive place invariants in 52 ms returned sat
[2024-05-29 12:57:02] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 12:57:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:57:02] [INFO ] After 399ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-29 12:57:03] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-29 12:57:03] [INFO ] After 1334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 420 ms.
[2024-05-29 12:57:03] [INFO ] After 2865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 20 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 644/644 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 643
Applied a total of 2 rules in 31 ms. Remains 770 /771 variables (removed 1) and now considering 643/644 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 770/771 places, 643/644 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 113219 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113219 steps, saw 87473 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 643 rows 770 cols
[2024-05-29 12:57:08] [INFO ] Computed 330 invariants in 7 ms
[2024-05-29 12:57:08] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 12:57:08] [INFO ] [Nat]Absence check using 330 positive place invariants in 54 ms returned sat
[2024-05-29 12:57:09] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 12:57:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:57:09] [INFO ] After 374ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 12:57:10] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2024-05-29 12:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-29 12:57:10] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 12:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-29 12:57:10] [INFO ] After 1183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 390 ms.
[2024-05-29 12:57:11] [INFO ] After 2652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 19 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 643/643 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 770 transition count 642
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 769 transition count 642
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 768 transition count 642
Applied a total of 4 rules in 52 ms. Remains 768 /770 variables (removed 2) and now considering 642/643 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 768/770 places, 642/643 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 122847 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122847 steps, saw 95370 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 642 rows 768 cols
[2024-05-29 12:57:15] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:57:15] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 12:57:16] [INFO ] [Nat]Absence check using 330 positive place invariants in 43 ms returned sat
[2024-05-29 12:57:16] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 12:57:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:57:17] [INFO ] After 365ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 12:57:17] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 12:57:17] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:57:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2024-05-29 12:57:18] [INFO ] After 1141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 362 ms.
[2024-05-29 12:57:18] [INFO ] After 2538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 141 ms.
Support contains 19 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 642/642 transitions.
Applied a total of 0 rules in 14 ms. Remains 768 /768 variables (removed 0) and now considering 642/642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 768/768 places, 642/642 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 642/642 transitions.
Applied a total of 0 rules in 13 ms. Remains 768 /768 variables (removed 0) and now considering 642/642 (removed 0) transitions.
[2024-05-29 12:57:18] [INFO ] Invariant cache hit.
[2024-05-29 12:57:19] [INFO ] Implicit Places using invariants in 462 ms returned [751, 755]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 766/768 places, 642/642 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 764 transition count 640
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 764 transition count 640
Applied a total of 4 rules in 23 ms. Remains 764 /766 variables (removed 2) and now considering 640/642 (removed 2) transitions.
// Phase 1: matrix 640 rows 764 cols
[2024-05-29 12:57:19] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 12:57:19] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-29 12:57:19] [INFO ] Invariant cache hit.
[2024-05-29 12:57:20] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 764/768 places, 640/642 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1773 ms. Remains : 764/768 places, 640/642 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 111959 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111959 steps, saw 88695 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 13 properties.
[2024-05-29 12:57:24] [INFO ] Invariant cache hit.
[2024-05-29 12:57:24] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 12:57:24] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:57:25] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 12:57:26] [INFO ] After 1112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 329 ms.
[2024-05-29 12:57:26] [INFO ] After 1873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 17 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 640/640 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 764 transition count 639
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 763 transition count 639
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 763 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 762 transition count 638
Applied a total of 4 rules in 44 ms. Remains 762 /764 variables (removed 2) and now considering 638/640 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 762/764 places, 638/640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 117699 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117699 steps, saw 93212 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 638 rows 762 cols
[2024-05-29 12:57:30] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 12:57:30] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 12:57:31] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:57:31] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 12:57:32] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 12:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-29 12:57:32] [INFO ] After 1258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 340 ms.
[2024-05-29 12:57:32] [INFO ] After 2028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 17 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 638/638 transitions.
Applied a total of 0 rules in 14 ms. Remains 762 /762 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 762/762 places, 638/638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 638/638 transitions.
Applied a total of 0 rules in 23 ms. Remains 762 /762 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-05-29 12:57:33] [INFO ] Invariant cache hit.
[2024-05-29 12:57:33] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-29 12:57:33] [INFO ] Invariant cache hit.
[2024-05-29 12:57:34] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2024-05-29 12:57:34] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 12:57:34] [INFO ] Invariant cache hit.
[2024-05-29 12:57:34] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1751 ms. Remains : 762/762 places, 638/638 transitions.
Partial Free-agglomeration rule applied 161 times.
Drop transitions removed 161 transitions
Iterating global reduction 0 with 161 rules applied. Total rules applied 161 place count 762 transition count 638
Applied a total of 161 rules in 31 ms. Remains 762 /762 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 638 rows 762 cols
[2024-05-29 12:57:34] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:57:35] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 12:57:35] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:57:36] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 12:57:36] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-29 12:57:36] [INFO ] After 529ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-29 12:57:36] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 12:57:36] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2024-05-29 12:57:37] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-29 12:57:37] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-05-29 12:57:38] [INFO ] After 1905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 411 ms.
[2024-05-29 12:57:38] [INFO ] After 3340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Computed a total of 482 stabilizing places and 482 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2013 transition count 1803
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2013 transition count 1803
Applied a total of 22 rules in 170 ms. Remains 2013 /2024 variables (removed 11) and now considering 1803/1814 (removed 11) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 12:57:38] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 12:57:39] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-29 12:57:39] [INFO ] Invariant cache hit.
[2024-05-29 12:57:41] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
[2024-05-29 12:57:41] [INFO ] Invariant cache hit.
[2024-05-29 12:57:42] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2024 places, 1803/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3880 ms. Remains : 2013/2024 places, 1803/1814 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1723 0), p0:(EQ s149 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1069 ms.
Product exploration explored 100000 steps with 50000 reset in 992 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 31 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLFireability-00 finished in 6311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 4 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2012 transition count 1802
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2012 transition count 1802
Applied a total of 24 rules in 171 ms. Remains 2012 /2024 variables (removed 12) and now considering 1802/1814 (removed 12) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 12:57:45] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 12:57:45] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-29 12:57:45] [INFO ] Invariant cache hit.
[2024-05-29 12:57:47] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
[2024-05-29 12:57:47] [INFO ] Invariant cache hit.
[2024-05-29 12:57:48] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2024 places, 1802/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3695 ms. Remains : 2012/2024 places, 1802/1814 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s573 1) (EQ s1625 1)) (AND (EQ s1102 1) (EQ s941 1))), p1:(EQ s1625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 564 reset in 344 ms.
Product exploration explored 100000 steps with 572 reset in 470 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2012 stabilizing places and 478/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-29 12:57:50] [INFO ] Invariant cache hit.
[2024-05-29 12:57:51] [INFO ] [Real]Absence check using 331 positive place invariants in 438 ms returned sat
[2024-05-29 12:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 12:58:03] [INFO ] [Real]Absence check using state equation in 11704 ms returned sat
[2024-05-29 12:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 12:58:05] [INFO ] [Nat]Absence check using 331 positive place invariants in 459 ms returned sat
[2024-05-29 12:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 12:58:15] [INFO ] [Nat]Absence check using state equation in 10094 ms returned sat
[2024-05-29 12:58:15] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-29 12:58:15] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 102 ms.
[2024-05-29 12:58:19] [INFO ] Deduced a trap composed of 22 places in 989 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 12:58:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2011 transition count 1384
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1594 transition count 1384
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 834 place count 1594 transition count 1144
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1314 place count 1354 transition count 1144
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2328 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2329 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 846 transition count 635
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2509 place count 757 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2511 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2512 place count 754 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2516 place count 752 transition count 631
Applied a total of 2516 rules in 274 ms. Remains 752 /2012 variables (removed 1260) and now considering 631/1802 (removed 1171) transitions.
// Phase 1: matrix 631 rows 752 cols
[2024-05-29 12:58:19] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:58:20] [INFO ] Implicit Places using invariants in 460 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 462 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2012 places, 631/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 629
Applied a total of 4 rules in 26 ms. Remains 748 /750 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 748 cols
[2024-05-29 12:58:20] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:58:20] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-29 12:58:20] [INFO ] Invariant cache hit.
[2024-05-29 12:58:21] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2012 places, 629/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2128 ms. Remains : 748/2012 places, 629/1802 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/748 stabilizing places and 2/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-29 12:58:22] [INFO ] Invariant cache hit.
[2024-05-29 12:58:22] [INFO ] [Real]Absence check using 328 positive place invariants in 144 ms returned sat
[2024-05-29 12:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 12:58:23] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2024-05-29 12:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 12:58:24] [INFO ] [Nat]Absence check using 328 positive place invariants in 162 ms returned sat
[2024-05-29 12:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 12:58:25] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2024-05-29 12:58:25] [INFO ] Computed and/alt/rep : 624/983/624 causal constraints (skipped 0 transitions) in 54 ms.
[2024-05-29 12:58:31] [INFO ] Added : 527 causal constraints over 106 iterations in 5888 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19230 reset in 580 ms.
Stack based approach found an accepted trace after 69 steps with 14 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-02 finished in 47021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2011 transition count 1801
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2011 transition count 1801
Applied a total of 26 rules in 167 ms. Remains 2011 /2024 variables (removed 13) and now considering 1801/1814 (removed 13) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2024-05-29 12:58:32] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 12:58:32] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-29 12:58:32] [INFO ] Invariant cache hit.
[2024-05-29 12:58:34] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2024-05-29 12:58:34] [INFO ] Invariant cache hit.
[2024-05-29 12:58:35] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2024 places, 1801/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3777 ms. Remains : 2011/2024 places, 1801/1814 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s152 1), p1:(EQ s1885 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 537 ms.
Stack based approach found an accepted trace after 1181 steps with 0 reset with depth 1182 and stack size 1182 in 7 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-03 finished in 4445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(p1)))))'
Support contains 3 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2013 transition count 1803
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2013 transition count 1803
Applied a total of 22 rules in 166 ms. Remains 2013 /2024 variables (removed 11) and now considering 1803/1814 (removed 11) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 12:58:36] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 12:58:37] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-29 12:58:37] [INFO ] Invariant cache hit.
[2024-05-29 12:58:39] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2024-05-29 12:58:39] [INFO ] Invariant cache hit.
[2024-05-29 12:58:40] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2024 places, 1803/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3662 ms. Remains : 2013/2024 places, 1803/1814 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s659 1), p1:(AND (EQ s1080 1) (EQ s1618 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 207 reset in 432 ms.
Product exploration explored 100000 steps with 208 reset in 465 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Detected a total of 480/2013 stabilizing places and 480/1803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:58:41] [INFO ] Invariant cache hit.
[2024-05-29 12:58:42] [INFO ] [Real]Absence check using 331 positive place invariants in 103 ms returned sat
[2024-05-29 12:58:42] [INFO ] After 830ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 12:58:43] [INFO ] Deduced a trap composed of 25 places in 587 ms of which 2 ms to minimize.
[2024-05-29 12:58:44] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 1 ms to minimize.
[2024-05-29 12:58:44] [INFO ] Deduced a trap composed of 25 places in 486 ms of which 1 ms to minimize.
[2024-05-29 12:58:45] [INFO ] Deduced a trap composed of 16 places in 472 ms of which 1 ms to minimize.
[2024-05-29 12:58:45] [INFO ] Deduced a trap composed of 16 places in 506 ms of which 1 ms to minimize.
[2024-05-29 12:58:46] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 2 ms to minimize.
[2024-05-29 12:58:46] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2024-05-29 12:58:47] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 1 ms to minimize.
[2024-05-29 12:58:47] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2024-05-29 12:58:48] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 1 ms to minimize.
[2024-05-29 12:58:48] [INFO ] Deduced a trap composed of 23 places in 467 ms of which 1 ms to minimize.
[2024-05-29 12:58:49] [INFO ] Deduced a trap composed of 32 places in 435 ms of which 1 ms to minimize.
[2024-05-29 12:58:49] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 1 ms to minimize.
[2024-05-29 12:58:50] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2024-05-29 12:58:50] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 1 ms to minimize.
[2024-05-29 12:58:51] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 2 ms to minimize.
[2024-05-29 12:58:51] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 2 ms to minimize.
[2024-05-29 12:58:52] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 2 ms to minimize.
[2024-05-29 12:58:52] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 2 ms to minimize.
[2024-05-29 12:58:53] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2024-05-29 12:58:53] [INFO ] Deduced a trap composed of 41 places in 368 ms of which 1 ms to minimize.
[2024-05-29 12:58:54] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2024-05-29 12:58:54] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 1 ms to minimize.
[2024-05-29 12:58:54] [INFO ] Deduced a trap composed of 45 places in 335 ms of which 1 ms to minimize.
[2024-05-29 12:58:55] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 1 ms to minimize.
[2024-05-29 12:58:55] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 1 ms to minimize.
[2024-05-29 12:58:56] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 1 ms to minimize.
[2024-05-29 12:58:56] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2024-05-29 12:58:56] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2024-05-29 12:58:57] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 1 ms to minimize.
[2024-05-29 12:58:57] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 1 ms to minimize.
[2024-05-29 12:58:57] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 1 ms to minimize.
[2024-05-29 12:58:58] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 15124 ms
[2024-05-29 12:58:58] [INFO ] After 16024ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:58:58] [INFO ] After 16397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:58:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 109 ms returned sat
[2024-05-29 12:58:59] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:58:59] [INFO ] Deduced a trap composed of 25 places in 513 ms of which 1 ms to minimize.
[2024-05-29 12:59:00] [INFO ] Deduced a trap composed of 19 places in 509 ms of which 1 ms to minimize.
[2024-05-29 12:59:00] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2024-05-29 12:59:01] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 1 ms to minimize.
[2024-05-29 12:59:02] [INFO ] Deduced a trap composed of 16 places in 503 ms of which 1 ms to minimize.
[2024-05-29 12:59:02] [INFO ] Deduced a trap composed of 29 places in 482 ms of which 1 ms to minimize.
[2024-05-29 12:59:03] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 1 ms to minimize.
[2024-05-29 12:59:03] [INFO ] Deduced a trap composed of 28 places in 478 ms of which 2 ms to minimize.
[2024-05-29 12:59:04] [INFO ] Deduced a trap composed of 17 places in 476 ms of which 1 ms to minimize.
[2024-05-29 12:59:04] [INFO ] Deduced a trap composed of 41 places in 460 ms of which 1 ms to minimize.
[2024-05-29 12:59:05] [INFO ] Deduced a trap composed of 23 places in 448 ms of which 1 ms to minimize.
[2024-05-29 12:59:05] [INFO ] Deduced a trap composed of 32 places in 424 ms of which 1 ms to minimize.
[2024-05-29 12:59:06] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 1 ms to minimize.
[2024-05-29 12:59:06] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2024-05-29 12:59:07] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 1 ms to minimize.
[2024-05-29 12:59:07] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 2 ms to minimize.
[2024-05-29 12:59:08] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 1 ms to minimize.
[2024-05-29 12:59:08] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 1 ms to minimize.
[2024-05-29 12:59:08] [INFO ] Deduced a trap composed of 27 places in 381 ms of which 1 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 23 places in 368 ms of which 1 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 2 ms to minimize.
[2024-05-29 12:59:10] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 1 ms to minimize.
[2024-05-29 12:59:10] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 0 ms to minimize.
[2024-05-29 12:59:11] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 1 ms to minimize.
[2024-05-29 12:59:11] [INFO ] Deduced a trap composed of 48 places in 327 ms of which 1 ms to minimize.
[2024-05-29 12:59:11] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 1 ms to minimize.
[2024-05-29 12:59:12] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 1 ms to minimize.
[2024-05-29 12:59:12] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 0 ms to minimize.
[2024-05-29 12:59:12] [INFO ] Deduced a trap composed of 45 places in 330 ms of which 0 ms to minimize.
[2024-05-29 12:59:13] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 2 ms to minimize.
[2024-05-29 12:59:13] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
[2024-05-29 12:59:14] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 1 ms to minimize.
[2024-05-29 12:59:14] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 1 ms to minimize.
[2024-05-29 12:59:14] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 1 ms to minimize.
[2024-05-29 12:59:14] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15651 ms
[2024-05-29 12:59:14] [INFO ] After 16490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 12:59:15] [INFO ] After 16934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 220 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-29 12:59:15] [INFO ] Invariant cache hit.
[2024-05-29 12:59:17] [INFO ] [Real]Absence check using 331 positive place invariants in 421 ms returned sat
[2024-05-29 12:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 12:59:28] [INFO ] [Real]Absence check using state equation in 11028 ms returned sat
[2024-05-29 12:59:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 12:59:29] [INFO ] [Nat]Absence check using 331 positive place invariants in 442 ms returned sat
[2024-05-29 12:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 12:59:40] [INFO ] [Nat]Absence check using state equation in 10929 ms returned sat
[2024-05-29 12:59:40] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:59:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:59:40] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:59:41] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:59:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 584 ms
[2024-05-29 12:59:41] [INFO ] Computed and/alt/rep : 1802/2675/1802 causal constraints (skipped 0 transitions) in 107 ms.
[2024-05-29 12:59:43] [INFO ] Added : 90 causal constraints over 18 iterations in 2038 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-29 12:59:43] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 68048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((((p0||X(p1)) U p2)&&F(p1)))||G(p3)))'
Support contains 4 out of 2024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2023 transition count 1397
Reduce places removed 416 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 418 rules applied. Total rules applied 834 place count 1607 transition count 1395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 836 place count 1605 transition count 1395
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 836 place count 1605 transition count 1162
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1302 place count 1372 transition count 1162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1312 place count 1362 transition count 1152
Iterating global reduction 3 with 10 rules applied. Total rules applied 1322 place count 1362 transition count 1152
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1322 place count 1362 transition count 1142
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1342 place count 1352 transition count 1142
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2356 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2357 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2359 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2535 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2537 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2538 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2538 place count 753 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2542 place count 751 transition count 629
Applied a total of 2542 rules in 292 ms. Remains 751 /2024 variables (removed 1273) and now considering 629/1814 (removed 1185) transitions.
// Phase 1: matrix 629 rows 751 cols
[2024-05-29 12:59:44] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 12:59:45] [INFO ] Implicit Places using invariants in 457 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 458 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2024 places, 629/1814 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 627
Applied a total of 4 rules in 21 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2024-05-29 12:59:45] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:59:45] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-29 12:59:45] [INFO ] Invariant cache hit.
[2024-05-29 12:59:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:59:46] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2024 places, 627/1814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1943 ms. Remains : 747/2024 places, 627/1814 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p2), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=5 dest: 5}]], initial=5, aps=[p1:(EQ s574 1), p2:(AND (EQ s41 1) (EQ s43 1)), p0:(EQ s376 1), p3:(OR (EQ s41 0) (EQ s43 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 655 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/747 stabilizing places and 2/627 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0) p3)), (X (NOT (AND (NOT p2) p0 p1 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 p3))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 34 factoid took 705 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-29 12:59:50] [INFO ] Invariant cache hit.
[2024-05-29 12:59:50] [INFO ] [Real]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 12:59:50] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2024-05-29 12:59:50] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 12:59:51] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2024-05-29 12:59:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:59:51] [INFO ] After 180ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2024-05-29 12:59:51] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-29 12:59:51] [INFO ] After 1356ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 747/747 places, 627/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 12:59:52] [INFO ] Invariant cache hit.
[2024-05-29 12:59:52] [INFO ] [Real]Absence check using 328 positive place invariants in 60 ms returned sat
[2024-05-29 12:59:52] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 12:59:52] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:59:52] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 12:59:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:59:53] [INFO ] After 83ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 12:59:53] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 12:59:53] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 747 transition count 626
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 746 transition count 626
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 745 transition count 626
Applied a total of 4 rules in 23 ms. Remains 745 /747 variables (removed 2) and now considering 626/627 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 745/747 places, 626/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 221042 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221042 steps, saw 157820 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:59:56] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:59:56] [INFO ] [Real]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 12:59:56] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 12:59:57] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 12:59:57] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 12:59:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:59:57] [INFO ] After 74ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 12:59:57] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 12:59:57] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 18 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 745/745 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 11 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 12:59:57] [INFO ] Invariant cache hit.
[2024-05-29 12:59:58] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 12:59:58] [INFO ] Invariant cache hit.
[2024-05-29 12:59:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:59:58] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2024-05-29 12:59:58] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 12:59:58] [INFO ] Invariant cache hit.
[2024-05-29 12:59:59] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1472 ms. Remains : 745/745 places, 626/626 transitions.
Partial Free-agglomeration rule applied 174 times.
Drop transitions removed 174 transitions
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 745 transition count 626
Applied a total of 174 rules in 26 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:59:59] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:59:59] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:59:59] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 12:59:59] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:59:59] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:00] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 13:00:00] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0) p3)), (X (NOT (AND (NOT p2) p0 p1 (NOT p3)))), (X (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 p3))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND p2 (NOT p1) p3))), (G (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (G (NOT (AND p0 (NOT p2) p1 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) p3))), (F (AND p0 (NOT p2) p1)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p1) p3)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1 p3)), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (AND p0 (NOT p2) p3))]
Knowledge based reduction with 39 factoid took 1342 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 15 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
// Phase 1: matrix 627 rows 747 cols
[2024-05-29 13:00:01] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:00:02] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-29 13:00:02] [INFO ] Invariant cache hit.
[2024-05-29 13:00:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:00:03] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-29 13:00:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 13:00:03] [INFO ] Invariant cache hit.
[2024-05-29 13:00:03] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1585 ms. Remains : 747/747 places, 627/627 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/747 stabilizing places and 2/627 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 14 factoid took 272 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 13:00:04] [INFO ] Invariant cache hit.
[2024-05-29 13:00:04] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:00:04] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 13:00:05] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-29 13:00:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:00:05] [INFO ] After 133ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-29 13:00:05] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 13:00:05] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 747/747 places, 627/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 13:00:05] [INFO ] Invariant cache hit.
[2024-05-29 13:00:06] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:00:06] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 13:00:06] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:00:06] [INFO ] After 77ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-29 13:00:06] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 13:00:06] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 747/747 places, 627/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 217754 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217754 steps, saw 154962 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 13:00:10] [INFO ] Invariant cache hit.
[2024-05-29 13:00:10] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:00:10] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 13:00:10] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:00:11] [INFO ] After 80ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-29 13:00:11] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 13:00:11] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 747/747 places, 627/627 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 627/627 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
[2024-05-29 13:00:11] [INFO ] Invariant cache hit.
[2024-05-29 13:00:11] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-29 13:00:11] [INFO ] Invariant cache hit.
[2024-05-29 13:00:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:00:12] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2024-05-29 13:00:12] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:00:12] [INFO ] Invariant cache hit.
[2024-05-29 13:00:12] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1581 ms. Remains : 747/747 places, 627/627 transitions.
Partial Free-agglomeration rule applied 172 times.
Drop transitions removed 172 transitions
Iterating global reduction 0 with 172 rules applied. Total rules applied 172 place count 747 transition count 627
Applied a total of 172 rules in 47 ms. Remains 747 /747 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 627 rows 747 cols
[2024-05-29 13:00:12] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:00:13] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:00:13] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 13:00:13] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:00:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-29 13:00:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-29 13:00:13] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 13:00:13] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 15 factoid took 402 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 578 ms.
Product exploration explored 100000 steps with 0 reset in 766 ms.
Built C files in :
/tmp/ltsmin2227752007762006192
[2024-05-29 13:00:16] [INFO ] Computing symmetric may disable matrix : 627 transitions.
[2024-05-29 13:00:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:16] [INFO ] Computing symmetric may enable matrix : 627 transitions.
[2024-05-29 13:00:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:16] [INFO ] Computing Do-Not-Accords matrix : 627 transitions.
[2024-05-29 13:00:16] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:16] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2227752007762006192
Running compilation step : cd /tmp/ltsmin2227752007762006192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin2227752007762006192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2227752007762006192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12543702718218386663.hoa' '--buchi-type=spotba'
LTSmin run took 12537 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-030B-LTLFireability-05 finished in 45945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2023 transition count 1393
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1603 transition count 1393
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 840 place count 1603 transition count 1162
Deduced a syphon composed of 231 places in 1 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 2 with 462 rules applied. Total rules applied 1302 place count 1372 transition count 1162
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1313 place count 1361 transition count 1151
Iterating global reduction 2 with 11 rules applied. Total rules applied 1324 place count 1361 transition count 1151
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1324 place count 1361 transition count 1140
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1346 place count 1350 transition count 1140
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2360 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2361 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2363 place count 842 transition count 631
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2539 place count 754 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2541 place count 752 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2542 place count 751 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2542 place count 751 transition count 627
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2546 place count 749 transition count 627
Applied a total of 2546 rules in 262 ms. Remains 749 /2024 variables (removed 1275) and now considering 627/1814 (removed 1187) transitions.
// Phase 1: matrix 627 rows 749 cols
[2024-05-29 13:00:30] [INFO ] Computed 330 invariants in 15 ms
[2024-05-29 13:00:31] [INFO ] Implicit Places using invariants in 440 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 441 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2024 places, 627/1814 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 625
Applied a total of 4 rules in 19 ms. Remains 745 /747 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 745 cols
[2024-05-29 13:00:31] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:00:31] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-29 13:00:31] [INFO ] Invariant cache hit.
[2024-05-29 13:00:32] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2024 places, 625/1814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1928 ms. Remains : 745/2024 places, 625/1814 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 494 ms.
Product exploration explored 100000 steps with 0 reset in 699 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336523 steps, run timeout after 3009 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 336523 steps, saw 242146 distinct states, run finished after 3010 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:00:36] [INFO ] Invariant cache hit.
[2024-05-29 13:00:37] [INFO ] [Real]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 13:00:37] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:00:37] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 13:00:37] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:00:37] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 13:00:37] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 745/745 places, 625/625 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336237 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336237 steps, saw 241900 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:00:40] [INFO ] Invariant cache hit.
[2024-05-29 13:00:41] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:00:41] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:00:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 13:00:41] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:00:41] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 13:00:41] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 13 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 745/745 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 14 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-05-29 13:00:41] [INFO ] Invariant cache hit.
[2024-05-29 13:00:42] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-29 13:00:42] [INFO ] Invariant cache hit.
[2024-05-29 13:00:43] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2024-05-29 13:00:43] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:00:43] [INFO ] Invariant cache hit.
[2024-05-29 13:00:43] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1632 ms. Remains : 745/745 places, 625/625 transitions.
Partial Free-agglomeration rule applied 174 times.
Drop transitions removed 174 transitions
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 745 transition count 625
Applied a total of 174 rules in 23 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 625 rows 745 cols
[2024-05-29 13:00:43] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:00:43] [INFO ] [Real]Absence check using 328 positive place invariants in 47 ms returned sat
[2024-05-29 13:00:43] [INFO ] After 245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:00:44] [INFO ] After 291ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 13:00:44] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 16 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 745 cols
[2024-05-29 13:00:44] [INFO ] Computed 328 invariants in 7 ms
[2024-05-29 13:00:44] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-29 13:00:44] [INFO ] Invariant cache hit.
[2024-05-29 13:00:45] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-05-29 13:00:45] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:00:45] [INFO ] Invariant cache hit.
[2024-05-29 13:00:45] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1561 ms. Remains : 745/745 places, 625/625 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 330352 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330352 steps, saw 237072 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:00:49] [INFO ] Invariant cache hit.
[2024-05-29 13:00:49] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 13:00:49] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:00:49] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 13:00:49] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:00:49] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 13:00:49] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 745/745 places, 625/625 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 338168 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338168 steps, saw 243479 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:00:53] [INFO ] Invariant cache hit.
[2024-05-29 13:00:53] [INFO ] [Real]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 13:00:53] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:00:53] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 13:00:53] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:00:53] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 13:00:54] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 18 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 745/745 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-05-29 13:00:54] [INFO ] Invariant cache hit.
[2024-05-29 13:00:54] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-29 13:00:54] [INFO ] Invariant cache hit.
[2024-05-29 13:00:55] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2024-05-29 13:00:55] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:00:55] [INFO ] Invariant cache hit.
[2024-05-29 13:00:55] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1618 ms. Remains : 745/745 places, 625/625 transitions.
Partial Free-agglomeration rule applied 174 times.
Drop transitions removed 174 transitions
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 745 transition count 625
Applied a total of 174 rules in 24 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 625 rows 745 cols
[2024-05-29 13:00:55] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:00:55] [INFO ] [Real]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 13:00:56] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 13:00:56] [INFO ] After 322ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 13:00:56] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 508 ms.
Product exploration explored 100000 steps with 0 reset in 717 ms.
Built C files in :
/tmp/ltsmin4146714114004345957
[2024-05-29 13:00:57] [INFO ] Computing symmetric may disable matrix : 625 transitions.
[2024-05-29 13:00:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:57] [INFO ] Computing symmetric may enable matrix : 625 transitions.
[2024-05-29 13:00:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:57] [INFO ] Computing Do-Not-Accords matrix : 625 transitions.
[2024-05-29 13:00:57] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:00:57] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146714114004345957
Running compilation step : cd /tmp/ltsmin4146714114004345957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2480 ms.
Running link step : cd /tmp/ltsmin4146714114004345957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4146714114004345957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18274926929085915835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 625/625 transitions.
Applied a total of 0 rules in 18 ms. Remains 745 /745 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 745 cols
[2024-05-29 13:01:12] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:01:13] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-29 13:01:13] [INFO ] Invariant cache hit.
[2024-05-29 13:01:14] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2024-05-29 13:01:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:01:14] [INFO ] Invariant cache hit.
[2024-05-29 13:01:14] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1588 ms. Remains : 745/745 places, 625/625 transitions.
Built C files in :
/tmp/ltsmin7500668736115746010
[2024-05-29 13:01:14] [INFO ] Computing symmetric may disable matrix : 625 transitions.
[2024-05-29 13:01:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:01:14] [INFO ] Computing symmetric may enable matrix : 625 transitions.
[2024-05-29 13:01:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:01:14] [INFO ] Computing Do-Not-Accords matrix : 625 transitions.
[2024-05-29 13:01:14] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:01:14] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7500668736115746010
Running compilation step : cd /tmp/ltsmin7500668736115746010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2771 ms.
Running link step : cd /tmp/ltsmin7500668736115746010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7500668736115746010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15193440909022217631.hoa' '--buchi-type=spotba'
LTSmin run took 11686 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-030B-LTLFireability-06 finished in 58646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X((!p1||G(F((G(p2)||(p2&&F(!p0))))))) U (p0&&X((!p1||G(F((G(p2)||(p2&&F(!p0))))))))))))))'
Support contains 4 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2012 transition count 1802
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2012 transition count 1802
Applied a total of 24 rules in 170 ms. Remains 2012 /2024 variables (removed 12) and now considering 1802/1814 (removed 12) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:01:29] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 13:01:30] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-29 13:01:30] [INFO ] Invariant cache hit.
[2024-05-29 13:01:32] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2720 ms to find 0 implicit places.
[2024-05-29 13:01:32] [INFO ] Invariant cache hit.
[2024-05-29 13:01:33] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2024 places, 1802/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4084 ms. Remains : 2012/2024 places, 1802/1814 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s561 1), p1:(AND (EQ s1628 1) (EQ s1665 1)), p2:(NEQ s574 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16716 reset in 408 ms.
Product exploration explored 100000 steps with 16690 reset in 334 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:01:35] [INFO ] Invariant cache hit.
[2024-05-29 13:01:35] [INFO ] [Real]Absence check using 331 positive place invariants in 103 ms returned sat
[2024-05-29 13:01:36] [INFO ] After 1623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:01:37] [INFO ] [Nat]Absence check using 331 positive place invariants in 107 ms returned sat
[2024-05-29 13:01:38] [INFO ] After 1104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:01:38] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 1 ms to minimize.
[2024-05-29 13:01:39] [INFO ] Deduced a trap composed of 28 places in 490 ms of which 2 ms to minimize.
[2024-05-29 13:01:39] [INFO ] Deduced a trap composed of 25 places in 474 ms of which 1 ms to minimize.
[2024-05-29 13:01:40] [INFO ] Deduced a trap composed of 24 places in 466 ms of which 1 ms to minimize.
[2024-05-29 13:01:41] [INFO ] Deduced a trap composed of 24 places in 452 ms of which 1 ms to minimize.
[2024-05-29 13:01:41] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 1 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 1 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 2 ms to minimize.
[2024-05-29 13:01:43] [INFO ] Deduced a trap composed of 17 places in 408 ms of which 1 ms to minimize.
[2024-05-29 13:01:43] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 1 ms to minimize.
[2024-05-29 13:01:44] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 1 ms to minimize.
[2024-05-29 13:01:44] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 1 ms to minimize.
[2024-05-29 13:01:45] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 1 ms to minimize.
[2024-05-29 13:01:45] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2024-05-29 13:01:46] [INFO ] Deduced a trap composed of 20 places in 377 ms of which 1 ms to minimize.
[2024-05-29 13:01:46] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2024-05-29 13:01:47] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 1 ms to minimize.
[2024-05-29 13:01:47] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 1 ms to minimize.
[2024-05-29 13:01:47] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2024-05-29 13:01:48] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 1 ms to minimize.
[2024-05-29 13:01:48] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 0 ms to minimize.
[2024-05-29 13:01:48] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:01:49] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 1 ms to minimize.
[2024-05-29 13:01:49] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 1 ms to minimize.
[2024-05-29 13:01:49] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:01:50] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
[2024-05-29 13:01:50] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 0 ms to minimize.
[2024-05-29 13:01:51] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2024-05-29 13:01:51] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2024-05-29 13:01:51] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 1 ms to minimize.
[2024-05-29 13:01:51] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 1 ms to minimize.
[2024-05-29 13:01:52] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 1 ms to minimize.
[2024-05-29 13:01:52] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
[2024-05-29 13:01:52] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 1 ms to minimize.
[2024-05-29 13:01:53] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 0 ms to minimize.
[2024-05-29 13:01:53] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2024-05-29 13:01:53] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 0 ms to minimize.
[2024-05-29 13:01:53] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 1 ms to minimize.
[2024-05-29 13:01:54] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2024-05-29 13:01:54] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2024-05-29 13:01:54] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2024-05-29 13:01:55] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 0 ms to minimize.
[2024-05-29 13:01:55] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 1 ms to minimize.
[2024-05-29 13:01:55] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2024-05-29 13:01:55] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 0 ms to minimize.
[2024-05-29 13:01:56] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 0 ms to minimize.
[2024-05-29 13:01:56] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 1 ms to minimize.
[2024-05-29 13:01:56] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 1 ms to minimize.
[2024-05-29 13:01:56] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 18320 ms
[2024-05-29 13:01:57] [INFO ] After 19803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 244 ms.
[2024-05-29 13:01:57] [INFO ] After 20633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2012 transition count 1383
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1593 transition count 1383
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 838 place count 1593 transition count 1145
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1314 place count 1355 transition count 1145
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
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 2609 place count 751 transition count 630
Applied a total of 2609 rules in 193 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 195427 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195427 steps, saw 166306 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 630 rows 751 cols
[2024-05-29 13:02:00] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 13:02:01] [INFO ] [Real]Absence check using 330 positive place invariants in 50 ms returned sat
[2024-05-29 13:02:01] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:02:01] [INFO ] [Nat]Absence check using 330 positive place invariants in 50 ms returned sat
[2024-05-29 13:02:01] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 13:02:02] [INFO ] After 104ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:02:02] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:02:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2024-05-29 13:02:02] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-29 13:02:02] [INFO ] After 1083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 10 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 19 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2024-05-29 13:02:02] [INFO ] Invariant cache hit.
[2024-05-29 13:02:02] [INFO ] Implicit Places using invariants in 393 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 19 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 13:02:02] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:02:03] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-29 13:02:03] [INFO ] Invariant cache hit.
[2024-05-29 13:02:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:02:04] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1619 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 200079 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200079 steps, saw 166519 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:02:07] [INFO ] Invariant cache hit.
[2024-05-29 13:02:07] [INFO ] [Real]Absence check using 328 positive place invariants in 47 ms returned sat
[2024-05-29 13:02:08] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:02:08] [INFO ] [Nat]Absence check using 328 positive place invariants in 47 ms returned sat
[2024-05-29 13:02:08] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:02:08] [INFO ] After 98ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:08] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 13:02:09] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 15 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-29 13:02:09] [INFO ] Invariant cache hit.
[2024-05-29 13:02:09] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-29 13:02:09] [INFO ] Invariant cache hit.
[2024-05-29 13:02:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:02:10] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2024-05-29 13:02:10] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:02:10] [INFO ] Invariant cache hit.
[2024-05-29 13:02:10] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 747 transition count 628
Applied a total of 176 rules in 33 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 13:02:10] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:02:10] [INFO ] [Real]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 13:02:11] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:02:11] [INFO ] [Nat]Absence check using 328 positive place invariants in 47 ms returned sat
[2024-05-29 13:02:11] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:11] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-29 13:02:11] [INFO ] After 160ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 13:02:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 982 ms
[2024-05-29 13:02:13] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:02:13] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:02:13] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-29 13:02:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2024-05-29 13:02:13] [INFO ] After 1800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-29 13:02:13] [INFO ] After 2433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p2)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 3956 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:02:18] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 13:02:19] [INFO ] [Real]Absence check using 331 positive place invariants in 431 ms returned sat
[2024-05-29 13:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:02:31] [INFO ] [Real]Absence check using state equation in 11604 ms returned sat
[2024-05-29 13:02:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:02:32] [INFO ] [Nat]Absence check using 331 positive place invariants in 474 ms returned sat
[2024-05-29 13:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:02:44] [INFO ] [Nat]Absence check using state equation in 11341 ms returned sat
[2024-05-29 13:02:44] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-05-29 13:02:44] [INFO ] Computed and/alt/rep : 1801/2673/1801 causal constraints (skipped 0 transitions) in 108 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:02:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 80 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2024-05-29 13:02:46] [INFO ] Invariant cache hit.
[2024-05-29 13:02:47] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 13:02:47] [INFO ] Invariant cache hit.
[2024-05-29 13:02:48] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2024-05-29 13:02:48] [INFO ] Invariant cache hit.
[2024-05-29 13:02:50] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3647 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:02:50] [INFO ] Invariant cache hit.
[2024-05-29 13:02:51] [INFO ] [Real]Absence check using 331 positive place invariants in 104 ms returned sat
[2024-05-29 13:02:52] [INFO ] After 1493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:02:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 104 ms returned sat
[2024-05-29 13:02:53] [INFO ] After 1001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:02:54] [INFO ] Deduced a trap composed of 27 places in 478 ms of which 1 ms to minimize.
[2024-05-29 13:02:54] [INFO ] Deduced a trap composed of 28 places in 466 ms of which 1 ms to minimize.
[2024-05-29 13:02:55] [INFO ] Deduced a trap composed of 25 places in 474 ms of which 1 ms to minimize.
[2024-05-29 13:02:55] [INFO ] Deduced a trap composed of 24 places in 467 ms of which 1 ms to minimize.
[2024-05-29 13:02:56] [INFO ] Deduced a trap composed of 24 places in 463 ms of which 1 ms to minimize.
[2024-05-29 13:02:56] [INFO ] Deduced a trap composed of 28 places in 452 ms of which 1 ms to minimize.
[2024-05-29 13:02:57] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 1 ms to minimize.
[2024-05-29 13:02:57] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 1 ms to minimize.
[2024-05-29 13:02:58] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 1 ms to minimize.
[2024-05-29 13:02:58] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 1 ms to minimize.
[2024-05-29 13:02:59] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 1 ms to minimize.
[2024-05-29 13:02:59] [INFO ] Deduced a trap composed of 42 places in 395 ms of which 1 ms to minimize.
[2024-05-29 13:03:00] [INFO ] Deduced a trap composed of 24 places in 397 ms of which 1 ms to minimize.
[2024-05-29 13:03:00] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 1 ms to minimize.
[2024-05-29 13:03:01] [INFO ] Deduced a trap composed of 23 places in 377 ms of which 2 ms to minimize.
[2024-05-29 13:03:01] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 1 ms to minimize.
[2024-05-29 13:03:02] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 1 ms to minimize.
[2024-05-29 13:03:02] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2024-05-29 13:03:02] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 1 ms to minimize.
[2024-05-29 13:03:03] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 1 ms to minimize.
[2024-05-29 13:03:03] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 1 ms to minimize.
[2024-05-29 13:03:03] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 2 ms to minimize.
[2024-05-29 13:03:04] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2024-05-29 13:03:04] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 0 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 1 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 1 ms to minimize.
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2024-05-29 13:03:07] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 1 ms to minimize.
[2024-05-29 13:03:07] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 0 ms to minimize.
[2024-05-29 13:03:07] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 0 ms to minimize.
[2024-05-29 13:03:07] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 0 ms to minimize.
[2024-05-29 13:03:08] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 1 ms to minimize.
[2024-05-29 13:03:08] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 1 ms to minimize.
[2024-05-29 13:03:08] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 0 ms to minimize.
[2024-05-29 13:03:09] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 0 ms to minimize.
[2024-05-29 13:03:09] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 1 ms to minimize.
[2024-05-29 13:03:09] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2024-05-29 13:03:09] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2024-05-29 13:03:10] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 1 ms to minimize.
[2024-05-29 13:03:10] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2024-05-29 13:03:10] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 0 ms to minimize.
[2024-05-29 13:03:11] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 0 ms to minimize.
[2024-05-29 13:03:11] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 0 ms to minimize.
[2024-05-29 13:03:11] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2024-05-29 13:03:11] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 0 ms to minimize.
[2024-05-29 13:03:12] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 1 ms to minimize.
[2024-05-29 13:03:12] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 18390 ms
[2024-05-29 13:03:12] [INFO ] After 19792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 254 ms.
[2024-05-29 13:03:12] [INFO ] After 20590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2012 transition count 1383
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1593 transition count 1383
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 838 place count 1593 transition count 1145
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1314 place count 1355 transition count 1145
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 218 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 137058 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137058 steps, saw 116187 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 630 rows 751 cols
[2024-05-29 13:03:16] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 13:03:16] [INFO ] [Real]Absence check using 330 positive place invariants in 56 ms returned sat
[2024-05-29 13:03:17] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:03:17] [INFO ] [Nat]Absence check using 330 positive place invariants in 50 ms returned sat
[2024-05-29 13:03:17] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 13:03:17] [INFO ] After 105ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-29 13:03:18] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-29 13:03:18] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 13 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2024-05-29 13:03:18] [INFO ] Invariant cache hit.
[2024-05-29 13:03:18] [INFO ] Implicit Places using invariants in 462 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 20 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 13:03:18] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:03:19] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-29 13:03:19] [INFO ] Invariant cache hit.
[2024-05-29 13:03:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:03:20] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1863 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 153170 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153170 steps, saw 127499 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:03:23] [INFO ] Invariant cache hit.
[2024-05-29 13:03:23] [INFO ] [Real]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 13:03:24] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:03:24] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 13:03:25] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:03:25] [INFO ] After 101ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:25] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-29 13:03:25] [INFO ] After 1606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-29 13:03:25] [INFO ] Invariant cache hit.
[2024-05-29 13:03:26] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-29 13:03:26] [INFO ] Invariant cache hit.
[2024-05-29 13:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:03:27] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-05-29 13:03:27] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:03:27] [INFO ] Invariant cache hit.
[2024-05-29 13:03:27] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 747 transition count 628
Applied a total of 176 rules in 25 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 13:03:27] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 13:03:27] [INFO ] [Real]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 13:03:28] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:03:28] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:03:28] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:28] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-29 13:03:28] [INFO ] After 179ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:03:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1045 ms
[2024-05-29 13:03:30] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:03:30] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2024-05-29 13:03:30] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2024-05-29 13:03:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 535 ms
[2024-05-29 13:03:30] [INFO ] After 1910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-05-29 13:03:30] [INFO ] After 2601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p2)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:03:31] [INFO ] Computed 331 invariants in 9 ms
[2024-05-29 13:03:33] [INFO ] [Real]Absence check using 331 positive place invariants in 412 ms returned sat
[2024-05-29 13:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:03:44] [INFO ] [Real]Absence check using state equation in 11122 ms returned sat
[2024-05-29 13:03:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:03:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 472 ms returned sat
[2024-05-29 13:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:03:57] [INFO ] [Nat]Absence check using state equation in 11189 ms returned sat
[2024-05-29 13:03:57] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-29 13:03:57] [INFO ] Computed and/alt/rep : 1801/2673/1801 causal constraints (skipped 0 transitions) in 99 ms.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:03:59] [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 EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 16712 reset in 323 ms.
Product exploration explored 100000 steps with 16729 reset in 326 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2012 transition count 1802
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 148 Pre rules applied. Total rules applied 419 place count 2012 transition count 1921
Deduced a syphon composed of 567 places in 2 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 567 place count 2012 transition count 1921
Performed 571 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1138 places in 2 ms
Iterating global reduction 1 with 571 rules applied. Total rules applied 1138 place count 2012 transition count 1922
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2012 transition count 1921
Renaming transitions due to excessive name length > 1024 char.
Discarding 213 places :
Symmetric choice reduction at 2 with 213 rule applications. Total rules 1352 place count 1799 transition count 1707
Deduced a syphon composed of 925 places in 3 ms
Iterating global reduction 2 with 213 rules applied. Total rules applied 1565 place count 1799 transition count 1707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1566 place count 1799 transition count 1707
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1568 place count 1797 transition count 1705
Deduced a syphon composed of 924 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1570 place count 1797 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 1025 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1671 place count 1797 transition count 2133
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1772 place count 1696 transition count 1931
Deduced a syphon composed of 924 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1873 place count 1696 transition count 1931
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 941 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1890 place count 1696 transition count 2004
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1907 place count 1679 transition count 1970
Deduced a syphon composed of 924 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1924 place count 1679 transition count 1970
Deduced a syphon composed of 924 places in 1 ms
Applied a total of 1924 rules in 1362 ms. Remains 1679 /2012 variables (removed 333) and now considering 1970/1802 (removed -168) transitions.
[2024-05-29 13:04:02] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1970 rows 1679 cols
[2024-05-29 13:04:02] [INFO ] Computed 331 invariants in 14 ms
[2024-05-29 13:04:03] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1679/2012 places, 1970/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2543 ms. Remains : 1679/2012 places, 1970/1802 transitions.
Built C files in :
/tmp/ltsmin2536525337845756225
[2024-05-29 13:04:03] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2536525337845756225
Running compilation step : cd /tmp/ltsmin2536525337845756225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2536525337845756225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2536525337845756225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 85 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:04:08] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 13:04:09] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-29 13:04:09] [INFO ] Invariant cache hit.
[2024-05-29 13:04:11] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
[2024-05-29 13:04:11] [INFO ] Invariant cache hit.
[2024-05-29 13:04:12] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3719 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin9691068174018611133
[2024-05-29 13:04:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9691068174018611133
Running compilation step : cd /tmp/ltsmin9691068174018611133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9691068174018611133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9691068174018611133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 13:04:15] [INFO ] Flatten gal took : 69 ms
[2024-05-29 13:04:15] [INFO ] Flatten gal took : 62 ms
[2024-05-29 13:04:15] [INFO ] Time to serialize gal into /tmp/LTL5865979553716771285.gal : 13 ms
[2024-05-29 13:04:15] [INFO ] Time to serialize properties into /tmp/LTL16741390501854460768.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5865979553716771285.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4689075638241819433.hoa' '-atoms' '/tmp/LTL16741390501854460768.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16741390501854460768.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4689075638241819433.hoa
Detected timeout of ITS tools.
[2024-05-29 13:04:30] [INFO ] Flatten gal took : 61 ms
[2024-05-29 13:04:30] [INFO ] Flatten gal took : 51 ms
[2024-05-29 13:04:30] [INFO ] Time to serialize gal into /tmp/LTL12987041819087627421.gal : 9 ms
[2024-05-29 13:04:30] [INFO ] Time to serialize properties into /tmp/LTL981500052408204641.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12987041819087627421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL981500052408204641.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p648==1)")||(X((X((!("((p1891==1)&&(p1932==1))"))||(G(F((G("(p661!=1)"))||(("(p661!=1)")&&(F("(p648!=1)"))))))))U(("(p648==1...264
Formula 0 simplified : XF(!"(p648==1)" & X(!"(p648==1)" W X("((p1891==1)&&(p1932==1))" & G(F!"(p661!=1)" & F(G!"(p648!=1)" | G!"(p661!=1)")))))
Detected timeout of ITS tools.
[2024-05-29 13:04:46] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:04:46] [INFO ] Applying decomposition
[2024-05-29 13:04:46] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11400596299005001963.txt' '-o' '/tmp/graph11400596299005001963.bin' '-w' '/tmp/graph11400596299005001963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11400596299005001963.bin' '-l' '-1' '-v' '-w' '/tmp/graph11400596299005001963.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:04:49] [INFO ] Decomposing Gal with order
[2024-05-29 13:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:04:49] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 13:04:49] [INFO ] Flatten gal took : 132 ms
[2024-05-29 13:04:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 13:04:49] [INFO ] Time to serialize gal into /tmp/LTL1158709685909436913.gal : 20 ms
[2024-05-29 13:04:49] [INFO ] Time to serialize properties into /tmp/LTL17190804520476562509.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1158709685909436913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17190804520476562509.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i10.u199.p648==1)")||(X((X((!("((i25.u580.p1891==1)&&(i25.u593.p1932==1))"))||(G(F((G("(i11.u204.p661!=1)"))||(("(i11.u204.p...372
Formula 0 simplified : XF(!"(i10.u199.p648==1)" & X(!"(i10.u199.p648==1)" W X("((i25.u580.p1891==1)&&(i25.u593.p1932==1))" & G(F!"(i11.u204.p661!=1)" & F(G...206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2172110786431964019
[2024-05-29 13:05:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2172110786431964019
Running compilation step : cd /tmp/ltsmin2172110786431964019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2172110786431964019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2172110786431964019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-030B-LTLFireability-07 finished in 218954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)&&(G(p2)||X(!p0))))'
Support contains 3 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2013 transition count 1803
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2013 transition count 1803
Applied a total of 22 rules in 242 ms. Remains 2013 /2024 variables (removed 11) and now considering 1803/1814 (removed 11) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 13:05:08] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 13:05:09] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-29 13:05:09] [INFO ] Invariant cache hit.
[2024-05-29 13:05:11] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2710 ms to find 0 implicit places.
[2024-05-29 13:05:11] [INFO ] Invariant cache hit.
[2024-05-29 13:05:12] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2024 places, 1803/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4067 ms. Remains : 2013/2024 places, 1803/1814 transitions.
Stuttering acceptance computed with spot in 4626 ms :[(OR (NOT p1) (AND p0 (NOT p2))), p0, (AND (NOT p2) p0), (NOT p2), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={0} source=5 dest: 3}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s216 0), p1:(EQ s1083 1), p0:(NEQ s562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 530 ms.
Product exploration explored 100000 steps with 0 reset in 695 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2013 stabilizing places and 479/1803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (OR (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p1 p0))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p1) p0)), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 279 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:05:18] [INFO ] Invariant cache hit.
[2024-05-29 13:05:18] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:05:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 104 ms returned sat
[2024-05-29 13:05:20] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:20] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 2 ms to minimize.
[2024-05-29 13:05:21] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 1 ms to minimize.
[2024-05-29 13:05:21] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 1 ms to minimize.
[2024-05-29 13:05:22] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 1 ms to minimize.
[2024-05-29 13:05:22] [INFO ] Deduced a trap composed of 20 places in 461 ms of which 1 ms to minimize.
[2024-05-29 13:05:23] [INFO ] Deduced a trap composed of 16 places in 439 ms of which 1 ms to minimize.
[2024-05-29 13:05:23] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 2 ms to minimize.
[2024-05-29 13:05:24] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 1 ms to minimize.
[2024-05-29 13:05:24] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 1 ms to minimize.
[2024-05-29 13:05:25] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2024-05-29 13:05:25] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 1 ms to minimize.
[2024-05-29 13:05:26] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 1 ms to minimize.
[2024-05-29 13:05:26] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 1 ms to minimize.
[2024-05-29 13:05:27] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 1 ms to minimize.
[2024-05-29 13:05:27] [INFO ] Deduced a trap composed of 24 places in 419 ms of which 1 ms to minimize.
[2024-05-29 13:05:28] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 1 ms to minimize.
[2024-05-29 13:05:28] [INFO ] Deduced a trap composed of 19 places in 435 ms of which 1 ms to minimize.
[2024-05-29 13:05:29] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2024-05-29 13:05:29] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 1 ms to minimize.
[2024-05-29 13:05:30] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 1 ms to minimize.
[2024-05-29 13:05:30] [INFO ] Deduced a trap composed of 19 places in 414 ms of which 2 ms to minimize.
[2024-05-29 13:05:30] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 1 ms to minimize.
[2024-05-29 13:05:31] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 1 ms to minimize.
[2024-05-29 13:05:31] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 1 ms to minimize.
[2024-05-29 13:05:32] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 1 ms to minimize.
[2024-05-29 13:05:32] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 1 ms to minimize.
[2024-05-29 13:05:33] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 1 ms to minimize.
[2024-05-29 13:05:33] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2024-05-29 13:05:33] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2024-05-29 13:05:34] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2024-05-29 13:05:34] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 0 ms to minimize.
[2024-05-29 13:05:35] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 1 ms to minimize.
[2024-05-29 13:05:35] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 1 ms to minimize.
[2024-05-29 13:05:35] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 1 ms to minimize.
[2024-05-29 13:05:36] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2024-05-29 13:05:36] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 0 ms to minimize.
[2024-05-29 13:05:36] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2024-05-29 13:05:37] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 0 ms to minimize.
[2024-05-29 13:05:37] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 0 ms to minimize.
[2024-05-29 13:05:37] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 0 ms to minimize.
[2024-05-29 13:05:37] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 0 ms to minimize.
[2024-05-29 13:05:38] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 1 ms to minimize.
[2024-05-29 13:05:38] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 1 ms to minimize.
[2024-05-29 13:05:38] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 0 ms to minimize.
[2024-05-29 13:05:39] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 1 ms to minimize.
[2024-05-29 13:05:39] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 0 ms to minimize.
[2024-05-29 13:05:39] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 0 ms to minimize.
[2024-05-29 13:05:39] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 0 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 1 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 0 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 0 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 1 ms to minimize.
[2024-05-29 13:05:41] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2024-05-29 13:05:41] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 0 ms to minimize.
[2024-05-29 13:05:41] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2024-05-29 13:05:41] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 21629 ms
[2024-05-29 13:05:41] [INFO ] After 22579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-29 13:05:41] [INFO ] After 23024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 2013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2013 transition count 1382
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1592 transition count 1382
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 842 place count 1592 transition count 1144
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1318 place count 1354 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1319 place count 1353 transition count 1143
Iterating global reduction 2 with 1 rules applied. Total rules applied 1320 place count 1353 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1320 place count 1353 transition count 1142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1322 place count 1352 transition count 1142
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2342 place count 842 transition count 632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2343 place count 842 transition count 631
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2345 place count 841 transition count 630
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2521 place count 753 transition count 630
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2522 place count 753 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2523 place count 752 transition count 629
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 2612 place count 752 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2613 place count 751 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2614 place count 750 transition count 628
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2614 place count 750 transition count 626
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2618 place count 748 transition count 626
Applied a total of 2618 rules in 303 ms. Remains 748 /2013 variables (removed 1265) and now considering 626/1803 (removed 1177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 748/2013 places, 626/1803 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294873 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294873 steps, saw 245707 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 748 cols
[2024-05-29 13:05:45] [INFO ] Computed 330 invariants in 6 ms
[2024-05-29 13:05:45] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:05:45] [INFO ] [Nat]Absence check using 330 positive place invariants in 53 ms returned sat
[2024-05-29 13:05:45] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:05:45] [INFO ] After 26ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:45] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:05:45] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-29 13:05:46] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 13:05:46] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 626/626 transitions.
Applied a total of 0 rules in 14 ms. Remains 748 /748 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 748/748 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 626/626 transitions.
Applied a total of 0 rules in 15 ms. Remains 748 /748 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 13:05:46] [INFO ] Invariant cache hit.
[2024-05-29 13:05:46] [INFO ] Implicit Places using invariants in 432 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 434 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 746/748 places, 626/626 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 624
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 624
Applied a total of 4 rules in 27 ms. Remains 744 /746 variables (removed 2) and now considering 624/626 (removed 2) transitions.
// Phase 1: matrix 624 rows 744 cols
[2024-05-29 13:05:46] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:05:47] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-29 13:05:47] [INFO ] Invariant cache hit.
[2024-05-29 13:05:47] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 744/748 places, 624/626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1786 ms. Remains : 744/748 places, 624/626 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306555 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306555 steps, saw 255547 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:05:50] [INFO ] Invariant cache hit.
[2024-05-29 13:05:51] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:05:51] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 13:05:51] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:51] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-29 13:05:51] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 13:05:51] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 624/624 transitions.
Applied a total of 0 rules in 12 ms. Remains 744 /744 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 744/744 places, 624/624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 624/624 transitions.
Applied a total of 0 rules in 24 ms. Remains 744 /744 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2024-05-29 13:05:51] [INFO ] Invariant cache hit.
[2024-05-29 13:05:52] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-29 13:05:52] [INFO ] Invariant cache hit.
[2024-05-29 13:05:53] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2024-05-29 13:05:53] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:05:53] [INFO ] Invariant cache hit.
[2024-05-29 13:05:53] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1716 ms. Remains : 744/744 places, 624/624 transitions.
Partial Free-agglomeration rule applied 174 times.
Drop transitions removed 174 transitions
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 744 transition count 624
Applied a total of 174 rules in 33 ms. Remains 744 /744 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 624 rows 744 cols
[2024-05-29 13:05:53] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:05:53] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:05:53] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 13:05:54] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:54] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-29 13:05:54] [INFO ] After 65ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:05:54] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 13:05:54] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2024-05-29 13:05:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2024-05-29 13:05:54] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 13:05:54] [INFO ] After 985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (OR (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p1 p0))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p1) p0)), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p2 (NOT p1)))), (F (AND p0 p2 p1)), (F (OR (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 566 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 13:05:55] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 13:05:56] [INFO ] [Real]Absence check using 331 positive place invariants in 434 ms returned sat
[2024-05-29 13:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:06:08] [INFO ] [Real]Absence check using state equation in 11370 ms returned sat
[2024-05-29 13:06:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:06:09] [INFO ] [Nat]Absence check using 331 positive place invariants in 461 ms returned sat
[2024-05-29 13:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:06:21] [INFO ] [Nat]Absence check using state equation in 11813 ms returned sat
[2024-05-29 13:06:21] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2024-05-29 13:06:22] [INFO ] Computed and/alt/rep : 1802/2675/1802 causal constraints (skipped 0 transitions) in 107 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 13:06:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 2013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2012 transition count 1383
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1593 transition count 1383
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 838 place count 1593 transition count 1144
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1316 place count 1354 transition count 1144
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2330 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2331 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2333 place count 846 transition count 635
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2509 place count 758 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2511 place count 756 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 755 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2512 place count 755 transition count 631
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 2516 place count 753 transition count 631
Applied a total of 2516 rules in 192 ms. Remains 753 /2013 variables (removed 1260) and now considering 631/1803 (removed 1172) transitions.
// Phase 1: matrix 631 rows 753 cols
[2024-05-29 13:06:23] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 13:06:24] [INFO ] Implicit Places using invariants in 412 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 413 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2013 places, 631/1803 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 629
Applied a total of 4 rules in 23 ms. Remains 749 /751 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 749 cols
[2024-05-29 13:06:24] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:06:24] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-29 13:06:24] [INFO ] Invariant cache hit.
[2024-05-29 13:06:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:06:25] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2013 places, 629/1803 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1950 ms. Remains : 749/2013 places, 629/1803 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/749 stabilizing places and 4/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), true, (X (X p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2)))))]
Property proved to be false thanks to negative knowledge :(X (OR (NOT p0) (NOT p2)))
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLFireability-09 finished in 77613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2023 transition count 1392
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1602 transition count 1392
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 232 Pre rules applied. Total rules applied 842 place count 1602 transition count 1160
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 2 with 464 rules applied. Total rules applied 1306 place count 1370 transition count 1160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1316 place count 1360 transition count 1150
Iterating global reduction 2 with 10 rules applied. Total rules applied 1326 place count 1360 transition count 1150
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1326 place count 1360 transition count 1140
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1346 place count 1350 transition count 1140
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2360 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2361 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2363 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2541 place count 753 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2543 place count 751 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2544 place count 750 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2544 place count 750 transition count 627
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2548 place count 748 transition count 627
Applied a total of 2548 rules in 328 ms. Remains 748 /2024 variables (removed 1276) and now considering 627/1814 (removed 1187) transitions.
// Phase 1: matrix 627 rows 748 cols
[2024-05-29 13:06:26] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 13:06:26] [INFO ] Implicit Places using invariants in 399 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 400 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 746/2024 places, 627/1814 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 27 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2024-05-29 13:06:26] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:06:26] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-29 13:06:26] [INFO ] Invariant cache hit.
[2024-05-29 13:06:27] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 744/2024 places, 625/1814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1968 ms. Remains : 744/2024 places, 625/1814 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s469 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 505 ms.
Stack based approach found an accepted trace after 2815 steps with 0 reset with depth 2816 and stack size 2606 in 18 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-10 finished in 2542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2012 transition count 1802
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2012 transition count 1802
Applied a total of 24 rules in 216 ms. Remains 2012 /2024 variables (removed 12) and now considering 1802/1814 (removed 12) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:06:28] [INFO ] Computed 331 invariants in 10 ms
[2024-05-29 13:06:29] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-29 13:06:29] [INFO ] Invariant cache hit.
[2024-05-29 13:06:30] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2024-05-29 13:06:30] [INFO ] Invariant cache hit.
[2024-05-29 13:06:32] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2024 places, 1802/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3777 ms. Remains : 2012/2024 places, 1802/1814 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s930 0), p0:(EQ s353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 518 ms.
Product exploration explored 100000 steps with 0 reset in 676 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 138191 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138191 steps, saw 91828 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:06:36] [INFO ] Invariant cache hit.
[2024-05-29 13:06:37] [INFO ] [Real]Absence check using 331 positive place invariants in 104 ms returned sat
[2024-05-29 13:06:38] [INFO ] After 856ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-29 13:06:38] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 1 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 1 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 2 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 2 ms to minimize.
[2024-05-29 13:06:40] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2024-05-29 13:06:40] [INFO ] Deduced a trap composed of 25 places in 373 ms of which 1 ms to minimize.
[2024-05-29 13:06:41] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2024-05-29 13:06:41] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 1 ms to minimize.
[2024-05-29 13:06:42] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 0 ms to minimize.
[2024-05-29 13:06:42] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 1 ms to minimize.
[2024-05-29 13:06:42] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 1 ms to minimize.
[2024-05-29 13:06:43] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 1 ms to minimize.
[2024-05-29 13:06:43] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 0 ms to minimize.
[2024-05-29 13:06:44] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 0 ms to minimize.
[2024-05-29 13:06:44] [INFO ] Deduced a trap composed of 43 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:06:44] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 1 ms to minimize.
[2024-05-29 13:06:45] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 1 ms to minimize.
[2024-05-29 13:06:45] [INFO ] Deduced a trap composed of 51 places in 302 ms of which 1 ms to minimize.
[2024-05-29 13:06:45] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 1 ms to minimize.
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 1 ms to minimize.
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 1 ms to minimize.
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 2 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 1 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 6 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 0 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 0 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12570 ms
[2024-05-29 13:06:50] [INFO ] After 13486ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:06:50] [INFO ] After 13941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:06:51] [INFO ] [Nat]Absence check using 331 positive place invariants in 112 ms returned sat
[2024-05-29 13:06:52] [INFO ] After 1065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:06:52] [INFO ] Deduced a trap composed of 23 places in 396 ms of which 1 ms to minimize.
[2024-05-29 13:06:53] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 1 ms to minimize.
[2024-05-29 13:06:53] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2024-05-29 13:06:54] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2024-05-29 13:06:54] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 1 ms to minimize.
[2024-05-29 13:06:55] [INFO ] Deduced a trap composed of 24 places in 399 ms of which 2 ms to minimize.
[2024-05-29 13:06:55] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 1 ms to minimize.
[2024-05-29 13:06:55] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 2 ms to minimize.
[2024-05-29 13:06:56] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2024-05-29 13:06:56] [INFO ] Deduced a trap composed of 26 places in 361 ms of which 1 ms to minimize.
[2024-05-29 13:06:57] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2024-05-29 13:06:57] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2024-05-29 13:06:58] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 1 ms to minimize.
[2024-05-29 13:06:58] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 1 ms to minimize.
[2024-05-29 13:06:58] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 0 ms to minimize.
[2024-05-29 13:06:59] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2024-05-29 13:06:59] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 1 ms to minimize.
[2024-05-29 13:06:59] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 1 ms to minimize.
[2024-05-29 13:07:00] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 1 ms to minimize.
[2024-05-29 13:07:00] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 1 ms to minimize.
[2024-05-29 13:07:00] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 0 ms to minimize.
[2024-05-29 13:07:01] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 1 ms to minimize.
[2024-05-29 13:07:01] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2024-05-29 13:07:01] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 0 ms to minimize.
[2024-05-29 13:07:02] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2024-05-29 13:07:02] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2024-05-29 13:07:02] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2024-05-29 13:07:02] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2024-05-29 13:07:03] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2024-05-29 13:07:03] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2024-05-29 13:07:03] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 1 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 0 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2024-05-29 13:07:06] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:07:06] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:07:06] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2024-05-29 13:07:06] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:07:06] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:07:07] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 15609 ms
[2024-05-29 13:07:08] [INFO ] After 17069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 245 ms.
[2024-05-29 13:07:08] [INFO ] After 17846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 248 ms.
Support contains 2 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2012 transition count 1384
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 836 place count 1594 transition count 1145
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1314 place count 1355 transition count 1145
Performed 512 Post agglomeration using F-continuation condition.Transition count delta: 512
Deduced a syphon composed of 512 places in 0 ms
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 2 with 1024 rules applied. Total rules applied 2338 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 842 transition count 631
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2517 place count 754 transition count 631
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2606 place count 754 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2607 place count 753 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2608 place count 752 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2608 place count 752 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2612 place count 750 transition count 628
Applied a total of 2612 rules in 223 ms. Remains 750 /2012 variables (removed 1262) and now considering 628/1802 (removed 1174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 750/2012 places, 628/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 168475 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168475 steps, saw 140461 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 628 rows 750 cols
[2024-05-29 13:07:12] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 13:07:12] [INFO ] [Real]Absence check using 330 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:12] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:13] [INFO ] [Nat]Absence check using 330 positive place invariants in 54 ms returned sat
[2024-05-29 13:07:13] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:07:13] [INFO ] After 100ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-29 13:07:13] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-29 13:07:13] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 628/628 transitions.
Applied a total of 0 rules in 13 ms. Remains 750 /750 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 750/750 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 750 /750 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-29 13:07:14] [INFO ] Invariant cache hit.
[2024-05-29 13:07:14] [INFO ] Implicit Places using invariants in 402 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 403 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 748/750 places, 628/628 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 746 transition count 626
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 746 transition count 626
Applied a total of 4 rules in 23 ms. Remains 746 /748 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 746 cols
[2024-05-29 13:07:14] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:07:14] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-29 13:07:14] [INFO ] Invariant cache hit.
[2024-05-29 13:07:15] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 746/750 places, 626/628 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1566 ms. Remains : 746/750 places, 626/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 161979 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161979 steps, saw 134621 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:07:18] [INFO ] Invariant cache hit.
[2024-05-29 13:07:19] [INFO ] [Real]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 13:07:19] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:19] [INFO ] [Nat]Absence check using 328 positive place invariants in 56 ms returned sat
[2024-05-29 13:07:20] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:20] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-29 13:07:20] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-29 13:07:20] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 626/626 transitions.
Applied a total of 0 rules in 14 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 746/746 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 13:07:20] [INFO ] Invariant cache hit.
[2024-05-29 13:07:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 13:07:20] [INFO ] Invariant cache hit.
[2024-05-29 13:07:21] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2024-05-29 13:07:21] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:07:21] [INFO ] Invariant cache hit.
[2024-05-29 13:07:22] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1696 ms. Remains : 746/746 places, 626/626 transitions.
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 0 with 173 rules applied. Total rules applied 173 place count 746 transition count 626
Applied a total of 173 rules in 30 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 626 rows 746 cols
[2024-05-29 13:07:22] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:07:22] [INFO ] [Real]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 13:07:22] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:22] [INFO ] [Nat]Absence check using 328 positive place invariants in 61 ms returned sat
[2024-05-29 13:07:23] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:23] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-05-29 13:07:23] [INFO ] After 185ms SMT Verify possible using 171 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:23] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-05-29 13:07:23] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-29 13:07:24] [INFO ] After 1300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2011 transition count 1383
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 1593 transition count 1383
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 836 place count 1593 transition count 1144
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1314 place count 1354 transition count 1144
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2334 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2335 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2337 place count 843 transition count 632
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2513 place count 755 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2515 place count 753 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2516 place count 752 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2516 place count 752 transition count 628
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 2520 place count 750 transition count 628
Applied a total of 2520 rules in 230 ms. Remains 750 /2012 variables (removed 1262) and now considering 628/1802 (removed 1174) transitions.
// Phase 1: matrix 628 rows 750 cols
[2024-05-29 13:07:24] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 13:07:25] [INFO ] Implicit Places using invariants in 432 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2012 places, 628/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 626
Applied a total of 4 rules in 23 ms. Remains 746 /748 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 746 cols
[2024-05-29 13:07:25] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:07:25] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-29 13:07:25] [INFO ] Invariant cache hit.
[2024-05-29 13:07:26] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2012 places, 626/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1890 ms. Remains : 746/2012 places, 626/1802 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 181837 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181837 steps, saw 131008 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:07:29] [INFO ] Invariant cache hit.
[2024-05-29 13:07:30] [INFO ] [Real]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 13:07:30] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:30] [INFO ] [Nat]Absence check using 328 positive place invariants in 45 ms returned sat
[2024-05-29 13:07:30] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:31] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-29 13:07:31] [INFO ] After 829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 626/626 transitions.
Applied a total of 0 rules in 12 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 746/746 places, 626/626 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 179028 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179028 steps, saw 129018 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:07:34] [INFO ] Invariant cache hit.
[2024-05-29 13:07:34] [INFO ] [Real]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 13:07:35] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:35] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:35] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:35] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-29 13:07:35] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 626/626 transitions.
Applied a total of 0 rules in 11 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 746/746 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 626/626 transitions.
Applied a total of 0 rules in 14 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 13:07:36] [INFO ] Invariant cache hit.
[2024-05-29 13:07:36] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 13:07:36] [INFO ] Invariant cache hit.
[2024-05-29 13:07:37] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2024-05-29 13:07:37] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 13:07:37] [INFO ] Invariant cache hit.
[2024-05-29 13:07:37] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1510 ms. Remains : 746/746 places, 626/626 transitions.
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 0 with 173 rules applied. Total rules applied 173 place count 746 transition count 626
Applied a total of 173 rules in 38 ms. Remains 746 /746 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 626 rows 746 cols
[2024-05-29 13:07:37] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:07:37] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:38] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:07:38] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 13:07:38] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:07:38] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-29 13:07:38] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 37655 steps with 0 reset with depth 37656 and stack size 15162 in 267 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-11 finished in 71922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p0) U p1)) U (p2&&F(p3))))'
Support contains 4 out of 2024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2023 transition count 1396
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1606 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1605 transition count 1395
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 836 place count 1605 transition count 1162
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1302 place count 1372 transition count 1162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1312 place count 1362 transition count 1152
Iterating global reduction 3 with 10 rules applied. Total rules applied 1322 place count 1362 transition count 1152
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1322 place count 1362 transition count 1142
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1342 place count 1352 transition count 1142
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2352 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2353 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2355 place count 846 transition count 635
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2529 place count 759 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2531 place count 757 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2532 place count 756 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2532 place count 756 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2536 place count 754 transition count 631
Applied a total of 2536 rules in 272 ms. Remains 754 /2024 variables (removed 1270) and now considering 631/1814 (removed 1183) transitions.
// Phase 1: matrix 631 rows 754 cols
[2024-05-29 13:07:40] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 13:07:40] [INFO ] Implicit Places using invariants in 402 ms returned [737, 741]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 412 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/2024 places, 631/1814 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 750 transition count 629
Applied a total of 4 rules in 22 ms. Remains 750 /752 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 750 cols
[2024-05-29 13:07:40] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:07:41] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-29 13:07:41] [INFO ] Invariant cache hit.
[2024-05-29 13:07:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:07:42] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 750/2024 places, 629/1814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1902 ms. Remains : 750/2024 places, 629/1814 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p3)), true, p0, (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s654 1), p1:(NEQ s556 1), p0:(AND (EQ s654 1) (EQ s25 1)), p3:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 685 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/750 stabilizing places and 2/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (OR p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 19 factoid took 260 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p3)), true, p0, (NOT p1), (NOT p1), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:07:44] [INFO ] Invariant cache hit.
[2024-05-29 13:07:44] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:44] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-29 13:07:44] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 13:07:45] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-29 13:07:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:07:45] [INFO ] After 79ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-29 13:07:45] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-29 13:07:45] [INFO ] After 793ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 629/629 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 749 transition count 628
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 749 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 748 transition count 627
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 748 transition count 627
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 747 transition count 626
Applied a total of 8 rules in 60 ms. Remains 747 /750 variables (removed 3) and now considering 626/629 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 747/750 places, 626/629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 241827 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241827 steps, saw 177099 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 626 rows 747 cols
[2024-05-29 13:07:48] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 13:07:49] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:49] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:07:49] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:49] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:07:50] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 13:07:50] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 747 /747 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 747/747 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 626/626 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 13:07:50] [INFO ] Invariant cache hit.
[2024-05-29 13:07:50] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 13:07:50] [INFO ] Invariant cache hit.
[2024-05-29 13:07:51] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2024-05-29 13:07:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 13:07:51] [INFO ] Invariant cache hit.
[2024-05-29 13:07:51] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1523 ms. Remains : 747/747 places, 626/626 transitions.
Partial Free-agglomeration rule applied 171 times.
Drop transitions removed 171 transitions
Iterating global reduction 0 with 171 rules applied. Total rules applied 171 place count 747 transition count 626
Applied a total of 171 rules in 28 ms. Remains 747 /747 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 626 rows 747 cols
[2024-05-29 13:07:51] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:07:51] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 13:07:52] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:07:52] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 13:07:52] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:07:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 13:07:52] [INFO ] After 87ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 13:07:52] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 13:07:53] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (OR p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p3))), (X (X p3)), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p3)]
Knowledge based reduction with 20 factoid took 481 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p3)), true, p0, (NOT p1), (NOT p1), (NOT p3)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p3)), true, p0, (NOT p1), (NOT p1), (NOT p3)]
// Phase 1: matrix 629 rows 750 cols
[2024-05-29 13:07:53] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 13:07:54] [INFO ] [Real]Absence check using 328 positive place invariants in 123 ms returned unsat
Proved EG (NOT p2)
[2024-05-29 13:07:54] [INFO ] Invariant cache hit.
[2024-05-29 13:07:55] [INFO ] [Real]Absence check using 328 positive place invariants in 169 ms returned sat
[2024-05-29 13:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:07:56] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2024-05-29 13:07:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:07:56] [INFO ] [Nat]Absence check using 328 positive place invariants in 161 ms returned sat
[2024-05-29 13:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:07:57] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2024-05-29 13:07:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 13:07:57] [INFO ] [Nat]Added 7 Read/Feed constraints in 18 ms returned sat
[2024-05-29 13:07:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:07:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:07:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-29 13:07:57] [INFO ] Computed and/alt/rep : 624/1010/624 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-29 13:08:03] [INFO ] Added : 530 causal constraints over 106 iterations in 6063 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (OR p1 (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p3))), (X (X p3)), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p3), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 20 factoid took 538 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLFireability-12 finished in 24360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2023 transition count 1392
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1602 transition count 1392
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 842 place count 1602 transition count 1161
Deduced a syphon composed of 231 places in 1 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 2 with 462 rules applied. Total rules applied 1304 place count 1371 transition count 1161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1315 place count 1360 transition count 1150
Iterating global reduction 2 with 11 rules applied. Total rules applied 1326 place count 1360 transition count 1150
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1326 place count 1360 transition count 1139
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1348 place count 1349 transition count 1139
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2358 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2359 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2361 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2539 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2541 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2542 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2542 place count 751 transition count 628
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 2546 place count 749 transition count 628
Applied a total of 2546 rules in 273 ms. Remains 749 /2024 variables (removed 1275) and now considering 628/1814 (removed 1186) transitions.
// Phase 1: matrix 628 rows 749 cols
[2024-05-29 13:08:04] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 13:08:05] [INFO ] Implicit Places using invariants in 422 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 423 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2024 places, 628/1814 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 23 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 13:08:05] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 13:08:05] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-29 13:08:05] [INFO ] Invariant cache hit.
[2024-05-29 13:08:06] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2024 places, 626/1814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1868 ms. Remains : 745/2024 places, 626/1814 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s286 1) (EQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 502 ms.
Stack based approach found an accepted trace after 363 steps with 0 reset with depth 364 and stack size 364 in 3 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-13 finished in 2426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)&&(p2||F(G(p0)))))))'
Support contains 4 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2011 transition count 1801
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2011 transition count 1801
Applied a total of 26 rules in 239 ms. Remains 2011 /2024 variables (removed 13) and now considering 1801/1814 (removed 13) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2024-05-29 13:08:07] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 13:08:07] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-29 13:08:07] [INFO ] Invariant cache hit.
[2024-05-29 13:08:09] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2024-05-29 13:08:09] [INFO ] Invariant cache hit.
[2024-05-29 13:08:10] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2024 places, 1801/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3863 ms. Remains : 2011/2024 places, 1801/1814 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s304 1), p0:(EQ s306 1), p2:(AND (EQ s1058 1) (EQ s1107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-14 finished in 4053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 2024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2024/2024 places, 1814/1814 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2012 transition count 1802
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2012 transition count 1802
Applied a total of 24 rules in 229 ms. Remains 2012 /2024 variables (removed 12) and now considering 1802/1814 (removed 12) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 13:08:11] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 13:08:11] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-29 13:08:11] [INFO ] Invariant cache hit.
[2024-05-29 13:08:13] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2024-05-29 13:08:13] [INFO ] Invariant cache hit.
[2024-05-29 13:08:14] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2024 places, 1802/1814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3897 ms. Remains : 2012/2024 places, 1802/1814 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1480 1), p1:(EQ s1777 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-15 finished in 4072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X((!p1||G(F((G(p2)||(p2&&F(!p0))))))) U (p0&&X((!p1||G(F((G(p2)||(p2&&F(!p0))))))))))))))'
[2024-05-29 13:08:15] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6809459950219822288
[2024-05-29 13:08:15] [INFO ] Too many transitions (1814) to apply POR reductions. Disabling POR matrices.
[2024-05-29 13:08:15] [INFO ] Applying decomposition
[2024-05-29 13:08:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6809459950219822288
Running compilation step : cd /tmp/ltsmin6809459950219822288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 13:08:15] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17741079237103875860.txt' '-o' '/tmp/graph17741079237103875860.bin' '-w' '/tmp/graph17741079237103875860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17741079237103875860.bin' '-l' '-1' '-v' '-w' '/tmp/graph17741079237103875860.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:08:15] [INFO ] Decomposing Gal with order
[2024-05-29 13:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:08:15] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-29 13:08:15] [INFO ] Flatten gal took : 158 ms
[2024-05-29 13:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 13:08:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16061991091982687437.gal : 31 ms
[2024-05-29 13:08:15] [INFO ] Time to serialize properties into /tmp/LTLFireability2591713874742563004.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16061991091982687437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2591713874742563004.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i8.i0.i1.u206.p648==1)")||(X((X((!("((i24.u594.p1891==1)&&(i24.u607.p1932==1))"))||(G(F((G("(i9.u212.p661!=1)"))||(("(i9.u21...388
Formula 0 simplified : XF(!"(i8.i0.i1.u206.p648==1)" & X(!"(i8.i0.i1.u206.p648==1)" W X("((i24.u594.p1891==1)&&(i24.u607.p1932==1))" & G(F!"(i9.u212.p661!=...219
Compilation finished in 3653 ms.
Running link step : cd /tmp/ltsmin6809459950219822288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6809459950219822288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X((X((!(LTLAPp1==true)||[](<>(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>(!(LTLAPp0==true)))))))) U ((LTLAPp0==true)&&X((!(LTLAPp1==true)||[](<>(([]((LTLAPp2==true))||((LTLAPp2==true)&&<>(!(LTLAPp0==true))))))))))))))' '--buchi-type=spotba'
LTSmin run took 6791 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 723347 ms.
BK_STOP 1716988107072
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ShieldPPPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789200408"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;