About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S24C07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.231 | 3600000.00 | 7682575.00 | 82914.20 | F??F?FFFTF??FFFF | 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.r263-tall-171654372000063.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 MultiCrashLeafsetExtension-PT-S24C07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 12 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716640948198
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=MultiCrashLeafsetExtension-PT-S24C07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:42:29] [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-25 12:42:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:42:30] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2024-05-25 12:42:30] [INFO ] Transformed 13822 places.
[2024-05-25 12:42:30] [INFO ] Transformed 20365 transitions.
[2024-05-25 12:42:30] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 13822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 13780 transition count 20365
Discarding 4180 places :
Symmetric choice reduction at 1 with 4180 rule applications. Total rules 4222 place count 9600 transition count 16185
Iterating global reduction 1 with 4180 rules applied. Total rules applied 8402 place count 9600 transition count 16185
Discarding 3838 places :
Symmetric choice reduction at 1 with 3838 rule applications. Total rules 12240 place count 5762 transition count 12347
Iterating global reduction 1 with 3838 rules applied. Total rules applied 16078 place count 5762 transition count 12347
Discarding 534 places :
Symmetric choice reduction at 1 with 534 rule applications. Total rules 16612 place count 5228 transition count 8609
Iterating global reduction 1 with 534 rules applied. Total rules applied 17146 place count 5228 transition count 8609
Applied a total of 17146 rules in 4685 ms. Remains 5228 /13822 variables (removed 8594) and now considering 8609/20365 (removed 11756) transitions.
[2024-05-25 12:42:35] [INFO ] Flow matrix only has 8009 transitions (discarded 600 similar events)
// Phase 1: matrix 8009 rows 5228 cols
[2024-05-25 12:42:35] [INFO ] Computed 1041 invariants in 384 ms
[2024-05-25 12:42:39] [INFO ] Implicit Places using invariants in 4081 ms returned []
[2024-05-25 12:42:39] [INFO ] Flow matrix only has 8009 transitions (discarded 600 similar events)
[2024-05-25 12:42:39] [INFO ] Invariant cache hit.
[2024-05-25 12:42:43] [INFO ] Implicit Places using invariants and state equation in 3763 ms returned []
Implicit Place search using SMT with State Equation took 7877 ms to find 0 implicit places.
[2024-05-25 12:42:43] [INFO ] Flow matrix only has 8009 transitions (discarded 600 similar events)
[2024-05-25 12:42:43] [INFO ] Invariant cache hit.
[2024-05-25 12:42:48] [INFO ] Dead Transitions using invariants and state equation in 5653 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5228/13822 places, 8609/20365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18221 ms. Remains : 5228/13822 places, 8609/20365 transitions.
Support contains 54 out of 5228 places after structural reductions.
[2024-05-25 12:42:49] [INFO ] Flatten gal took : 477 ms
[2024-05-25 12:42:50] [INFO ] Flatten gal took : 304 ms
[2024-05-25 12:42:50] [INFO ] Input system was already deterministic with 8609 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 31) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-25 12:42:51] [INFO ] Flow matrix only has 8009 transitions (discarded 600 similar events)
[2024-05-25 12:42:51] [INFO ] Invariant cache hit.
[2024-05-25 12:42:53] [INFO ] [Real]Absence check using 49 positive place invariants in 101 ms returned sat
[2024-05-25 12:42:53] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 316 ms returned sat
[2024-05-25 12:43:05] [INFO ] After 10160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:9
[2024-05-25 12:43:05] [INFO ] State equation strengthened by 2998 read => feed constraints.
[2024-05-25 12:43:09] [INFO ] After 3590ms SMT Verify possible using 2998 Read/Feed constraints in real domain returned unsat :3 sat :0 real:16
[2024-05-25 12:43:09] [INFO ] After 17593ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:16
[2024-05-25 12:43:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-05-25 12:43:11] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 301 ms returned sat
[2024-05-25 12:43:23] [INFO ] After 11234ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :16
[2024-05-25 12:43:34] [INFO ] After 10718ms SMT Verify possible using 2998 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2024-05-25 12:43:34] [INFO ] After 10721ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 12:43:34] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 34 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5228 transition count 8606
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 5225 transition count 8606
Performed 361 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 361 Pre rules applied. Total rules applied 6 place count 5225 transition count 8245
Deduced a syphon composed of 361 places in 7 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 728 place count 4864 transition count 8245
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 730 place count 4862 transition count 8243
Iterating global reduction 2 with 2 rules applied. Total rules applied 732 place count 4862 transition count 8243
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 734 place count 4860 transition count 8229
Iterating global reduction 2 with 2 rules applied. Total rules applied 736 place count 4860 transition count 8229
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 19 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 792 place count 4832 transition count 8201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 795 place count 4829 transition count 8198
Iterating global reduction 2 with 3 rules applied. Total rules applied 798 place count 4829 transition count 8198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 798 place count 4829 transition count 8196
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 802 place count 4827 transition count 8196
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 805 place count 4824 transition count 8175
Iterating global reduction 2 with 3 rules applied. Total rules applied 808 place count 4824 transition count 8175
Free-agglomeration rule (complex) applied 322 times.
Iterating global reduction 2 with 322 rules applied. Total rules applied 1130 place count 4824 transition count 11087
Reduce places removed 322 places and 0 transitions.
Iterating post reduction 2 with 322 rules applied. Total rules applied 1452 place count 4502 transition count 11087
Partial Free-agglomeration rule applied 146 times.
Drop transitions removed 146 transitions
Iterating global reduction 3 with 146 rules applied. Total rules applied 1598 place count 4502 transition count 11087
Applied a total of 1598 rules in 5850 ms. Remains 4502 /5228 variables (removed 726) and now considering 11087/8609 (removed -2478) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5854 ms. Remains : 4502/5228 places, 11087/8609 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :1
Running SMT prover for 14 properties.
[2024-05-25 12:43:41] [INFO ] Flow matrix only has 10222 transitions (discarded 865 similar events)
// Phase 1: matrix 10222 rows 4502 cols
[2024-05-25 12:43:41] [INFO ] Computed 1041 invariants in 244 ms
[2024-05-25 12:43:42] [INFO ] [Real]Absence check using 49 positive place invariants in 55 ms returned sat
[2024-05-25 12:43:42] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 299 ms returned sat
[2024-05-25 12:43:53] [INFO ] After 10222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:11
[2024-05-25 12:43:54] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:43:56] [INFO ] After 2628ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-25 12:43:56] [INFO ] After 15438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-25 12:43:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:43:58] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 276 ms returned sat
[2024-05-25 12:44:10] [INFO ] After 11459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-25 12:44:21] [INFO ] After 11229ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-25 12:44:21] [INFO ] After 11230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 12:44:21] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 30 out of 4502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4502/4502 places, 11087/11087 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4502 transition count 11085
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4500 transition count 11085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 4500 transition count 11084
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4499 transition count 11084
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 4498 transition count 11083
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 4498 transition count 11083
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 4498 transition count 11082
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4497 transition count 11082
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 4497 transition count 11080
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 4495 transition count 11080
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 4493 transition count 11078
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 4493 transition count 11078
Applied a total of 18 rules in 2229 ms. Remains 4493 /4502 variables (removed 9) and now considering 11078/11087 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2229 ms. Remains : 4493/4502 places, 11078/11087 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-25 12:44:25] [INFO ] Flow matrix only has 10213 transitions (discarded 865 similar events)
// Phase 1: matrix 10213 rows 4493 cols
[2024-05-25 12:44:26] [INFO ] Computed 1041 invariants in 260 ms
[2024-05-25 12:44:27] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:44:27] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 272 ms returned sat
[2024-05-25 12:44:36] [INFO ] After 10666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 12:44:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:44:38] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 280 ms returned sat
[2024-05-25 12:44:47] [INFO ] After 8761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-25 12:44:47] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:45:01] [INFO ] After 14107ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-25 12:45:01] [INFO ] After 14109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 12:45:01] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 23 out of 4493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4493/4493 places, 11078/11078 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4492 transition count 11077
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 4492 transition count 11055
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 46 place count 4470 transition count 11055
Applied a total of 46 rules in 1677 ms. Remains 4470 /4493 variables (removed 23) and now considering 11055/11078 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1678 ms. Remains : 4470/4493 places, 11055/11078 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2604 stabilizing places and 3408 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' '!((F(p0)&&((F(p1)&&X(F(p0))) U p1)))'
Support contains 6 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 365 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 365 Pre rules applied. Total rules applied 12 place count 5222 transition count 8238
Deduced a syphon composed of 365 places in 5 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 742 place count 4857 transition count 8238
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 752 place count 4847 transition count 8204
Iterating global reduction 2 with 10 rules applied. Total rules applied 762 place count 4847 transition count 8204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 762 place count 4847 transition count 8201
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 768 place count 4844 transition count 8201
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 774 place count 4838 transition count 8159
Iterating global reduction 2 with 6 rules applied. Total rules applied 780 place count 4838 transition count 8159
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 840 place count 4808 transition count 8129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 846 place count 4802 transition count 8123
Iterating global reduction 2 with 6 rules applied. Total rules applied 852 place count 4802 transition count 8123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 852 place count 4802 transition count 8118
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 862 place count 4797 transition count 8118
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 868 place count 4791 transition count 8076
Iterating global reduction 2 with 6 rules applied. Total rules applied 874 place count 4791 transition count 8076
Applied a total of 874 rules in 3611 ms. Remains 4791 /5228 variables (removed 437) and now considering 8076/8609 (removed 533) transitions.
[2024-05-25 12:45:07] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
// Phase 1: matrix 7476 rows 4791 cols
[2024-05-25 12:45:07] [INFO ] Computed 1041 invariants in 189 ms
[2024-05-25 12:45:11] [INFO ] Implicit Places using invariants in 3664 ms returned []
[2024-05-25 12:45:11] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
[2024-05-25 12:45:11] [INFO ] Invariant cache hit.
[2024-05-25 12:45:16] [INFO ] Implicit Places using invariants and state equation in 5432 ms returned []
Implicit Place search using SMT with State Equation took 9101 ms to find 0 implicit places.
[2024-05-25 12:45:17] [INFO ] Redundant transitions in 966 ms returned []
[2024-05-25 12:45:17] [INFO ] Flow matrix only has 7476 transitions (discarded 600 similar events)
[2024-05-25 12:45:17] [INFO ] Invariant cache hit.
[2024-05-25 12:45:23] [INFO ] Dead Transitions using invariants and state equation in 5524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4791/5228 places, 8076/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19212 ms. Remains : 4791/5228 places, 8076/8609 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 213 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s1378 1) (GEQ s1379 1) (GEQ s1894 1)), p1:(AND (GEQ s1011 1) (GEQ s2522 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, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00 finished in 19647 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 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 364 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 364 Pre rules applied. Total rules applied 12 place count 5222 transition count 8239
Deduced a syphon composed of 364 places in 5 ms
Reduce places removed 364 places and 0 transitions.
Iterating global reduction 2 with 728 rules applied. Total rules applied 740 place count 4858 transition count 8239
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 749 place count 4849 transition count 8206
Iterating global reduction 2 with 9 rules applied. Total rules applied 758 place count 4849 transition count 8206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 758 place count 4849 transition count 8204
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 762 place count 4847 transition count 8204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 767 place count 4842 transition count 8169
Iterating global reduction 2 with 5 rules applied. Total rules applied 772 place count 4842 transition count 8169
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 832 place count 4812 transition count 8139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 838 place count 4806 transition count 8133
Iterating global reduction 2 with 6 rules applied. Total rules applied 844 place count 4806 transition count 8133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 844 place count 4806 transition count 8128
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 854 place count 4801 transition count 8128
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 860 place count 4795 transition count 8086
Iterating global reduction 2 with 6 rules applied. Total rules applied 866 place count 4795 transition count 8086
Applied a total of 866 rules in 3508 ms. Remains 4795 /5228 variables (removed 433) and now considering 8086/8609 (removed 523) transitions.
[2024-05-25 12:45:26] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:45:27] [INFO ] Computed 1041 invariants in 197 ms
[2024-05-25 12:45:31] [INFO ] Implicit Places using invariants in 4089 ms returned []
[2024-05-25 12:45:31] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:45:31] [INFO ] Invariant cache hit.
[2024-05-25 12:45:34] [INFO ] Implicit Places using invariants and state equation in 3919 ms returned []
Implicit Place search using SMT with State Equation took 8010 ms to find 0 implicit places.
[2024-05-25 12:45:35] [INFO ] Redundant transitions in 893 ms returned []
[2024-05-25 12:45:35] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:45:35] [INFO ] Invariant cache hit.
[2024-05-25 12:45:40] [INFO ] Dead Transitions using invariants and state equation in 4720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4795/5228 places, 8086/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17140 ms. Remains : 4795/5228 places, 8086/8609 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1631 1) (LT s1663 1)) (OR (LT s2277 1) (LT s2335 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 1975 reset in 1405 ms.
Product exploration explored 100000 steps with 1973 reset in 1335 ms.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 197 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25265 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25265 steps, saw 11828 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:45:46] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:45:46] [INFO ] Invariant cache hit.
[2024-05-25 12:45:47] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 12:45:47] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 299 ms returned sat
[2024-05-25 12:45:51] [INFO ] After 4118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:45:51] [INFO ] State equation strengthened by 2908 read => feed constraints.
[2024-05-25 12:45:52] [INFO ] After 415ms SMT Verify possible using 2908 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:45:52] [INFO ] After 5505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:45:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 12:45:53] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 294 ms returned sat
[2024-05-25 12:45:57] [INFO ] After 4271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:46:01] [INFO ] After 4499ms SMT Verify possible using 2908 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:46:06] [INFO ] Deduced a trap composed of 576 places in 4782 ms of which 19 ms to minimize.
[2024-05-25 12:46:12] [INFO ] Deduced a trap composed of 241 places in 5056 ms of which 5 ms to minimize.
[2024-05-25 12:46:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10557 ms
[2024-05-25 12:46:12] [INFO ] After 15207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-25 12:46:12] [INFO ] After 20636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 4795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4795 transition count 11044
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4459 transition count 11044
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 696 place count 4459 transition count 11044
Applied a total of 696 rules in 2023 ms. Remains 4459 /4795 variables (removed 336) and now considering 11044/8086 (removed -2958) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2023 ms. Remains : 4459/4795 places, 11044/8086 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22387 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22387 steps, saw 10288 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:46:18] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
// Phase 1: matrix 10159 rows 4459 cols
[2024-05-25 12:46:18] [INFO ] Computed 1041 invariants in 238 ms
[2024-05-25 12:46:19] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:46:19] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 279 ms returned sat
[2024-05-25 12:46:24] [INFO ] After 6117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:46:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 12:46:25] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 285 ms returned sat
[2024-05-25 12:46:31] [INFO ] After 5861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:46:31] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:46:32] [INFO ] After 1078ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:46:33] [INFO ] After 1698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 604 ms.
[2024-05-25 12:46:33] [INFO ] After 9175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4459/4459 places, 11044/11044 transitions.
Applied a total of 0 rules in 670 ms. Remains 4459 /4459 variables (removed 0) and now considering 11044/11044 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 4459/4459 places, 11044/11044 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4459/4459 places, 11044/11044 transitions.
Applied a total of 0 rules in 692 ms. Remains 4459 /4459 variables (removed 0) and now considering 11044/11044 (removed 0) transitions.
[2024-05-25 12:46:35] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
[2024-05-25 12:46:35] [INFO ] Invariant cache hit.
[2024-05-25 12:46:39] [INFO ] Implicit Places using invariants in 4225 ms returned []
Implicit Place search using SMT only with invariants took 4236 ms to find 0 implicit places.
[2024-05-25 12:46:39] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
[2024-05-25 12:46:39] [INFO ] Invariant cache hit.
[2024-05-25 12:46:45] [INFO ] Dead Transitions using invariants and state equation in 6125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11074 ms. Remains : 4459/4459 places, 11044/11044 transitions.
Graph (trivial) has 3377 edges and 4459 vertex of which 25 / 4459 are part of one of the 1 SCC in 9 ms
Free SCC test removed 24 places
Drop transitions removed 642 transitions
Ensure Unique test removed 843 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 35971 edges and 4435 vertex of which 4413 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 384 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4028 transition count 9316
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3786 transition count 8835
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3545 transition count 8395
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3305 transition count 7997
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3105 transition count 7637
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2907 transition count 7315
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2745 transition count 7027
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2585 transition count 6773
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2457 transition count 6549
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2331 transition count 6355
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2233 transition count 6187
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2137 transition count 6045
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2065 transition count 5925
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1995 transition count 5827
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1945 transition count 5747
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1897 transition count 5685
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1865 transition count 5637
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1835 transition count 5603
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1817 transition count 5579
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1801 transition count 5565
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1793 transition count 5557
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 6247 place count 1787 transition count 5555
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6249 place count 1785 transition count 5555
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6249 place count 1785 transition count 5205
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 349 places
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 23 with 1049 rules applied. Total rules applied 7298 place count 1086 transition count 5205
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 726 transition count 4845
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 726 transition count 4845
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 726 transition count 4844
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 725 transition count 4844
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8559 place count 186 transition count 1071
Iterating global reduction 23 with 539 rules applied. Total rules applied 9098 place count 186 transition count 1071
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9637 place count 186 transition count 532
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9688 place count 160 transition count 507
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 24 with 13 rules applied. Total rules applied 9701 place count 160 transition count 494
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 9714 place count 147 transition count 494
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9725 place count 136 transition count 417
Ensure Unique test removed 10 places
Iterating global reduction 25 with 21 rules applied. Total rules applied 9746 place count 126 transition count 417
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9757 place count 126 transition count 406
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9767 place count 116 transition count 336
Iterating global reduction 26 with 10 rules applied. Total rules applied 9777 place count 116 transition count 336
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9787 place count 106 transition count 326
Iterating global reduction 26 with 10 rules applied. Total rules applied 9797 place count 106 transition count 326
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 26 with 24 rules applied. Total rules applied 9821 place count 106 transition count 326
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9832 place count 95 transition count 249
Iterating global reduction 26 with 11 rules applied. Total rules applied 9843 place count 95 transition count 249
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9854 place count 95 transition count 238
Applied a total of 9854 rules in 6945 ms. Remains 95 /4459 variables (removed 4364) and now considering 238/11044 (removed 10806) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 238 rows 95 cols
[2024-05-25 12:46:52] [INFO ] Computed 33 invariants in 8 ms
[2024-05-25 12:46:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:46:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-25 12:46:52] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:46:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-25 12:46:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2024-05-25 12:46:52] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:46:52] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 12:46:52] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 4 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 663 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 12:46:53] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:46:54] [INFO ] Computed 1041 invariants in 350 ms
[2024-05-25 12:46:57] [INFO ] Implicit Places using invariants in 4123 ms returned []
[2024-05-25 12:46:57] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:46:57] [INFO ] Invariant cache hit.
[2024-05-25 12:47:01] [INFO ] Implicit Places using invariants and state equation in 3627 ms returned []
Implicit Place search using SMT with State Equation took 7779 ms to find 0 implicit places.
[2024-05-25 12:47:02] [INFO ] Redundant transitions in 663 ms returned []
[2024-05-25 12:47:02] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:47:02] [INFO ] Invariant cache hit.
[2024-05-25 12:47:06] [INFO ] Dead Transitions using invariants and state equation in 4823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13935 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 198 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25318 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25318 steps, saw 11850 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:47:10] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:47:10] [INFO ] Invariant cache hit.
[2024-05-25 12:47:10] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 12:47:11] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 312 ms returned sat
[2024-05-25 12:47:15] [INFO ] After 4359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:47:15] [INFO ] State equation strengthened by 2908 read => feed constraints.
[2024-05-25 12:47:16] [INFO ] After 454ms SMT Verify possible using 2908 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:47:16] [INFO ] After 5811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:47:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 12:47:17] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 313 ms returned sat
[2024-05-25 12:47:21] [INFO ] After 4502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:47:26] [INFO ] After 4468ms SMT Verify possible using 2908 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:47:31] [INFO ] Deduced a trap composed of 576 places in 4817 ms of which 5 ms to minimize.
[2024-05-25 12:47:36] [INFO ] Deduced a trap composed of 241 places in 4980 ms of which 6 ms to minimize.
[2024-05-25 12:47:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10554 ms
[2024-05-25 12:47:36] [INFO ] After 15180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2024-05-25 12:47:37] [INFO ] After 20916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 4795 transition count 11044
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 4459 transition count 11044
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 696 place count 4459 transition count 11044
Applied a total of 696 rules in 2179 ms. Remains 4459 /4795 variables (removed 336) and now considering 11044/8086 (removed -2958) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2179 ms. Remains : 4459/4795 places, 11044/8086 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22547 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22547 steps, saw 10360 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:47:42] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
// Phase 1: matrix 10159 rows 4459 cols
[2024-05-25 12:47:42] [INFO ] Computed 1041 invariants in 248 ms
[2024-05-25 12:47:43] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 12:47:43] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 270 ms returned sat
[2024-05-25 12:47:48] [INFO ] After 5992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:47:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 12:47:49] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 270 ms returned sat
[2024-05-25 12:47:55] [INFO ] After 6073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:47:55] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:47:56] [INFO ] After 1070ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:47:57] [INFO ] After 1605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 635 ms.
[2024-05-25 12:47:58] [INFO ] After 9206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 4459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4459/4459 places, 11044/11044 transitions.
Applied a total of 0 rules in 661 ms. Remains 4459 /4459 variables (removed 0) and now considering 11044/11044 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 661 ms. Remains : 4459/4459 places, 11044/11044 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4459/4459 places, 11044/11044 transitions.
Applied a total of 0 rules in 656 ms. Remains 4459 /4459 variables (removed 0) and now considering 11044/11044 (removed 0) transitions.
[2024-05-25 12:47:59] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
[2024-05-25 12:47:59] [INFO ] Invariant cache hit.
[2024-05-25 12:48:03] [INFO ] Implicit Places using invariants in 4354 ms returned []
Implicit Place search using SMT only with invariants took 4359 ms to find 0 implicit places.
[2024-05-25 12:48:03] [INFO ] Flow matrix only has 10159 transitions (discarded 885 similar events)
[2024-05-25 12:48:03] [INFO ] Invariant cache hit.
[2024-05-25 12:48:09] [INFO ] Dead Transitions using invariants and state equation in 6060 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11077 ms. Remains : 4459/4459 places, 11044/11044 transitions.
Graph (trivial) has 3377 edges and 4459 vertex of which 25 / 4459 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 642 transitions
Ensure Unique test removed 843 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 35971 edges and 4435 vertex of which 4413 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 384 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4028 transition count 9316
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3786 transition count 8835
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3545 transition count 8395
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3305 transition count 7997
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3105 transition count 7637
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2907 transition count 7315
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2745 transition count 7027
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2585 transition count 6773
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2457 transition count 6549
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2331 transition count 6355
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2233 transition count 6187
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2137 transition count 6045
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2065 transition count 5925
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1995 transition count 5827
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1945 transition count 5747
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1897 transition count 5685
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1865 transition count 5637
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1835 transition count 5603
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1817 transition count 5579
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1801 transition count 5565
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1793 transition count 5557
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 6247 place count 1787 transition count 5555
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6249 place count 1785 transition count 5555
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6249 place count 1785 transition count 5205
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 349 places
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 23 with 1049 rules applied. Total rules applied 7298 place count 1086 transition count 5205
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 726 transition count 4845
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 726 transition count 4845
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 726 transition count 4844
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 725 transition count 4844
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 8559 place count 186 transition count 1071
Iterating global reduction 23 with 539 rules applied. Total rules applied 9098 place count 186 transition count 1071
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 9637 place count 186 transition count 532
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9688 place count 160 transition count 507
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 24 with 13 rules applied. Total rules applied 9701 place count 160 transition count 494
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 9714 place count 147 transition count 494
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9725 place count 136 transition count 417
Ensure Unique test removed 10 places
Iterating global reduction 25 with 21 rules applied. Total rules applied 9746 place count 126 transition count 417
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9757 place count 126 transition count 406
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9767 place count 116 transition count 336
Iterating global reduction 26 with 10 rules applied. Total rules applied 9777 place count 116 transition count 336
Discarding 10 places :
Symmetric choice reduction at 26 with 10 rule applications. Total rules 9787 place count 106 transition count 326
Iterating global reduction 26 with 10 rules applied. Total rules applied 9797 place count 106 transition count 326
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 26 with 24 rules applied. Total rules applied 9821 place count 106 transition count 326
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9832 place count 95 transition count 249
Iterating global reduction 26 with 11 rules applied. Total rules applied 9843 place count 95 transition count 249
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9854 place count 95 transition count 238
Applied a total of 9854 rules in 6266 ms. Remains 95 /4459 variables (removed 4364) and now considering 238/11044 (removed 10806) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 238 rows 95 cols
[2024-05-25 12:48:16] [INFO ] Computed 33 invariants in 6 ms
[2024-05-25 12:48:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:48:16] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-25 12:48:16] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:48:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:48:16] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2024-05-25 12:48:16] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:48:16] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 12:48:16] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1974 reset in 1224 ms.
Product exploration explored 100000 steps with 1975 reset in 1188 ms.
Built C files in :
/tmp/ltsmin5417751022635198654
[2024-05-25 12:48:19] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:48:19] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5417751022635198654
Running compilation step : cd /tmp/ltsmin5417751022635198654;'/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/ltsmin5417751022635198654;'/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/ltsmin5417751022635198654;'/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 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 642 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 12:48:22] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:48:23] [INFO ] Computed 1041 invariants in 185 ms
[2024-05-25 12:48:26] [INFO ] Implicit Places using invariants in 3853 ms returned []
[2024-05-25 12:48:26] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:48:26] [INFO ] Invariant cache hit.
[2024-05-25 12:48:30] [INFO ] Implicit Places using invariants and state equation in 3824 ms returned []
Implicit Place search using SMT with State Equation took 7694 ms to find 0 implicit places.
[2024-05-25 12:48:31] [INFO ] Redundant transitions in 931 ms returned []
[2024-05-25 12:48:31] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:48:31] [INFO ] Invariant cache hit.
[2024-05-25 12:48:36] [INFO ] Dead Transitions using invariants and state equation in 4782 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14070 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Built C files in :
/tmp/ltsmin3389941148956665547
[2024-05-25 12:48:36] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:48:36] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3389941148956665547
Running compilation step : cd /tmp/ltsmin3389941148956665547;'/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/ltsmin3389941148956665547;'/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/ltsmin3389941148956665547;'/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-25 12:48:39] [INFO ] Flatten gal took : 255 ms
[2024-05-25 12:48:40] [INFO ] Flatten gal took : 238 ms
[2024-05-25 12:48:40] [INFO ] Time to serialize gal into /tmp/LTL6331262843943375807.gal : 73 ms
[2024-05-25 12:48:40] [INFO ] Time to serialize properties into /tmp/LTL5629625982536821837.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6331262843943375807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11457591860000819724.hoa' '-atoms' '/tmp/LTL5629625982536821837.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/LTL5629625982536821837.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11457591860000819724.hoa
Detected timeout of ITS tools.
[2024-05-25 12:48:55] [INFO ] Flatten gal took : 247 ms
[2024-05-25 12:48:56] [INFO ] Flatten gal took : 255 ms
[2024-05-25 12:48:56] [INFO ] Time to serialize gal into /tmp/LTL15683957684325184022.gal : 44 ms
[2024-05-25 12:48:56] [INFO ] Time to serialize properties into /tmp/LTL10637521235113833790.ltl : 3 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/LTL15683957684325184022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10637521235113833790.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(Node7NotifyThatHeIsActive<1))&&((Node13HasAskedItsLeafSetToLx6ToRepl...205
Formula 0 simplified : GF!"(((Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(Node7NotifyThatHeIsActive<1))&&((Node13HasAskedItsLeafSetToLx6ToReplac...199
Detected timeout of ITS tools.
[2024-05-25 12:49:11] [INFO ] Flatten gal took : 238 ms
[2024-05-25 12:49:11] [INFO ] Applying decomposition
[2024-05-25 12:49:11] [INFO ] Flatten gal took : 241 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/graph14067397883194435650.txt' '-o' '/tmp/graph14067397883194435650.bin' '-w' '/tmp/graph14067397883194435650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14067397883194435650.bin' '-l' '-1' '-v' '-w' '/tmp/graph14067397883194435650.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:49:12] [INFO ] Decomposing Gal with order
[2024-05-25 12:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:49:14] [INFO ] Removed a total of 6813 redundant transitions.
[2024-05-25 12:49:14] [INFO ] Flatten gal took : 1798 ms
[2024-05-25 12:49:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4361 labels/synchronizations in 464 ms.
[2024-05-25 12:49:15] [INFO ] Time to serialize gal into /tmp/LTL13249602060962125509.gal : 78 ms
[2024-05-25 12:49:15] [INFO ] Time to serialize properties into /tmp/LTL17030816016099599461.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/LTL13249602060962125509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17030816016099599461.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i8.u147.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i8.u148.Node7NotifyThatHeIsActive<1))&&((i21.u3.Node13HasAsk...237
Formula 0 simplified : GF!"(((i8.u147.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i8.u148.Node7NotifyThatHeIsActive<1))&&((i21.u3.Node13HasAsked...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7063189478906425673
[2024-05-25 12:49:30] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7063189478906425673
Running compilation step : cd /tmp/ltsmin7063189478906425673;'/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/ltsmin7063189478906425673;'/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/ltsmin7063189478906425673;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01 finished in 250379 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(G(p1))))'
Support contains 6 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5212 transition count 8569
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5212 transition count 8569
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 5200 transition count 8521
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 5200 transition count 8521
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 5194 transition count 8479
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 5194 transition count 8479
Applied a total of 68 rules in 2315 ms. Remains 5194 /5228 variables (removed 34) and now considering 8479/8609 (removed 130) transitions.
[2024-05-25 12:49:36] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
// Phase 1: matrix 7879 rows 5194 cols
[2024-05-25 12:49:36] [INFO ] Computed 1041 invariants in 179 ms
[2024-05-25 12:49:41] [INFO ] Implicit Places using invariants in 5269 ms returned []
[2024-05-25 12:49:41] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:49:41] [INFO ] Invariant cache hit.
[2024-05-25 12:49:45] [INFO ] Implicit Places using invariants and state equation in 3720 ms returned []
Implicit Place search using SMT with State Equation took 9002 ms to find 0 implicit places.
[2024-05-25 12:49:45] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:49:45] [INFO ] Invariant cache hit.
[2024-05-25 12:49:50] [INFO ] Dead Transitions using invariants and state equation in 4979 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5194/5228 places, 8479/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16299 ms. Remains : 5194/5228 places, 8479/8609 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s2559 1) (GEQ s2562 1) (GEQ s3843 1)), p1:(OR (LT s3 1) (LT s5 1) (LT s3203 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 1391 reset in 1039 ms.
Product exploration explored 100000 steps with 1389 reset in 1068 ms.
Computed a total of 2570 stabilizing places and 3278 stable transitions
Computed a total of 2570 stabilizing places and 3278 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 374 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 12:49:53] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:49:53] [INFO ] Invariant cache hit.
[2024-05-25 12:49:54] [INFO ] [Real]Absence check using 47 positive place invariants in 60 ms returned sat
[2024-05-25 12:49:54] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 305 ms returned sat
[2024-05-25 12:50:00] [INFO ] After 7099ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 12:50:01] [INFO ] [Nat]Absence check using 47 positive place invariants in 65 ms returned sat
[2024-05-25 12:50:01] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 342 ms returned sat
[2024-05-25 12:50:06] [INFO ] After 5211ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 12:50:06] [INFO ] State equation strengthened by 2902 read => feed constraints.
[2024-05-25 12:50:16] [INFO ] After 9221ms SMT Verify possible using 2902 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 12:50:16] [INFO ] After 15511ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 5194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5194/5194 places, 8479/8479 transitions.
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 378 Pre rules applied. Total rules applied 0 place count 5194 transition count 8101
Deduced a syphon composed of 378 places in 6 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 0 with 756 rules applied. Total rules applied 756 place count 4816 transition count 8101
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 802 place count 4793 transition count 8078
Free-agglomeration rule (complex) applied 316 times.
Iterating global reduction 0 with 316 rules applied. Total rules applied 1118 place count 4793 transition count 11062
Reduce places removed 316 places and 0 transitions.
Iterating post reduction 0 with 316 rules applied. Total rules applied 1434 place count 4477 transition count 11062
Applied a total of 1434 rules in 2139 ms. Remains 4477 /5194 variables (removed 717) and now considering 11062/8479 (removed -2583) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2139 ms. Remains : 4477/5194 places, 11062/8479 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22305 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22305 steps, saw 10258 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:50:21] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
// Phase 1: matrix 10196 rows 4477 cols
[2024-05-25 12:50:21] [INFO ] Computed 1041 invariants in 259 ms
[2024-05-25 12:50:22] [INFO ] [Real]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 12:50:22] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 267 ms returned sat
[2024-05-25 12:50:22] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:50:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 12:50:23] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 281 ms returned sat
[2024-05-25 12:50:30] [INFO ] After 6988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:50:30] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:50:40] [INFO ] After 9483ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 12:50:40] [INFO ] After 17402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 692 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 675 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
[2024-05-25 12:50:41] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 12:50:41] [INFO ] Invariant cache hit.
[2024-05-25 12:50:45] [INFO ] Implicit Places using invariants in 4258 ms returned []
Implicit Place search using SMT only with invariants took 4259 ms to find 0 implicit places.
[2024-05-25 12:50:45] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 12:50:45] [INFO ] Invariant cache hit.
[2024-05-25 12:50:51] [INFO ] Dead Transitions using invariants and state equation in 6191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11130 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Graph (trivial) has 3297 edges and 4477 vertex of which 23 / 4477 are part of one of the 1 SCC in 2 ms
Free SCC test removed 22 places
Drop transitions removed 549 transitions
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 1436 transitions.
Graph (complete) has 36057 edges and 4455 vertex of which 4433 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 4049 transition count 9408
Ensure Unique test removed 1 places
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 1 with 643 rules applied. Total rules applied 863 place count 3832 transition count 8982
Reduce places removed 213 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 2 with 599 rules applied. Total rules applied 1462 place count 3619 transition count 8596
Ensure Unique test removed 32 places
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 3 with 554 rules applied. Total rules applied 2016 place count 3411 transition count 8250
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 170 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 4 with 483 rules applied. Total rules applied 2499 place count 3238 transition count 7940
Ensure Unique test removed 28 places
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 5 with 442 rules applied. Total rules applied 2941 place count 3070 transition count 7666
Reduce places removed 137 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 6 with 379 rules applied. Total rules applied 3320 place count 2933 transition count 7424
Ensure Unique test removed 24 places
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 342 rules applied. Total rules applied 3662 place count 2801 transition count 7214
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 8 with 287 rules applied. Total rules applied 3949 place count 2696 transition count 7032
Ensure Unique test removed 20 places
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 9 with 254 rules applied. Total rules applied 4203 place count 2596 transition count 6878
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 10 with 207 rules applied. Total rules applied 4410 place count 2519 transition count 6748
Ensure Unique test removed 16 places
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 11 with 178 rules applied. Total rules applied 4588 place count 2447 transition count 6642
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 12 with 139 rules applied. Total rules applied 4727 place count 2394 transition count 6556
Ensure Unique test removed 12 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 13 with 114 rules applied. Total rules applied 4841 place count 2346 transition count 6490
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 14 with 83 rules applied. Total rules applied 4924 place count 2313 transition count 6440
Ensure Unique test removed 8 places
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 15 with 62 rules applied. Total rules applied 4986 place count 2285 transition count 6406
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 16 with 39 rules applied. Total rules applied 5025 place count 2268 transition count 6384
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 17 with 22 rules applied. Total rules applied 5047 place count 2256 transition count 6374
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 18 with 13 rules applied. Total rules applied 5060 place count 2251 transition count 6366
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 19 with 23 rules applied. Total rules applied 5083 place count 2247 transition count 6347
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 20 with 19 rules applied. Total rules applied 5102 place count 2228 transition count 6347
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 350 Pre rules applied. Total rules applied 5102 place count 2228 transition count 5997
Deduced a syphon composed of 350 places in 2 ms
Ensure Unique test removed 350 places
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 21 with 1050 rules applied. Total rules applied 6152 place count 1528 transition count 5997
Discarding 358 places :
Symmetric choice reduction at 21 with 358 rule applications. Total rules 6510 place count 1170 transition count 5639
Iterating global reduction 21 with 358 rules applied. Total rules applied 6868 place count 1170 transition count 5639
Discarding 455 places :
Symmetric choice reduction at 21 with 455 rule applications. Total rules 7323 place count 715 transition count 2454
Iterating global reduction 21 with 455 rules applied. Total rules applied 7778 place count 715 transition count 2454
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 415 transitions.
Iterating post reduction 21 with 415 rules applied. Total rules applied 8193 place count 715 transition count 2039
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 22 with 694 rules applied. Total rules applied 8887 place count 368 transition count 1692
Drop transitions removed 324 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 22 with 342 rules applied. Total rules applied 9229 place count 368 transition count 1350
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 23 with 126 rules applied. Total rules applied 9355 place count 368 transition count 1224
Ensure Unique test removed 98 places
Iterating post reduction 23 with 98 rules applied. Total rules applied 9453 place count 270 transition count 1224
Discarding 97 places :
Symmetric choice reduction at 24 with 97 rule applications. Total rules 9550 place count 173 transition count 545
Iterating global reduction 24 with 97 rules applied. Total rules applied 9647 place count 173 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 24 with 86 rules applied. Total rules applied 9733 place count 173 transition count 459
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 25 with 7 rules applied. Total rules applied 9740 place count 173 transition count 452
Free-agglomeration rule applied 2 times.
Iterating global reduction 25 with 2 rules applied. Total rules applied 9742 place count 173 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 9744 place count 171 transition count 450
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 26 with 14 rules applied. Total rules applied 9758 place count 171 transition count 436
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 26 with 14 rules applied. Total rules applied 9772 place count 157 transition count 436
Discarding 22 places :
Symmetric choice reduction at 27 with 22 rule applications. Total rules 9794 place count 135 transition count 282
Iterating global reduction 27 with 22 rules applied. Total rules applied 9816 place count 135 transition count 282
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 9836 place count 135 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 9837 place count 135 transition count 262
Applied a total of 9837 rules in 8815 ms. Remains 135 /4477 variables (removed 4342) and now considering 262/11062 (removed 10800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 135 cols
[2024-05-25 12:51:00] [INFO ] Computed 42 invariants in 4 ms
[2024-05-25 12:51:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:51:00] [INFO ] [Real]Absence check using 4 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-25 12:51:00] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:51:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:51:00] [INFO ] [Nat]Absence check using 4 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 12:51:01] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:51:01] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-25 12:51:01] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 6 out of 5194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5194/5194 places, 8479/8479 transitions.
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 378 Pre rules applied. Total rules applied 0 place count 5194 transition count 8101
Deduced a syphon composed of 378 places in 5 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 0 with 756 rules applied. Total rules applied 756 place count 4816 transition count 8101
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 802 place count 4793 transition count 8078
Applied a total of 802 rules in 1289 ms. Remains 4793 /5194 variables (removed 401) and now considering 8078/8479 (removed 401) transitions.
[2024-05-25 12:51:03] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4793 cols
[2024-05-25 12:51:03] [INFO ] Computed 1041 invariants in 215 ms
[2024-05-25 12:51:08] [INFO ] Implicit Places using invariants in 5387 ms returned []
[2024-05-25 12:51:08] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 12:51:08] [INFO ] Invariant cache hit.
[2024-05-25 12:51:12] [INFO ] Implicit Places using invariants and state equation in 3640 ms returned []
Implicit Place search using SMT with State Equation took 9034 ms to find 0 implicit places.
[2024-05-25 12:51:13] [INFO ] Redundant transitions in 896 ms returned []
[2024-05-25 12:51:13] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 12:51:13] [INFO ] Invariant cache hit.
[2024-05-25 12:51:18] [INFO ] Dead Transitions using invariants and state equation in 4959 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4793/5194 places, 8078/8479 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16189 ms. Remains : 4793/5194 places, 8078/8479 transitions.
Computed a total of 2192 stabilizing places and 2900 stable transitions
Computed a total of 2192 stabilizing places and 2900 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 111 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 196 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2024-05-25 12:51:19] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 12:51:19] [INFO ] Invariant cache hit.
[2024-05-25 12:51:19] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2024-05-25 12:51:20] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 303 ms returned sat
[2024-05-25 12:51:20] [INFO ] After 1035ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 12:51:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 12:51:20] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 269 ms returned sat
[2024-05-25 12:51:26] [INFO ] After 5286ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 12:51:26] [INFO ] State equation strengthened by 2902 read => feed constraints.
[2024-05-25 12:51:35] [INFO ] After 9194ms SMT Verify possible using 2902 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 12:51:35] [INFO ] After 15373ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Free-agglomeration rule (complex) applied 316 times.
Iterating global reduction 0 with 316 rules applied. Total rules applied 316 place count 4793 transition count 11062
Reduce places removed 316 places and 0 transitions.
Iterating post reduction 0 with 316 rules applied. Total rules applied 632 place count 4477 transition count 11062
Applied a total of 632 rules in 1465 ms. Remains 4477 /4793 variables (removed 316) and now considering 11062/8078 (removed -2984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 4477/4793 places, 11062/8078 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22697 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22697 steps, saw 10428 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:51:40] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
// Phase 1: matrix 10196 rows 4477 cols
[2024-05-25 12:51:40] [INFO ] Computed 1041 invariants in 242 ms
[2024-05-25 12:51:41] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:51:41] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 272 ms returned sat
[2024-05-25 12:51:41] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:51:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-05-25 12:51:42] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 275 ms returned sat
[2024-05-25 12:51:48] [INFO ] After 6341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:51:48] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:51:58] [INFO ] After 9477ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 12:51:58] [INFO ] After 16817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 661 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 661 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 686 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
[2024-05-25 12:51:59] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 12:51:59] [INFO ] Invariant cache hit.
[2024-05-25 12:52:03] [INFO ] Implicit Places using invariants in 3946 ms returned []
Implicit Place search using SMT only with invariants took 3947 ms to find 0 implicit places.
[2024-05-25 12:52:03] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 12:52:03] [INFO ] Invariant cache hit.
[2024-05-25 12:52:09] [INFO ] Dead Transitions using invariants and state equation in 5986 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10621 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Graph (trivial) has 3297 edges and 4477 vertex of which 23 / 4477 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 549 transitions
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 1436 transitions.
Graph (complete) has 36057 edges and 4455 vertex of which 4433 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 4049 transition count 9408
Ensure Unique test removed 1 places
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 1 with 643 rules applied. Total rules applied 863 place count 3832 transition count 8982
Reduce places removed 213 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 2 with 599 rules applied. Total rules applied 1462 place count 3619 transition count 8596
Ensure Unique test removed 32 places
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 3 with 554 rules applied. Total rules applied 2016 place count 3411 transition count 8250
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 170 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 4 with 483 rules applied. Total rules applied 2499 place count 3238 transition count 7940
Ensure Unique test removed 28 places
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 5 with 442 rules applied. Total rules applied 2941 place count 3070 transition count 7666
Reduce places removed 137 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 6 with 379 rules applied. Total rules applied 3320 place count 2933 transition count 7424
Ensure Unique test removed 24 places
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 342 rules applied. Total rules applied 3662 place count 2801 transition count 7214
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 8 with 287 rules applied. Total rules applied 3949 place count 2696 transition count 7032
Ensure Unique test removed 20 places
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 9 with 254 rules applied. Total rules applied 4203 place count 2596 transition count 6878
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 10 with 207 rules applied. Total rules applied 4410 place count 2519 transition count 6748
Ensure Unique test removed 16 places
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 11 with 178 rules applied. Total rules applied 4588 place count 2447 transition count 6642
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 12 with 139 rules applied. Total rules applied 4727 place count 2394 transition count 6556
Ensure Unique test removed 12 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 13 with 114 rules applied. Total rules applied 4841 place count 2346 transition count 6490
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 14 with 83 rules applied. Total rules applied 4924 place count 2313 transition count 6440
Ensure Unique test removed 8 places
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 15 with 62 rules applied. Total rules applied 4986 place count 2285 transition count 6406
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 16 with 39 rules applied. Total rules applied 5025 place count 2268 transition count 6384
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 17 with 22 rules applied. Total rules applied 5047 place count 2256 transition count 6374
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 18 with 13 rules applied. Total rules applied 5060 place count 2251 transition count 6366
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 19 with 23 rules applied. Total rules applied 5083 place count 2247 transition count 6347
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 20 with 19 rules applied. Total rules applied 5102 place count 2228 transition count 6347
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 350 Pre rules applied. Total rules applied 5102 place count 2228 transition count 5997
Deduced a syphon composed of 350 places in 2 ms
Ensure Unique test removed 350 places
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 21 with 1050 rules applied. Total rules applied 6152 place count 1528 transition count 5997
Discarding 358 places :
Symmetric choice reduction at 21 with 358 rule applications. Total rules 6510 place count 1170 transition count 5639
Iterating global reduction 21 with 358 rules applied. Total rules applied 6868 place count 1170 transition count 5639
Discarding 455 places :
Symmetric choice reduction at 21 with 455 rule applications. Total rules 7323 place count 715 transition count 2454
Iterating global reduction 21 with 455 rules applied. Total rules applied 7778 place count 715 transition count 2454
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 415 transitions.
Iterating post reduction 21 with 415 rules applied. Total rules applied 8193 place count 715 transition count 2039
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 22 with 694 rules applied. Total rules applied 8887 place count 368 transition count 1692
Drop transitions removed 324 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 22 with 342 rules applied. Total rules applied 9229 place count 368 transition count 1350
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 23 with 126 rules applied. Total rules applied 9355 place count 368 transition count 1224
Ensure Unique test removed 98 places
Iterating post reduction 23 with 98 rules applied. Total rules applied 9453 place count 270 transition count 1224
Discarding 97 places :
Symmetric choice reduction at 24 with 97 rule applications. Total rules 9550 place count 173 transition count 545
Iterating global reduction 24 with 97 rules applied. Total rules applied 9647 place count 173 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 24 with 86 rules applied. Total rules applied 9733 place count 173 transition count 459
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 25 with 7 rules applied. Total rules applied 9740 place count 173 transition count 452
Free-agglomeration rule applied 2 times.
Iterating global reduction 25 with 2 rules applied. Total rules applied 9742 place count 173 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 9744 place count 171 transition count 450
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 26 with 14 rules applied. Total rules applied 9758 place count 171 transition count 436
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 26 with 14 rules applied. Total rules applied 9772 place count 157 transition count 436
Discarding 22 places :
Symmetric choice reduction at 27 with 22 rule applications. Total rules 9794 place count 135 transition count 282
Iterating global reduction 27 with 22 rules applied. Total rules applied 9816 place count 135 transition count 282
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 9836 place count 135 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 9837 place count 135 transition count 262
Applied a total of 9837 rules in 8615 ms. Remains 135 /4477 variables (removed 4342) and now considering 262/11062 (removed 10800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 135 cols
[2024-05-25 12:52:18] [INFO ] Computed 42 invariants in 5 ms
[2024-05-25 12:52:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 12:52:18] [INFO ] [Real]Absence check using 4 positive and 38 generalized place invariants in 5 ms returned sat
[2024-05-25 12:52:18] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:52:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-25 12:52:18] [INFO ] [Nat]Absence check using 4 positive and 38 generalized place invariants in 7 ms returned sat
[2024-05-25 12:52:18] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:52:18] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 12:52:18] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0)]
Knowledge based reduction with 14 factoid took 271 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 549 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1975 reset in 1224 ms.
Product exploration explored 100000 steps with 1972 reset in 1256 ms.
Built C files in :
/tmp/ltsmin10501921153770987479
[2024-05-25 12:52:22] [INFO ] Too many transitions (8078) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:52:22] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10501921153770987479
Running compilation step : cd /tmp/ltsmin10501921153770987479;'/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/ltsmin10501921153770987479;'/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/ltsmin10501921153770987479;'/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 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Applied a total of 0 rules in 649 ms. Remains 4793 /4793 variables (removed 0) and now considering 8078/8078 (removed 0) transitions.
[2024-05-25 12:52:26] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4793 cols
[2024-05-25 12:52:26] [INFO ] Computed 1041 invariants in 195 ms
[2024-05-25 12:52:31] [INFO ] Implicit Places using invariants in 5242 ms returned []
[2024-05-25 12:52:31] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 12:52:31] [INFO ] Invariant cache hit.
[2024-05-25 12:52:35] [INFO ] Implicit Places using invariants and state equation in 3849 ms returned []
Implicit Place search using SMT with State Equation took 9101 ms to find 0 implicit places.
[2024-05-25 12:52:36] [INFO ] Redundant transitions in 898 ms returned []
[2024-05-25 12:52:36] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 12:52:36] [INFO ] Invariant cache hit.
[2024-05-25 12:52:41] [INFO ] Dead Transitions using invariants and state equation in 4840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15495 ms. Remains : 4793/4793 places, 8078/8078 transitions.
Built C files in :
/tmp/ltsmin1930247539169852638
[2024-05-25 12:52:41] [INFO ] Too many transitions (8078) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:52:41] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1930247539169852638
Running compilation step : cd /tmp/ltsmin1930247539169852638;'/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/ltsmin1930247539169852638;'/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/ltsmin1930247539169852638;'/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-25 12:52:44] [INFO ] Flatten gal took : 266 ms
[2024-05-25 12:52:44] [INFO ] Flatten gal took : 212 ms
[2024-05-25 12:52:44] [INFO ] Time to serialize gal into /tmp/LTL10888373554904738294.gal : 38 ms
[2024-05-25 12:52:44] [INFO ] Time to serialize properties into /tmp/LTL7018317511896248630.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10888373554904738294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18195573930535601366.hoa' '-atoms' '/tmp/LTL7018317511896248630.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...319
Loading property file /tmp/LTL7018317511896248630.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18195573930535601366.hoa
Detected timeout of ITS tools.
[2024-05-25 12:53:00] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:53:00] [INFO ] Flatten gal took : 210 ms
[2024-05-25 12:53:00] [INFO ] Time to serialize gal into /tmp/LTL16673701264802905862.gal : 41 ms
[2024-05-25 12:53:00] [INFO ] Time to serialize properties into /tmp/LTL15040531409643514346.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/LTL16673701264802905862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15040531409643514346.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((Node0IsActive<1)||(Node0IsT...212
Formula 0 simplified : G!"(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))" & XF!"(((Node0IsActive<1)||(Node0IsTheNod...202
Detected timeout of ITS tools.
[2024-05-25 12:53:15] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:53:15] [INFO ] Applying decomposition
[2024-05-25 12:53:16] [INFO ] Flatten gal took : 217 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/graph17512681404125446262.txt' '-o' '/tmp/graph17512681404125446262.bin' '-w' '/tmp/graph17512681404125446262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17512681404125446262.bin' '-l' '-1' '-v' '-w' '/tmp/graph17512681404125446262.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:53:16] [INFO ] Decomposing Gal with order
[2024-05-25 12:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:53:17] [INFO ] Removed a total of 6668 redundant transitions.
[2024-05-25 12:53:18] [INFO ] Flatten gal took : 1028 ms
[2024-05-25 12:53:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 4733 labels/synchronizations in 342 ms.
[2024-05-25 12:53:18] [INFO ] Time to serialize gal into /tmp/LTL79372941968605028.gal : 53 ms
[2024-05-25 12:53:18] [INFO ] Time to serialize properties into /tmp/LTL16986625912614029895.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL79372941968605028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16986625912614029895.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...253
Read 1 LTL properties
Checking formula 0 : !(((F("(((i1.u1.Node14IsActive>=1)&&(i1.u1.Node14IsTheNodeMaster>=1))&&(i1.u1.Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((i1.u1.Nod...248
Formula 0 simplified : G!"(((i1.u1.Node14IsActive>=1)&&(i1.u1.Node14IsTheNodeMaster>=1))&&(i1.u1.Node22AsksIsThereANodeMaster>=1))" & XF!"(((i1.u1.Node0IsA...238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16408143512274694119
[2024-05-25 12:53:33] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16408143512274694119
Running compilation step : cd /tmp/ltsmin16408143512274694119;'/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/ltsmin16408143512274694119;'/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/ltsmin16408143512274694119;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02 finished in 243057 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)||G(F(p2)))))'
Support contains 3 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5213 transition count 8570
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5213 transition count 8570
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 5202 transition count 8523
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 5202 transition count 8523
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 5197 transition count 8488
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 5197 transition count 8488
Applied a total of 62 rules in 2211 ms. Remains 5197 /5228 variables (removed 31) and now considering 8488/8609 (removed 121) transitions.
[2024-05-25 12:53:39] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
// Phase 1: matrix 7888 rows 5197 cols
[2024-05-25 12:53:39] [INFO ] Computed 1041 invariants in 184 ms
[2024-05-25 12:53:43] [INFO ] Implicit Places using invariants in 4082 ms returned []
[2024-05-25 12:53:43] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
[2024-05-25 12:53:43] [INFO ] Invariant cache hit.
[2024-05-25 12:53:46] [INFO ] Implicit Places using invariants and state equation in 3772 ms returned []
Implicit Place search using SMT with State Equation took 7859 ms to find 0 implicit places.
[2024-05-25 12:53:46] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
[2024-05-25 12:53:46] [INFO ] Invariant cache hit.
[2024-05-25 12:53:51] [INFO ] Dead Transitions using invariants and state equation in 5053 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5197/5228 places, 8488/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15129 ms. Remains : 5197/5228 places, 8488/8609 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1668 1) (GEQ s1782 1)), p2:(AND (GEQ s1668 1) (GEQ s1782 1)), p1:(LT s2685 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03 finished in 15348 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 2 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 364 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 364 Pre rules applied. Total rules applied 12 place count 5222 transition count 8239
Deduced a syphon composed of 364 places in 5 ms
Reduce places removed 364 places and 0 transitions.
Iterating global reduction 2 with 728 rules applied. Total rules applied 740 place count 4858 transition count 8239
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 749 place count 4849 transition count 8206
Iterating global reduction 2 with 9 rules applied. Total rules applied 758 place count 4849 transition count 8206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 758 place count 4849 transition count 8204
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 762 place count 4847 transition count 8204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 767 place count 4842 transition count 8169
Iterating global reduction 2 with 5 rules applied. Total rules applied 772 place count 4842 transition count 8169
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 832 place count 4812 transition count 8139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 838 place count 4806 transition count 8133
Iterating global reduction 2 with 6 rules applied. Total rules applied 844 place count 4806 transition count 8133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 844 place count 4806 transition count 8128
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 854 place count 4801 transition count 8128
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 860 place count 4795 transition count 8086
Iterating global reduction 2 with 6 rules applied. Total rules applied 866 place count 4795 transition count 8086
Applied a total of 866 rules in 3650 ms. Remains 4795 /5228 variables (removed 433) and now considering 8086/8609 (removed 523) transitions.
[2024-05-25 12:53:55] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:53:56] [INFO ] Computed 1041 invariants in 226 ms
[2024-05-25 12:54:01] [INFO ] Implicit Places using invariants in 5440 ms returned []
[2024-05-25 12:54:01] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:54:01] [INFO ] Invariant cache hit.
[2024-05-25 12:54:05] [INFO ] Implicit Places using invariants and state equation in 3713 ms returned []
Implicit Place search using SMT with State Equation took 9156 ms to find 0 implicit places.
[2024-05-25 12:54:05] [INFO ] Redundant transitions in 922 ms returned []
[2024-05-25 12:54:05] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:54:05] [INFO ] Invariant cache hit.
[2024-05-25 12:54:10] [INFO ] Dead Transitions using invariants and state equation in 4878 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4795/5228 places, 8086/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18620 ms. Remains : 4795/5228 places, 8086/8609 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1928 1) (LT s1988 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 1966 reset in 1242 ms.
Product exploration explored 100000 steps with 1965 reset in 1172 ms.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Detected a total of 2196/4795 stabilizing places and 2910/8086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 196 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26115 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26115 steps, saw 12220 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:54:16] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:54:16] [INFO ] Invariant cache hit.
[2024-05-25 12:54:17] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2024-05-25 12:54:17] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 290 ms returned sat
[2024-05-25 12:54:21] [INFO ] After 3951ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:54:21] [INFO ] State equation strengthened by 2908 read => feed constraints.
[2024-05-25 12:54:22] [INFO ] After 540ms SMT Verify possible using 2908 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:54:22] [INFO ] After 5416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:54:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 12:54:22] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 286 ms returned sat
[2024-05-25 12:54:27] [INFO ] After 4231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:54:27] [INFO ] After 791ms SMT Verify possible using 2908 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:54:33] [INFO ] Deduced a trap composed of 558 places in 4934 ms of which 8 ms to minimize.
[2024-05-25 12:54:39] [INFO ] Deduced a trap composed of 510 places in 4908 ms of which 5 ms to minimize.
[2024-05-25 12:54:45] [INFO ] Deduced a trap composed of 561 places in 4772 ms of which 5 ms to minimize.
[2024-05-25 12:54:51] [INFO ] Deduced a trap composed of 516 places in 4751 ms of which 5 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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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-25 12:54:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:54:51] [INFO ] After 29160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4795 transition count 11043
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4458 transition count 11043
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 698 place count 4458 transition count 11043
Applied a total of 698 rules in 2091 ms. Remains 4458 /4795 variables (removed 337) and now considering 11043/8086 (removed -2957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2091 ms. Remains : 4458/4795 places, 11043/8086 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23326 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23326 steps, saw 10715 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:54:56] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
// Phase 1: matrix 10157 rows 4458 cols
[2024-05-25 12:54:57] [INFO ] Computed 1041 invariants in 337 ms
[2024-05-25 12:54:57] [INFO ] [Real]Absence check using 47 positive place invariants in 44 ms returned sat
[2024-05-25 12:54:57] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 291 ms returned sat
[2024-05-25 12:55:02] [INFO ] After 4924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:55:02] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 12:55:03] [INFO ] After 907ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:55:03] [INFO ] After 6786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:55:04] [INFO ] [Nat]Absence check using 47 positive place invariants in 43 ms returned sat
[2024-05-25 12:55:04] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 284 ms returned sat
[2024-05-25 12:55:09] [INFO ] After 5105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:55:11] [INFO ] After 1943ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:55:17] [INFO ] Deduced a trap composed of 422 places in 5625 ms of which 4 ms to minimize.
[2024-05-25 12:55:24] [INFO ] Deduced a trap composed of 310 places in 5861 ms of which 6 ms to minimize.
[2024-05-25 12:55:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 13422 ms
[2024-05-25 12:55:25] [INFO ] After 15577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-25 12:55:25] [INFO ] After 21854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 678 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4458/4458 places, 11043/11043 transitions.
Applied a total of 0 rules in 635 ms. Remains 4458 /4458 variables (removed 0) and now considering 11043/11043 (removed 0) transitions.
[2024-05-25 12:55:27] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2024-05-25 12:55:27] [INFO ] Invariant cache hit.
[2024-05-25 12:55:31] [INFO ] Implicit Places using invariants in 4118 ms returned []
Implicit Place search using SMT only with invariants took 4123 ms to find 0 implicit places.
[2024-05-25 12:55:31] [INFO ] Flow matrix only has 10157 transitions (discarded 886 similar events)
[2024-05-25 12:55:31] [INFO ] Invariant cache hit.
[2024-05-25 12:55:37] [INFO ] Dead Transitions using invariants and state equation in 6089 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10851 ms. Remains : 4458/4458 places, 11043/11043 transitions.
Graph (trivial) has 3379 edges and 4458 vertex of which 25 / 4458 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 35966 edges and 4434 vertex of which 4412 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4026 transition count 9314
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3784 transition count 8833
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3543 transition count 8393
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3303 transition count 7995
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3103 transition count 7635
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2905 transition count 7313
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2743 transition count 7025
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2583 transition count 6771
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2455 transition count 6547
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2329 transition count 6353
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2231 transition count 6185
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2135 transition count 6043
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2063 transition count 5923
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1993 transition count 5825
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1943 transition count 5745
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1895 transition count 5683
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1863 transition count 5635
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1833 transition count 5601
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1815 transition count 5577
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1799 transition count 5563
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1791 transition count 5555
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1784 transition count 5553
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1782 transition count 5553
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6250 place count 1782 transition count 5203
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 349 places
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 23 with 1049 rules applied. Total rules applied 7299 place count 1083 transition count 5203
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7659 place count 723 transition count 4843
Iterating global reduction 23 with 360 rules applied. Total rules applied 8019 place count 723 transition count 4843
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8019 place count 723 transition count 4842
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8021 place count 722 transition count 4842
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8561 place count 182 transition count 1062
Iterating global reduction 23 with 540 rules applied. Total rules applied 9101 place count 182 transition count 1062
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9641 place count 182 transition count 522
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9692 place count 156 transition count 497
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 24 with 13 rules applied. Total rules applied 9705 place count 156 transition count 484
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 9718 place count 143 transition count 484
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9729 place count 132 transition count 407
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 9751 place count 121 transition count 407
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9762 place count 121 transition count 396
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9773 place count 110 transition count 319
Iterating global reduction 26 with 11 rules applied. Total rules applied 9784 place count 110 transition count 319
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9795 place count 99 transition count 308
Iterating global reduction 26 with 11 rules applied. Total rules applied 9806 place count 99 transition count 308
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 26 with 24 rules applied. Total rules applied 9830 place count 99 transition count 308
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9841 place count 88 transition count 231
Ensure Unique test removed 1 places
Iterating global reduction 26 with 12 rules applied. Total rules applied 9853 place count 87 transition count 231
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9864 place count 87 transition count 220
Applied a total of 9864 rules in 6519 ms. Remains 87 /4458 variables (removed 4371) and now considering 220/11043 (removed 10823) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 87 cols
[2024-05-25 12:55:43] [INFO ] Computed 29 invariants in 5 ms
[2024-05-25 12:55:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:55:43] [INFO ] [Real]Absence check using 3 positive and 26 generalized place invariants in 3 ms returned sat
[2024-05-25 12:55:43] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:55:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 12:55:43] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-25 12:55:43] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:55:43] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 12:55:43] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 640 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 12:55:44] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:55:45] [INFO ] Computed 1041 invariants in 199 ms
[2024-05-25 12:55:50] [INFO ] Implicit Places using invariants in 5365 ms returned []
[2024-05-25 12:55:50] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:55:50] [INFO ] Invariant cache hit.
[2024-05-25 12:55:53] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 8953 ms to find 0 implicit places.
[2024-05-25 12:55:54] [INFO ] Redundant transitions in 912 ms returned []
[2024-05-25 12:55:54] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:55:54] [INFO ] Invariant cache hit.
[2024-05-25 12:55:59] [INFO ] Dead Transitions using invariants and state equation in 4844 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15356 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Detected a total of 2196/4795 stabilizing places and 2910/8086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 197 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25461 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25461 steps, saw 11917 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:56:02] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:56:02] [INFO ] Invariant cache hit.
[2024-05-25 12:56:03] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-05-25 12:56:03] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 289 ms returned sat
[2024-05-25 12:56:07] [INFO ] After 3956ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 12:56:07] [INFO ] State equation strengthened by 2908 read => feed constraints.
[2024-05-25 12:56:08] [INFO ] After 567ms SMT Verify possible using 2908 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:56:08] [INFO ] After 5456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:56:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 12:56:09] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 293 ms returned sat
[2024-05-25 12:56:13] [INFO ] After 3779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:56:13] [INFO ] After 737ms SMT Verify possible using 2908 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:56:19] [INFO ] Deduced a trap composed of 558 places in 5007 ms of which 5 ms to minimize.
[2024-05-25 12:56:25] [INFO ] Deduced a trap composed of 510 places in 4792 ms of which 6 ms to minimize.
[2024-05-25 12:56:30] [INFO ] Deduced a trap composed of 561 places in 4823 ms of which 5 ms to minimize.
[2024-05-25 12:56:36] [INFO ] Deduced a trap composed of 516 places in 4721 ms of which 4 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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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-25 12:56:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:56:36] [INFO ] After 28231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4795 transition count 11043
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4458 transition count 11043
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 698 place count 4458 transition count 11043
Applied a total of 698 rules in 2146 ms. Remains 4458 /4795 variables (removed 337) and now considering 11043/8086 (removed -2957) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2146 ms. Remains : 4458/4795 places, 11043/8086 transitions.
Finished random walk after 431 steps, including 9 resets, run visited all 1 properties in 18 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1965 reset in 1295 ms.
Product exploration explored 100000 steps with 1966 reset in 1347 ms.
Built C files in :
/tmp/ltsmin18432804195140752410
[2024-05-25 12:56:41] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:56:41] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18432804195140752410
Running compilation step : cd /tmp/ltsmin18432804195140752410;'/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/ltsmin18432804195140752410;'/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/ltsmin18432804195140752410;'/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 2 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 642 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 12:56:45] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:56:45] [INFO ] Invariant cache hit.
[2024-05-25 12:56:49] [INFO ] Implicit Places using invariants in 3866 ms returned []
[2024-05-25 12:56:49] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:56:49] [INFO ] Invariant cache hit.
[2024-05-25 12:56:53] [INFO ] Implicit Places using invariants and state equation in 3854 ms returned []
Implicit Place search using SMT with State Equation took 7721 ms to find 0 implicit places.
[2024-05-25 12:56:54] [INFO ] Redundant transitions in 918 ms returned []
[2024-05-25 12:56:54] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:56:54] [INFO ] Invariant cache hit.
[2024-05-25 12:56:58] [INFO ] Dead Transitions using invariants and state equation in 4674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13966 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Built C files in :
/tmp/ltsmin4112611308957107304
[2024-05-25 12:56:58] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 12:56:58] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4112611308957107304
Running compilation step : cd /tmp/ltsmin4112611308957107304;'/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/ltsmin4112611308957107304;'/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/ltsmin4112611308957107304;'/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-25 12:57:02] [INFO ] Flatten gal took : 212 ms
[2024-05-25 12:57:02] [INFO ] Flatten gal took : 217 ms
[2024-05-25 12:57:02] [INFO ] Time to serialize gal into /tmp/LTL2429084586767762569.gal : 37 ms
[2024-05-25 12:57:02] [INFO ] Time to serialize properties into /tmp/LTL6112217323839438363.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2429084586767762569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1140935036093827132.hoa' '-atoms' '/tmp/LTL6112217323839438363.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...317
Loading property file /tmp/LTL6112217323839438363.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1140935036093827132.hoa
Detected timeout of ITS tools.
[2024-05-25 12:57:17] [INFO ] Flatten gal took : 213 ms
[2024-05-25 12:57:18] [INFO ] Flatten gal took : 215 ms
[2024-05-25 12:57:18] [INFO ] Time to serialize gal into /tmp/LTL2375517902512001665.gal : 36 ms
[2024-05-25 12:57:18] [INFO ] Time to serialize properties into /tmp/LTL15245862343004823343.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/LTL2375517902512001665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15245862343004823343.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(LeafSetOfLx4IsSentToNode9<1))"))))
Formula 0 simplified : GF!"((Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(LeafSetOfLx4IsSentToNode9<1))"
Detected timeout of ITS tools.
[2024-05-25 12:57:33] [INFO ] Flatten gal took : 239 ms
[2024-05-25 12:57:33] [INFO ] Applying decomposition
[2024-05-25 12:57:33] [INFO ] Flatten gal took : 231 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/graph13200436616735018133.txt' '-o' '/tmp/graph13200436616735018133.bin' '-w' '/tmp/graph13200436616735018133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13200436616735018133.bin' '-l' '-1' '-v' '-w' '/tmp/graph13200436616735018133.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:57:34] [INFO ] Decomposing Gal with order
[2024-05-25 12:57:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:57:35] [INFO ] Removed a total of 6907 redundant transitions.
[2024-05-25 12:57:35] [INFO ] Flatten gal took : 1081 ms
[2024-05-25 12:57:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 3825 labels/synchronizations in 350 ms.
[2024-05-25 12:57:36] [INFO ] Time to serialize gal into /tmp/LTL13890772819949956957.gal : 51 ms
[2024-05-25 12:57:36] [INFO ] Time to serialize properties into /tmp/LTL1635712705344430032.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13890772819949956957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1635712705344430032.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 : !((F(G("((i28.u178.Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(i28.u178.LeafSetOfLx4IsSentToNode9<1))"))))
Formula 0 simplified : GF!"((i28.u178.Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(i28.u178.LeafSetOfLx4IsSentToNode9<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17997722646239047110
[2024-05-25 12:57:51] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17997722646239047110
Running compilation step : cd /tmp/ltsmin17997722646239047110;'/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/ltsmin17997722646239047110;'/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/ltsmin17997722646239047110;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04 finished in 242295 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&&(p1||G(p2))))))'
Support contains 6 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 364 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 364 Pre rules applied. Total rules applied 12 place count 5222 transition count 8239
Deduced a syphon composed of 364 places in 5 ms
Reduce places removed 364 places and 0 transitions.
Iterating global reduction 2 with 728 rules applied. Total rules applied 740 place count 4858 transition count 8239
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 748 place count 4850 transition count 8213
Iterating global reduction 2 with 8 rules applied. Total rules applied 756 place count 4850 transition count 8213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 756 place count 4850 transition count 8210
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 762 place count 4847 transition count 8210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 767 place count 4842 transition count 8175
Iterating global reduction 2 with 5 rules applied. Total rules applied 772 place count 4842 transition count 8175
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 832 place count 4812 transition count 8145
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 838 place count 4806 transition count 8139
Iterating global reduction 2 with 6 rules applied. Total rules applied 844 place count 4806 transition count 8139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 844 place count 4806 transition count 8135
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 852 place count 4802 transition count 8135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 858 place count 4796 transition count 8093
Iterating global reduction 2 with 6 rules applied. Total rules applied 864 place count 4796 transition count 8093
Applied a total of 864 rules in 3688 ms. Remains 4796 /5228 variables (removed 432) and now considering 8093/8609 (removed 516) transitions.
[2024-05-25 12:57:58] [INFO ] Flow matrix only has 7493 transitions (discarded 600 similar events)
// Phase 1: matrix 7493 rows 4796 cols
[2024-05-25 12:57:58] [INFO ] Computed 1041 invariants in 174 ms
[2024-05-25 12:58:03] [INFO ] Implicit Places using invariants in 4964 ms returned []
[2024-05-25 12:58:03] [INFO ] Flow matrix only has 7493 transitions (discarded 600 similar events)
[2024-05-25 12:58:03] [INFO ] Invariant cache hit.
[2024-05-25 12:58:06] [INFO ] Implicit Places using invariants and state equation in 3757 ms returned []
Implicit Place search using SMT with State Equation took 8722 ms to find 0 implicit places.
[2024-05-25 12:58:07] [INFO ] Redundant transitions in 651 ms returned []
[2024-05-25 12:58:07] [INFO ] Flow matrix only has 7493 transitions (discarded 600 similar events)
[2024-05-25 12:58:07] [INFO ] Invariant cache hit.
[2024-05-25 12:58:12] [INFO ] Dead Transitions using invariants and state equation in 4657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4796/5228 places, 8093/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17725 ms. Remains : 4796/5228 places, 8093/8609 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3521 1) (GEQ s4497 1)), p0:(OR (LT s496 1) (LT s1663 1) (AND (GEQ s3521 1) (GEQ s4497 1))), p2:(AND (GEQ s2773 1) (GEQ s2891 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05 finished in 17913 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(X(G(p0))))'
Support contains 2 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5212 transition count 8569
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5212 transition count 8569
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 5200 transition count 8521
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 5200 transition count 8521
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 5194 transition count 8479
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 5194 transition count 8479
Applied a total of 68 rules in 2240 ms. Remains 5194 /5228 variables (removed 34) and now considering 8479/8609 (removed 130) transitions.
[2024-05-25 12:58:14] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
// Phase 1: matrix 7879 rows 5194 cols
[2024-05-25 12:58:14] [INFO ] Computed 1041 invariants in 170 ms
[2024-05-25 12:58:20] [INFO ] Implicit Places using invariants in 5436 ms returned []
[2024-05-25 12:58:20] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:58:20] [INFO ] Invariant cache hit.
[2024-05-25 12:58:24] [INFO ] Implicit Places using invariants and state equation in 3930 ms returned []
Implicit Place search using SMT with State Equation took 9373 ms to find 0 implicit places.
[2024-05-25 12:58:24] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:58:24] [INFO ] Invariant cache hit.
[2024-05-25 12:58:29] [INFO ] Dead Transitions using invariants and state equation in 5323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5194/5228 places, 8479/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16937 ms. Remains : 5194/5228 places, 8479/8609 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s3201 1) (LT s4587 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1389 reset in 1014 ms.
Product exploration explored 100000 steps with 1388 reset in 1032 ms.
Computed a total of 2570 stabilizing places and 3278 stable transitions
Computed a total of 2570 stabilizing places and 3278 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23973 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23973 steps, saw 11398 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:58:34] [INFO ] Flow matrix only has 7879 transitions (discarded 600 similar events)
[2024-05-25 12:58:34] [INFO ] Invariant cache hit.
[2024-05-25 12:58:35] [INFO ] [Real]Absence check using 47 positive place invariants in 61 ms returned sat
[2024-05-25 12:58:35] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 318 ms returned sat
[2024-05-25 12:58:40] [INFO ] After 5543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:58:41] [INFO ] [Nat]Absence check using 47 positive place invariants in 58 ms returned sat
[2024-05-25 12:58:41] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 319 ms returned sat
[2024-05-25 12:58:46] [INFO ] After 4575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:58:46] [INFO ] State equation strengthened by 2902 read => feed constraints.
[2024-05-25 12:58:46] [INFO ] After 175ms SMT Verify possible using 2902 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 12:58:46] [INFO ] After 5770ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08 finished in 33904 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)||G(p1))))'
Support contains 3 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5228 transition count 8604
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5223 transition count 8604
Performed 365 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 365 Pre rules applied. Total rules applied 10 place count 5223 transition count 8239
Deduced a syphon composed of 365 places in 5 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 740 place count 4858 transition count 8239
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 750 place count 4848 transition count 8205
Iterating global reduction 2 with 10 rules applied. Total rules applied 760 place count 4848 transition count 8205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 760 place count 4848 transition count 8202
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 766 place count 4845 transition count 8202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 772 place count 4839 transition count 8160
Iterating global reduction 2 with 6 rules applied. Total rules applied 778 place count 4839 transition count 8160
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 838 place count 4809 transition count 8130
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 843 place count 4804 transition count 8125
Iterating global reduction 2 with 5 rules applied. Total rules applied 848 place count 4804 transition count 8125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 848 place count 4804 transition count 8121
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 856 place count 4800 transition count 8121
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 861 place count 4795 transition count 8086
Iterating global reduction 2 with 5 rules applied. Total rules applied 866 place count 4795 transition count 8086
Applied a total of 866 rules in 3551 ms. Remains 4795 /5228 variables (removed 433) and now considering 8086/8609 (removed 523) transitions.
[2024-05-25 12:58:49] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 12:58:50] [INFO ] Computed 1041 invariants in 174 ms
[2024-05-25 12:58:53] [INFO ] Implicit Places using invariants in 4063 ms returned []
[2024-05-25 12:58:53] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:58:53] [INFO ] Invariant cache hit.
[2024-05-25 12:58:59] [INFO ] Implicit Places using invariants and state equation in 5192 ms returned []
Implicit Place search using SMT with State Equation took 9264 ms to find 0 implicit places.
[2024-05-25 12:58:59] [INFO ] Redundant transitions in 627 ms returned []
[2024-05-25 12:58:59] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 12:58:59] [INFO ] Invariant cache hit.
[2024-05-25 12:59:05] [INFO ] Dead Transitions using invariants and state equation in 5399 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4795/5228 places, 8086/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18861 ms. Remains : 4795/5228 places, 8086/8609 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1659 1) (GEQ s2250 1)), p1:(GEQ s2886 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09 finished in 18940 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(X(F(p0)))||G(p1)))'
Support contains 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 5214 transition count 8571
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 5214 transition count 8571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 5204 transition count 8537
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 5204 transition count 8537
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 5198 transition count 8495
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 5198 transition count 8495
Applied a total of 60 rules in 2172 ms. Remains 5198 /5228 variables (removed 30) and now considering 8495/8609 (removed 114) transitions.
[2024-05-25 12:59:07] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
// Phase 1: matrix 7895 rows 5198 cols
[2024-05-25 12:59:07] [INFO ] Computed 1041 invariants in 183 ms
[2024-05-25 12:59:11] [INFO ] Implicit Places using invariants in 3924 ms returned []
[2024-05-25 12:59:11] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 12:59:11] [INFO ] Invariant cache hit.
[2024-05-25 12:59:14] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 7509 ms to find 0 implicit places.
[2024-05-25 12:59:14] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 12:59:14] [INFO ] Invariant cache hit.
[2024-05-25 12:59:20] [INFO ] Dead Transitions using invariants and state equation in 5091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5198/5228 places, 8495/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14774 ms. Remains : 5198/5228 places, 8495/8609 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s346 1) (GEQ s359 1)), p1:(OR (LT s2692 1) (LT s2774 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 1390 reset in 1047 ms.
Product exploration explored 100000 steps with 1389 reset in 1066 ms.
Computed a total of 2574 stabilizing places and 3294 stable transitions
Computed a total of 2574 stabilizing places and 3294 stable transitions
Detected a total of 2574/5198 stabilizing places and 3294/8495 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22131 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22131 steps, saw 10553 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 12:59:26] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 12:59:26] [INFO ] Invariant cache hit.
[2024-05-25 12:59:27] [INFO ] [Real]Absence check using 47 positive place invariants in 40 ms returned sat
[2024-05-25 12:59:27] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 350 ms returned sat
[2024-05-25 12:59:31] [INFO ] After 4267ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 12:59:31] [INFO ] State equation strengthened by 2914 read => feed constraints.
[2024-05-25 12:59:32] [INFO ] After 502ms SMT Verify possible using 2914 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:59:32] [INFO ] After 5961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 12:59:32] [INFO ] [Nat]Absence check using 47 positive place invariants in 41 ms returned sat
[2024-05-25 12:59:33] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 341 ms returned sat
[2024-05-25 12:59:38] [INFO ] After 4808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 12:59:40] [INFO ] After 2090ms SMT Verify possible using 2914 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 12:59:46] [INFO ] Deduced a trap composed of 687 places in 5430 ms of which 5 ms to minimize.
[2024-05-25 12:59:52] [INFO ] Deduced a trap composed of 544 places in 5337 ms of which 5 ms to minimize.
[2024-05-25 12:59:57] [INFO ] Deduced a trap composed of 968 places in 5005 ms of which 4 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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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-25 12:59:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 12:59:57] [INFO ] After 25492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 5198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5198/5198 places, 8495/8495 transitions.
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 374 Pre rules applied. Total rules applied 0 place count 5198 transition count 8121
Deduced a syphon composed of 374 places in 6 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 0 with 748 rules applied. Total rules applied 748 place count 4824 transition count 8121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 798 place count 4799 transition count 8096
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 1136 place count 4799 transition count 11046
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 1474 place count 4461 transition count 11046
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 1522 place count 4461 transition count 11046
Applied a total of 1522 rules in 2796 ms. Remains 4461 /5198 variables (removed 737) and now considering 11046/8495 (removed -2551) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2796 ms. Remains : 4461/5198 places, 11046/8495 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:00:01] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
// Phase 1: matrix 10160 rows 4461 cols
[2024-05-25 13:00:01] [INFO ] Computed 1041 invariants in 246 ms
[2024-05-25 13:00:01] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 13:00:02] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 263 ms returned sat
[2024-05-25 13:00:07] [INFO ] After 4920ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:00:07] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:00:08] [INFO ] After 1391ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:00:08] [INFO ] After 7204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:00:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 13:00:09] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 264 ms returned sat
[2024-05-25 13:00:14] [INFO ] After 5114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:00:16] [INFO ] After 2325ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:00:17] [INFO ] After 2858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 350 ms.
[2024-05-25 13:00:17] [INFO ] After 9133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 646 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 22995 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22995 steps, saw 10562 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:00:21] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:00:21] [INFO ] Invariant cache hit.
[2024-05-25 13:00:22] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 13:00:22] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 268 ms returned sat
[2024-05-25 13:00:27] [INFO ] After 4671ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:00:27] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:00:28] [INFO ] After 948ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:00:28] [INFO ] After 6501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:00:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 13:00:29] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 273 ms returned sat
[2024-05-25 13:00:34] [INFO ] After 4942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:00:35] [INFO ] After 1616ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:00:36] [INFO ] After 2192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-25 13:00:36] [INFO ] After 8338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 719 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 640 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
[2024-05-25 13:00:37] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:00:37] [INFO ] Invariant cache hit.
[2024-05-25 13:00:43] [INFO ] Implicit Places using invariants in 5491 ms returned []
Implicit Place search using SMT only with invariants took 5492 ms to find 0 implicit places.
[2024-05-25 13:00:43] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:00:43] [INFO ] Invariant cache hit.
[2024-05-25 13:00:49] [INFO ] Dead Transitions using invariants and state equation in 6110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12262 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Graph (trivial) has 3379 edges and 4461 vertex of which 25 / 4461 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 35970 edges and 4437 vertex of which 4415 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4029 transition count 9317
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3787 transition count 8836
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3546 transition count 8396
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3306 transition count 7998
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3106 transition count 7638
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2908 transition count 7316
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2746 transition count 7028
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2586 transition count 6774
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2458 transition count 6550
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2332 transition count 6356
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2234 transition count 6188
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2138 transition count 6046
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2066 transition count 5926
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1996 transition count 5828
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1946 transition count 5748
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1898 transition count 5686
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1866 transition count 5638
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1836 transition count 5604
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1818 transition count 5580
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1802 transition count 5566
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1794 transition count 5558
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1787 transition count 5556
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1785 transition count 5556
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6250 place count 1785 transition count 5206
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 348 places
Reduce places removed 698 places and 0 transitions.
Iterating global reduction 23 with 1048 rules applied. Total rules applied 7298 place count 1087 transition count 5206
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 727 transition count 4846
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 727 transition count 4846
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 727 transition count 4845
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 726 transition count 4845
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 8548 place count 198 transition count 1149
Iterating global reduction 23 with 528 rules applied. Total rules applied 9076 place count 198 transition count 1149
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 9604 place count 198 transition count 621
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 9654 place count 173 transition count 596
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9666 place count 173 transition count 584
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9678 place count 161 transition count 584
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 25 with 48 rules applied. Total rules applied 9726 place count 161 transition count 584
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9748 place count 139 transition count 430
Iterating global reduction 25 with 22 rules applied. Total rules applied 9770 place count 139 transition count 430
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9792 place count 139 transition count 408
Applied a total of 9792 rules in 6199 ms. Remains 139 /4461 variables (removed 4322) and now considering 408/11046 (removed 10638) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 408 rows 139 cols
[2024-05-25 13:00:55] [INFO ] Computed 43 invariants in 8 ms
[2024-05-25 13:00:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:00:55] [INFO ] [Real]Absence check using 3 positive and 40 generalized place invariants in 5 ms returned sat
[2024-05-25 13:00:55] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:00:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:00:55] [INFO ] [Nat]Absence check using 3 positive and 40 generalized place invariants in 5 ms returned sat
[2024-05-25 13:00:55] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:00:56] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 13:00:56] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5198/5198 places, 8495/8495 transitions.
Applied a total of 0 rules in 486 ms. Remains 5198 /5198 variables (removed 0) and now considering 8495/8495 (removed 0) transitions.
[2024-05-25 13:00:57] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
// Phase 1: matrix 7895 rows 5198 cols
[2024-05-25 13:00:57] [INFO ] Computed 1041 invariants in 173 ms
[2024-05-25 13:01:01] [INFO ] Implicit Places using invariants in 4221 ms returned []
[2024-05-25 13:01:01] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 13:01:01] [INFO ] Invariant cache hit.
[2024-05-25 13:01:04] [INFO ] Implicit Places using invariants and state equation in 3688 ms returned []
Implicit Place search using SMT with State Equation took 7925 ms to find 0 implicit places.
[2024-05-25 13:01:04] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 13:01:04] [INFO ] Invariant cache hit.
[2024-05-25 13:01:10] [INFO ] Dead Transitions using invariants and state equation in 5318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13732 ms. Remains : 5198/5198 places, 8495/8495 transitions.
Computed a total of 2574 stabilizing places and 3294 stable transitions
Computed a total of 2574 stabilizing places and 3294 stable transitions
Detected a total of 2574/5198 stabilizing places and 3294/8495 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22627 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22627 steps, saw 10782 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 13:01:14] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 13:01:14] [INFO ] Invariant cache hit.
[2024-05-25 13:01:14] [INFO ] [Real]Absence check using 47 positive place invariants in 48 ms returned sat
[2024-05-25 13:01:15] [INFO ] [Real]Absence check using 47 positive and 994 generalized place invariants in 342 ms returned sat
[2024-05-25 13:01:19] [INFO ] After 4259ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-25 13:01:19] [INFO ] State equation strengthened by 2914 read => feed constraints.
[2024-05-25 13:01:19] [INFO ] After 495ms SMT Verify possible using 2914 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:01:19] [INFO ] After 5903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 13:01:20] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2024-05-25 13:01:20] [INFO ] [Nat]Absence check using 47 positive and 994 generalized place invariants in 333 ms returned sat
[2024-05-25 13:01:25] [INFO ] After 4398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 13:01:27] [INFO ] After 2074ms SMT Verify possible using 2914 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 13:01:33] [INFO ] Deduced a trap composed of 687 places in 5406 ms of which 5 ms to minimize.
[2024-05-25 13:01:39] [INFO ] Deduced a trap composed of 544 places in 5333 ms of which 5 ms to minimize.
[2024-05-25 13:01:45] [INFO ] Deduced a trap composed of 968 places in 5415 ms of which 5 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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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-25 13:01:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 13:01:45] [INFO ] After 25440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 5198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5198/5198 places, 8495/8495 transitions.
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 374 Pre rules applied. Total rules applied 0 place count 5198 transition count 8121
Deduced a syphon composed of 374 places in 4 ms
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 0 with 748 rules applied. Total rules applied 748 place count 4824 transition count 8121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 798 place count 4799 transition count 8096
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 1136 place count 4799 transition count 11046
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 1474 place count 4461 transition count 11046
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 1522 place count 4461 transition count 11046
Applied a total of 1522 rules in 2760 ms. Remains 4461 /5198 variables (removed 737) and now considering 11046/8495 (removed -2551) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2760 ms. Remains : 4461/5198 places, 11046/8495 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:01:48] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
// Phase 1: matrix 10160 rows 4461 cols
[2024-05-25 13:01:48] [INFO ] Computed 1041 invariants in 225 ms
[2024-05-25 13:01:49] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 13:01:49] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 262 ms returned sat
[2024-05-25 13:01:54] [INFO ] After 4925ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:01:54] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:01:56] [INFO ] After 1361ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:01:56] [INFO ] After 7214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:01:56] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2024-05-25 13:01:56] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 269 ms returned sat
[2024-05-25 13:02:01] [INFO ] After 4964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:02:04] [INFO ] After 2279ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:02:04] [INFO ] After 2832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 350 ms.
[2024-05-25 13:02:05] [INFO ] After 8963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 653 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23843 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23843 steps, saw 10935 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:02:09] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:02:09] [INFO ] Invariant cache hit.
[2024-05-25 13:02:09] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2024-05-25 13:02:09] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 266 ms returned sat
[2024-05-25 13:02:14] [INFO ] After 4609ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:02:14] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:02:15] [INFO ] After 960ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:02:15] [INFO ] After 6482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:02:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 13:02:16] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 272 ms returned sat
[2024-05-25 13:02:21] [INFO ] After 4691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:02:22] [INFO ] After 1633ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:02:23] [INFO ] After 2197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 351 ms.
[2024-05-25 13:02:23] [INFO ] After 8095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 626 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 635 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
[2024-05-25 13:02:24] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:02:24] [INFO ] Invariant cache hit.
[2024-05-25 13:02:30] [INFO ] Implicit Places using invariants in 5603 ms returned []
Implicit Place search using SMT only with invariants took 5620 ms to find 0 implicit places.
[2024-05-25 13:02:30] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:02:30] [INFO ] Invariant cache hit.
[2024-05-25 13:02:36] [INFO ] Dead Transitions using invariants and state equation in 6249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12525 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Graph (trivial) has 3379 edges and 4461 vertex of which 25 / 4461 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 35970 edges and 4437 vertex of which 4415 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4029 transition count 9317
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3787 transition count 8836
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3546 transition count 8396
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3306 transition count 7998
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3106 transition count 7638
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2908 transition count 7316
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2746 transition count 7028
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2586 transition count 6774
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2458 transition count 6550
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2332 transition count 6356
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2234 transition count 6188
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2138 transition count 6046
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2066 transition count 5926
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1996 transition count 5828
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1946 transition count 5748
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1898 transition count 5686
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1866 transition count 5638
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1836 transition count 5604
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1818 transition count 5580
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1802 transition count 5566
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1794 transition count 5558
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1787 transition count 5556
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1785 transition count 5556
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6250 place count 1785 transition count 5206
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 348 places
Reduce places removed 698 places and 0 transitions.
Iterating global reduction 23 with 1048 rules applied. Total rules applied 7298 place count 1087 transition count 5206
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 727 transition count 4846
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 727 transition count 4846
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 727 transition count 4845
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 726 transition count 4845
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 8548 place count 198 transition count 1149
Iterating global reduction 23 with 528 rules applied. Total rules applied 9076 place count 198 transition count 1149
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 9604 place count 198 transition count 621
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 9654 place count 173 transition count 596
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9666 place count 173 transition count 584
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9678 place count 161 transition count 584
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 25 with 48 rules applied. Total rules applied 9726 place count 161 transition count 584
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9748 place count 139 transition count 430
Iterating global reduction 25 with 22 rules applied. Total rules applied 9770 place count 139 transition count 430
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9792 place count 139 transition count 408
Applied a total of 9792 rules in 6212 ms. Remains 139 /4461 variables (removed 4322) and now considering 408/11046 (removed 10638) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 408 rows 139 cols
[2024-05-25 13:02:43] [INFO ] Computed 43 invariants in 4 ms
[2024-05-25 13:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:02:43] [INFO ] [Real]Absence check using 3 positive and 40 generalized place invariants in 7 ms returned sat
[2024-05-25 13:02:43] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:02:43] [INFO ] [Nat]Absence check using 3 positive and 40 generalized place invariants in 5 ms returned sat
[2024-05-25 13:02:43] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:02:43] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 13:02:43] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1391 reset in 901 ms.
Product exploration explored 100000 steps with 1392 reset in 941 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5198/5198 places, 8495/8495 transitions.
Performed 362 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 362 Pre rules applied. Total rules applied 0 place count 5198 transition count 8495
Deduced a syphon composed of 362 places in 5 ms
Iterating global reduction 0 with 362 rules applied. Total rules applied 362 place count 5198 transition count 8495
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 387 places in 5 ms
Iterating global reduction 0 with 25 rules applied. Total rules applied 387 place count 5198 transition count 8495
Deduced a syphon composed of 387 places in 4 ms
Applied a total of 387 rules in 1651 ms. Remains 5198 /5198 variables (removed 0) and now considering 8495/8495 (removed 0) transitions.
[2024-05-25 13:02:48] [INFO ] Redundant transitions in 719 ms returned []
[2024-05-25 13:02:48] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
// Phase 1: matrix 7895 rows 5198 cols
[2024-05-25 13:02:48] [INFO ] Computed 1041 invariants in 203 ms
[2024-05-25 13:02:53] [INFO ] Dead Transitions using invariants and state equation in 5363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5198/5198 places, 8495/8495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7761 ms. Remains : 5198/5198 places, 8495/8495 transitions.
Built C files in :
/tmp/ltsmin6797430673924531531
[2024-05-25 13:02:53] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6797430673924531531
Running compilation step : cd /tmp/ltsmin6797430673924531531;'/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/ltsmin6797430673924531531;'/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/ltsmin6797430673924531531;'/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 5198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5198/5198 places, 8495/8495 transitions.
Applied a total of 0 rules in 332 ms. Remains 5198 /5198 variables (removed 0) and now considering 8495/8495 (removed 0) transitions.
[2024-05-25 13:02:57] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
// Phase 1: matrix 7895 rows 5198 cols
[2024-05-25 13:02:57] [INFO ] Computed 1041 invariants in 167 ms
[2024-05-25 13:03:00] [INFO ] Implicit Places using invariants in 3700 ms returned []
[2024-05-25 13:03:00] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 13:03:00] [INFO ] Invariant cache hit.
[2024-05-25 13:03:04] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 7336 ms to find 0 implicit places.
[2024-05-25 13:03:04] [INFO ] Flow matrix only has 7895 transitions (discarded 600 similar events)
[2024-05-25 13:03:04] [INFO ] Invariant cache hit.
[2024-05-25 13:03:09] [INFO ] Dead Transitions using invariants and state equation in 4843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12524 ms. Remains : 5198/5198 places, 8495/8495 transitions.
Built C files in :
/tmp/ltsmin17367943907060367788
[2024-05-25 13:03:09] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17367943907060367788
Running compilation step : cd /tmp/ltsmin17367943907060367788;'/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/ltsmin17367943907060367788;'/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/ltsmin17367943907060367788;'/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-25 13:03:12] [INFO ] Flatten gal took : 210 ms
[2024-05-25 13:03:13] [INFO ] Flatten gal took : 215 ms
[2024-05-25 13:03:13] [INFO ] Time to serialize gal into /tmp/LTL5714719419096210808.gal : 32 ms
[2024-05-25 13:03:13] [INFO ] Time to serialize properties into /tmp/LTL7479605068501453211.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5714719419096210808.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14993943446560689450.hoa' '-atoms' '/tmp/LTL7479605068501453211.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/LTL7479605068501453211.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14993943446560689450.hoa
Detected timeout of ITS tools.
[2024-05-25 13:03:28] [INFO ] Flatten gal took : 225 ms
[2024-05-25 13:03:28] [INFO ] Flatten gal took : 225 ms
[2024-05-25 13:03:28] [INFO ] Time to serialize gal into /tmp/LTL1669266286726460168.gal : 37 ms
[2024-05-25 13:03:28] [INFO ] Time to serialize properties into /tmp/LTL12433830871138913309.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1669266286726460168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12433830871138913309.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...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))"))))||(G("((Node15HasAskedItsLeafSetToLx...211
Formula 0 simplified : XXG!"((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))" & F!"((Node15HasAskedItsLeafSetToLx6ToRepla...199
Detected timeout of ITS tools.
[2024-05-25 13:03:44] [INFO ] Flatten gal took : 242 ms
[2024-05-25 13:03:44] [INFO ] Applying decomposition
[2024-05-25 13:03:44] [INFO ] Flatten gal took : 246 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/graph4540111319560751696.txt' '-o' '/tmp/graph4540111319560751696.bin' '-w' '/tmp/graph4540111319560751696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4540111319560751696.bin' '-l' '-1' '-v' '-w' '/tmp/graph4540111319560751696.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:03:44] [INFO ] Decomposing Gal with order
[2024-05-25 13:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:03:46] [INFO ] Removed a total of 6172 redundant transitions.
[2024-05-25 13:03:46] [INFO ] Flatten gal took : 751 ms
[2024-05-25 13:03:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4370 labels/synchronizations in 265 ms.
[2024-05-25 13:03:46] [INFO ] Time to serialize gal into /tmp/LTL1983626345377272524.gal : 53 ms
[2024-05-25 13:03:46] [INFO ] Time to serialize properties into /tmp/LTL383034962855955505.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/LTL1983626345377272524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL383034962855955505.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...253
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i32.u23.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i32.u617.LeafSetOfRx1IsSentToNode0>=1))"))))||(G("((i7.u9.Node1...242
Formula 0 simplified : XXG!"((i32.u23.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i32.u617.LeafSetOfRx1IsSentToNode0>=1))" & F!"((i7.u9.Node15HasAske...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16182682085937374028
[2024-05-25 13:04:01] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16182682085937374028
Running compilation step : cd /tmp/ltsmin16182682085937374028;'/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/ltsmin16182682085937374028;'/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/ltsmin16182682085937374028;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10 finished in 299556 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((X((F(p2)&&p1))||p0))))'
Support contains 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5213 transition count 8570
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5213 transition count 8570
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 5202 transition count 8529
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 5202 transition count 8529
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 5196 transition count 8487
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 5196 transition count 8487
Applied a total of 64 rules in 1347 ms. Remains 5196 /5228 variables (removed 32) and now considering 8487/8609 (removed 122) transitions.
[2024-05-25 13:04:06] [INFO ] Flow matrix only has 7887 transitions (discarded 600 similar events)
// Phase 1: matrix 7887 rows 5196 cols
[2024-05-25 13:04:06] [INFO ] Computed 1041 invariants in 184 ms
[2024-05-25 13:04:10] [INFO ] Implicit Places using invariants in 4205 ms returned []
[2024-05-25 13:04:10] [INFO ] Flow matrix only has 7887 transitions (discarded 600 similar events)
[2024-05-25 13:04:10] [INFO ] Invariant cache hit.
[2024-05-25 13:04:14] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 8084 ms to find 0 implicit places.
[2024-05-25 13:04:14] [INFO ] Flow matrix only has 7887 transitions (discarded 600 similar events)
[2024-05-25 13:04:14] [INFO ] Invariant cache hit.
[2024-05-25 13:04:19] [INFO ] Dead Transitions using invariants and state equation in 5311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5196/5228 places, 8487/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14758 ms. Remains : 5196/5228 places, 8487/8609 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1224 1) (LT s2154 1)), p1:(AND (GEQ s1224 1) (GEQ s2154 1)), p2:(AND (GEQ s2846 1) (GEQ s2878 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1389 reset in 1161 ms.
Product exploration explored 100000 steps with 1389 reset in 1182 ms.
Computed a total of 2572 stabilizing places and 3286 stable transitions
Computed a total of 2572 stabilizing places and 3286 stable transitions
Detected a total of 2572/5196 stabilizing places and 3286/8487 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1394 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:04:23] [INFO ] Flow matrix only has 7887 transitions (discarded 600 similar events)
[2024-05-25 13:04:23] [INFO ] Invariant cache hit.
[2024-05-25 13:04:24] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 14 factoid took 3037 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 5196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5196/5196 places, 8487/8487 transitions.
Performed 376 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 376 Pre rules applied. Total rules applied 0 place count 5196 transition count 8111
Deduced a syphon composed of 376 places in 7 ms
Reduce places removed 376 places and 0 transitions.
Iterating global reduction 0 with 752 rules applied. Total rules applied 752 place count 4820 transition count 8111
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 802 place count 4795 transition count 8086
Applied a total of 802 rules in 957 ms. Remains 4795 /5196 variables (removed 401) and now considering 8086/8487 (removed 401) transitions.
[2024-05-25 13:04:28] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 13:04:28] [INFO ] Computed 1041 invariants in 224 ms
[2024-05-25 13:04:34] [INFO ] Implicit Places using invariants in 6106 ms returned []
[2024-05-25 13:04:34] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:04:34] [INFO ] Invariant cache hit.
[2024-05-25 13:04:38] [INFO ] Implicit Places using invariants and state equation in 3711 ms returned []
Implicit Place search using SMT with State Equation took 9818 ms to find 0 implicit places.
[2024-05-25 13:04:39] [INFO ] Redundant transitions in 648 ms returned []
[2024-05-25 13:04:39] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:04:39] [INFO ] Invariant cache hit.
[2024-05-25 13:04:44] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4795/5196 places, 8086/8487 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16288 ms. Remains : 4795/5196 places, 8086/8487 transitions.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Detected a total of 2196/4795 stabilizing places and 2910/8086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 1704 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:04:46] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:04:46] [INFO ] Invariant cache hit.
[2024-05-25 13:04:46] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 3601 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1935 reset in 1343 ms.
Product exploration explored 100000 steps with 1935 reset in 1349 ms.
Built C files in :
/tmp/ltsmin8497015712043666883
[2024-05-25 13:04:53] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:04:53] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8497015712043666883
Running compilation step : cd /tmp/ltsmin8497015712043666883;'/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/ltsmin8497015712043666883;'/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/ltsmin8497015712043666883;'/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 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 464 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 13:04:56] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:04:56] [INFO ] Invariant cache hit.
[2024-05-25 13:05:00] [INFO ] Implicit Places using invariants in 3894 ms returned []
[2024-05-25 13:05:00] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:05:00] [INFO ] Invariant cache hit.
[2024-05-25 13:05:04] [INFO ] Implicit Places using invariants and state equation in 3867 ms returned []
Implicit Place search using SMT with State Equation took 7768 ms to find 0 implicit places.
[2024-05-25 13:05:05] [INFO ] Redundant transitions in 668 ms returned []
[2024-05-25 13:05:05] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:05:05] [INFO ] Invariant cache hit.
[2024-05-25 13:05:10] [INFO ] Dead Transitions using invariants and state equation in 4872 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13778 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Built C files in :
/tmp/ltsmin14624728799640348661
[2024-05-25 13:05:10] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:05:10] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14624728799640348661
Running compilation step : cd /tmp/ltsmin14624728799640348661;'/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/ltsmin14624728799640348661;'/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/ltsmin14624728799640348661;'/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-25 13:05:13] [INFO ] Flatten gal took : 202 ms
[2024-05-25 13:05:13] [INFO ] Flatten gal took : 203 ms
[2024-05-25 13:05:13] [INFO ] Time to serialize gal into /tmp/LTL204233292095448904.gal : 37 ms
[2024-05-25 13:05:13] [INFO ] Time to serialize properties into /tmp/LTL8916945001808205446.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL204233292095448904.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17436386069619609796.hoa' '-atoms' '/tmp/LTL8916945001808205446.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...317
Loading property file /tmp/LTL8916945001808205446.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17436386069619609796.hoa
Detected timeout of ITS tools.
[2024-05-25 13:05:29] [INFO ] Flatten gal took : 193 ms
[2024-05-25 13:05:29] [INFO ] Flatten gal took : 202 ms
[2024-05-25 13:05:29] [INFO ] Time to serialize gal into /tmp/LTL6686209549800530335.gal : 40 ms
[2024-05-25 13:05:29] [INFO ] Time to serialize properties into /tmp/LTL18378662157494757072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6686209549800530335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18378662157494757072.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((Node4IsActive<1)||(Node9DontAnswerToAnyNode<1))")||(X(("((Node4IsActive>=1)&&(Node9DontAnswerToAnyNode>=1))")&&(F("((Node16...240
Formula 0 simplified : GF(!"((Node4IsActive<1)||(Node9DontAnswerToAnyNode<1))" & X(!"((Node4IsActive>=1)&&(Node9DontAnswerToAnyNode>=1))" | G!"((Node16HasA...230
Detected timeout of ITS tools.
[2024-05-25 13:05:44] [INFO ] Flatten gal took : 190 ms
[2024-05-25 13:05:44] [INFO ] Applying decomposition
[2024-05-25 13:05:45] [INFO ] Flatten gal took : 196 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/graph4426864196022474846.txt' '-o' '/tmp/graph4426864196022474846.bin' '-w' '/tmp/graph4426864196022474846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4426864196022474846.bin' '-l' '-1' '-v' '-w' '/tmp/graph4426864196022474846.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:05:45] [INFO ] Decomposing Gal with order
[2024-05-25 13:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:05:46] [INFO ] Removed a total of 6722 redundant transitions.
[2024-05-25 13:05:47] [INFO ] Flatten gal took : 1091 ms
[2024-05-25 13:05:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4820 labels/synchronizations in 348 ms.
[2024-05-25 13:05:47] [INFO ] Time to serialize gal into /tmp/LTL14522360904368442862.gal : 60 ms
[2024-05-25 13:05:47] [INFO ] Time to serialize properties into /tmp/LTL2214519021636559378.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14522360904368442862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2214519021636559378.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 : !((F(G(("((i0.u1.Node4IsActive<1)||(i0.u1.Node9DontAnswerToAnyNode<1))")||(X(("((i0.u1.Node4IsActive>=1)&&(i0.u1.Node9DontAnswerToAnyN...281
Formula 0 simplified : GF(!"((i0.u1.Node4IsActive<1)||(i0.u1.Node9DontAnswerToAnyNode<1))" & X(!"((i0.u1.Node4IsActive>=1)&&(i0.u1.Node9DontAnswerToAnyNode...271
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6355772863088624200
[2024-05-25 13:06:02] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6355772863088624200
Running compilation step : cd /tmp/ltsmin6355772863088624200;'/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/ltsmin6355772863088624200;'/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/ltsmin6355772863088624200;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11 finished in 120970 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(p1)))))'
Support contains 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5215 transition count 8578
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5215 transition count 8578
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 5205 transition count 8532
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 5205 transition count 8532
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 5201 transition count 8504
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 5201 transition count 8504
Applied a total of 54 rules in 1416 ms. Remains 5201 /5228 variables (removed 27) and now considering 8504/8609 (removed 105) transitions.
[2024-05-25 13:06:07] [INFO ] Flow matrix only has 7904 transitions (discarded 600 similar events)
// Phase 1: matrix 7904 rows 5201 cols
[2024-05-25 13:06:07] [INFO ] Computed 1041 invariants in 185 ms
[2024-05-25 13:06:11] [INFO ] Implicit Places using invariants in 4204 ms returned []
[2024-05-25 13:06:11] [INFO ] Flow matrix only has 7904 transitions (discarded 600 similar events)
[2024-05-25 13:06:11] [INFO ] Invariant cache hit.
[2024-05-25 13:06:15] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 8036 ms to find 0 implicit places.
[2024-05-25 13:06:15] [INFO ] Flow matrix only has 7904 transitions (discarded 600 similar events)
[2024-05-25 13:06:15] [INFO ] Invariant cache hit.
[2024-05-25 13:06:20] [INFO ] Dead Transitions using invariants and state equation in 5204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5201/5228 places, 8504/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14657 ms. Remains : 5201/5228 places, 8504/8609 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2412 1) (LT s5078 1)), p1:(AND (LT s3214 1) (GEQ s2810 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-12 finished in 14846 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)||(p1&&X(F(p2))))))'
Support contains 5 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5213 transition count 8570
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5213 transition count 8570
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 5202 transition count 8523
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 5202 transition count 8523
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 5197 transition count 8488
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 5197 transition count 8488
Applied a total of 62 rules in 1388 ms. Remains 5197 /5228 variables (removed 31) and now considering 8488/8609 (removed 121) transitions.
[2024-05-25 13:06:22] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
// Phase 1: matrix 7888 rows 5197 cols
[2024-05-25 13:06:22] [INFO ] Computed 1041 invariants in 192 ms
[2024-05-25 13:06:26] [INFO ] Implicit Places using invariants in 4085 ms returned []
[2024-05-25 13:06:26] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
[2024-05-25 13:06:26] [INFO ] Invariant cache hit.
[2024-05-25 13:06:30] [INFO ] Implicit Places using invariants and state equation in 3943 ms returned []
Implicit Place search using SMT with State Equation took 8031 ms to find 0 implicit places.
[2024-05-25 13:06:30] [INFO ] Flow matrix only has 7888 transitions (discarded 600 similar events)
[2024-05-25 13:06:30] [INFO ] Invariant cache hit.
[2024-05-25 13:06:35] [INFO ] Dead Transitions using invariants and state equation in 5477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5197/5228 places, 8488/8609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14908 ms. Remains : 5197/5228 places, 8488/8609 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1434 1) (GEQ s3039 1)), p2:(OR (GEQ s3262 1) (AND (GEQ s1225 1) (GEQ s4530 1))), p1:(LT s3262 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 147 steps with 2 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-14 finished in 15121 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(F(p0)))'
Support contains 2 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 365 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 365 Pre rules applied. Total rules applied 12 place count 5222 transition count 8238
Deduced a syphon composed of 365 places in 6 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 742 place count 4857 transition count 8238
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 751 place count 4848 transition count 8211
Iterating global reduction 2 with 9 rules applied. Total rules applied 760 place count 4848 transition count 8211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 760 place count 4848 transition count 8208
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 766 place count 4845 transition count 8208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 772 place count 4839 transition count 8166
Iterating global reduction 2 with 6 rules applied. Total rules applied 778 place count 4839 transition count 8166
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 838 place count 4809 transition count 8136
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 844 place count 4803 transition count 8130
Iterating global reduction 2 with 6 rules applied. Total rules applied 850 place count 4803 transition count 8130
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 850 place count 4803 transition count 8125
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 860 place count 4798 transition count 8125
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 866 place count 4792 transition count 8083
Iterating global reduction 2 with 6 rules applied. Total rules applied 872 place count 4792 transition count 8083
Applied a total of 872 rules in 2447 ms. Remains 4792 /5228 variables (removed 436) and now considering 8083/8609 (removed 526) transitions.
[2024-05-25 13:06:38] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
// Phase 1: matrix 7483 rows 4792 cols
[2024-05-25 13:06:38] [INFO ] Computed 1041 invariants in 194 ms
[2024-05-25 13:06:43] [INFO ] Implicit Places using invariants in 5463 ms returned []
[2024-05-25 13:06:43] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 13:06:43] [INFO ] Invariant cache hit.
[2024-05-25 13:06:48] [INFO ] Implicit Places using invariants and state equation in 5313 ms returned []
Implicit Place search using SMT with State Equation took 10778 ms to find 0 implicit places.
[2024-05-25 13:06:49] [INFO ] Redundant transitions in 671 ms returned []
[2024-05-25 13:06:49] [INFO ] Flow matrix only has 7483 transitions (discarded 600 similar events)
[2024-05-25 13:06:49] [INFO ] Invariant cache hit.
[2024-05-25 13:06:55] [INFO ] Dead Transitions using invariants and state equation in 5395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4792/5228 places, 8083/8609 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19304 ms. Remains : 4792/5228 places, 8083/8609 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1868 1) (GEQ s4710 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-15 finished in 19444 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)))'
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(G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 365 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 365 Pre rules applied. Total rules applied 12 place count 5222 transition count 8238
Deduced a syphon composed of 365 places in 6 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 742 place count 4857 transition count 8238
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 752 place count 4847 transition count 8204
Iterating global reduction 2 with 10 rules applied. Total rules applied 762 place count 4847 transition count 8204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 762 place count 4847 transition count 8201
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 768 place count 4844 transition count 8201
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 774 place count 4838 transition count 8159
Iterating global reduction 2 with 6 rules applied. Total rules applied 780 place count 4838 transition count 8159
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 836 place count 4810 transition count 8131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 842 place count 4804 transition count 8125
Iterating global reduction 2 with 6 rules applied. Total rules applied 848 place count 4804 transition count 8125
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 848 place count 4804 transition count 8120
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 858 place count 4799 transition count 8120
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 864 place count 4793 transition count 8078
Iterating global reduction 2 with 6 rules applied. Total rules applied 870 place count 4793 transition count 8078
Applied a total of 870 rules in 2265 ms. Remains 4793 /5228 variables (removed 435) and now considering 8078/8609 (removed 531) transitions.
[2024-05-25 13:06:57] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4793 cols
[2024-05-25 13:06:57] [INFO ] Computed 1041 invariants in 179 ms
[2024-05-25 13:07:02] [INFO ] Implicit Places using invariants in 5208 ms returned []
[2024-05-25 13:07:02] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:07:02] [INFO ] Invariant cache hit.
[2024-05-25 13:07:06] [INFO ] Implicit Places using invariants and state equation in 3642 ms returned []
Implicit Place search using SMT with State Equation took 8852 ms to find 0 implicit places.
[2024-05-25 13:07:06] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:07:06] [INFO ] Invariant cache hit.
[2024-05-25 13:07:11] [INFO ] Dead Transitions using invariants and state equation in 4963 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4793/5228 places, 8078/8609 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16087 ms. Remains : 4793/5228 places, 8078/8609 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s2336 1) (GEQ s2339 1) (GEQ s3501 1)), p1:(OR (LT s3 1) (LT s5 1) (LT s2906 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1975 reset in 1366 ms.
Product exploration explored 100000 steps with 1973 reset in 1385 ms.
Computed a total of 2192 stabilizing places and 2900 stable transitions
Computed a total of 2192 stabilizing places and 2900 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 197 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 23471 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23471 steps, saw 11007 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 13:07:18] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:07:18] [INFO ] Invariant cache hit.
[2024-05-25 13:07:19] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2024-05-25 13:07:19] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 296 ms returned sat
[2024-05-25 13:07:19] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 13:07:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-05-25 13:07:20] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 306 ms returned sat
[2024-05-25 13:07:28] [INFO ] After 7450ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 13:07:28] [INFO ] State equation strengthened by 2902 read => feed constraints.
[2024-05-25 13:07:44] [INFO ] After 16216ms SMT Verify possible using 2902 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 13:07:44] [INFO ] After 16217ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 13:07:44] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Free-agglomeration rule (complex) applied 316 times.
Iterating global reduction 0 with 316 rules applied. Total rules applied 316 place count 4793 transition count 11062
Reduce places removed 316 places and 0 transitions.
Iterating post reduction 0 with 316 rules applied. Total rules applied 632 place count 4477 transition count 11062
Applied a total of 632 rules in 1139 ms. Remains 4477 /4793 variables (removed 316) and now considering 11062/8078 (removed -2984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1141 ms. Remains : 4477/4793 places, 11062/8078 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:07:46] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
// Phase 1: matrix 10196 rows 4477 cols
[2024-05-25 13:07:46] [INFO ] Computed 1041 invariants in 232 ms
[2024-05-25 13:07:47] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 13:07:47] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 281 ms returned sat
[2024-05-25 13:07:47] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:07:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2024-05-25 13:07:48] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 267 ms returned sat
[2024-05-25 13:07:54] [INFO ] After 6019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:07:54] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:08:03] [INFO ] After 9514ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:08:03] [INFO ] After 16450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 595 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21667 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21667 steps, saw 9972 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:08:08] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 13:08:08] [INFO ] Invariant cache hit.
[2024-05-25 13:08:08] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-05-25 13:08:08] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 285 ms returned sat
[2024-05-25 13:08:16] [INFO ] After 8382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:08:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2024-05-25 13:08:17] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 285 ms returned sat
[2024-05-25 13:08:24] [INFO ] After 6906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:08:24] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:08:33] [INFO ] After 9564ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:08:33] [INFO ] After 17405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 544 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 565 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
[2024-05-25 13:08:34] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 13:08:34] [INFO ] Invariant cache hit.
[2024-05-25 13:08:39] [INFO ] Implicit Places using invariants in 4149 ms returned []
Implicit Place search using SMT only with invariants took 4175 ms to find 0 implicit places.
[2024-05-25 13:08:39] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 13:08:39] [INFO ] Invariant cache hit.
[2024-05-25 13:08:45] [INFO ] Dead Transitions using invariants and state equation in 5897 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10643 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Graph (trivial) has 3297 edges and 4477 vertex of which 23 / 4477 are part of one of the 1 SCC in 2 ms
Free SCC test removed 22 places
Drop transitions removed 549 transitions
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 1436 transitions.
Graph (complete) has 36057 edges and 4455 vertex of which 4433 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 4049 transition count 9408
Ensure Unique test removed 1 places
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 1 with 643 rules applied. Total rules applied 863 place count 3832 transition count 8982
Reduce places removed 213 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 2 with 599 rules applied. Total rules applied 1462 place count 3619 transition count 8596
Ensure Unique test removed 32 places
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 3 with 554 rules applied. Total rules applied 2016 place count 3411 transition count 8250
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 170 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 4 with 483 rules applied. Total rules applied 2499 place count 3238 transition count 7940
Ensure Unique test removed 28 places
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 5 with 442 rules applied. Total rules applied 2941 place count 3070 transition count 7666
Reduce places removed 137 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 6 with 379 rules applied. Total rules applied 3320 place count 2933 transition count 7424
Ensure Unique test removed 24 places
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 342 rules applied. Total rules applied 3662 place count 2801 transition count 7214
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 8 with 287 rules applied. Total rules applied 3949 place count 2696 transition count 7032
Ensure Unique test removed 20 places
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 9 with 254 rules applied. Total rules applied 4203 place count 2596 transition count 6878
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 10 with 207 rules applied. Total rules applied 4410 place count 2519 transition count 6748
Ensure Unique test removed 16 places
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 11 with 178 rules applied. Total rules applied 4588 place count 2447 transition count 6642
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 12 with 139 rules applied. Total rules applied 4727 place count 2394 transition count 6556
Ensure Unique test removed 12 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 13 with 114 rules applied. Total rules applied 4841 place count 2346 transition count 6490
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 14 with 83 rules applied. Total rules applied 4924 place count 2313 transition count 6440
Ensure Unique test removed 8 places
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 15 with 62 rules applied. Total rules applied 4986 place count 2285 transition count 6406
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 16 with 39 rules applied. Total rules applied 5025 place count 2268 transition count 6384
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 17 with 22 rules applied. Total rules applied 5047 place count 2256 transition count 6374
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 18 with 13 rules applied. Total rules applied 5060 place count 2251 transition count 6366
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 19 with 23 rules applied. Total rules applied 5083 place count 2247 transition count 6347
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 20 with 19 rules applied. Total rules applied 5102 place count 2228 transition count 6347
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 350 Pre rules applied. Total rules applied 5102 place count 2228 transition count 5997
Deduced a syphon composed of 350 places in 2 ms
Ensure Unique test removed 350 places
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 21 with 1050 rules applied. Total rules applied 6152 place count 1528 transition count 5997
Discarding 358 places :
Symmetric choice reduction at 21 with 358 rule applications. Total rules 6510 place count 1170 transition count 5639
Iterating global reduction 21 with 358 rules applied. Total rules applied 6868 place count 1170 transition count 5639
Discarding 455 places :
Symmetric choice reduction at 21 with 455 rule applications. Total rules 7323 place count 715 transition count 2454
Iterating global reduction 21 with 455 rules applied. Total rules applied 7778 place count 715 transition count 2454
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 415 transitions.
Iterating post reduction 21 with 415 rules applied. Total rules applied 8193 place count 715 transition count 2039
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 22 with 694 rules applied. Total rules applied 8887 place count 368 transition count 1692
Drop transitions removed 324 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 22 with 342 rules applied. Total rules applied 9229 place count 368 transition count 1350
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 23 with 126 rules applied. Total rules applied 9355 place count 368 transition count 1224
Ensure Unique test removed 98 places
Iterating post reduction 23 with 98 rules applied. Total rules applied 9453 place count 270 transition count 1224
Discarding 97 places :
Symmetric choice reduction at 24 with 97 rule applications. Total rules 9550 place count 173 transition count 545
Iterating global reduction 24 with 97 rules applied. Total rules applied 9647 place count 173 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 24 with 86 rules applied. Total rules applied 9733 place count 173 transition count 459
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 25 with 7 rules applied. Total rules applied 9740 place count 173 transition count 452
Free-agglomeration rule applied 2 times.
Iterating global reduction 25 with 2 rules applied. Total rules applied 9742 place count 173 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 9744 place count 171 transition count 450
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 26 with 14 rules applied. Total rules applied 9758 place count 171 transition count 436
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 26 with 14 rules applied. Total rules applied 9772 place count 157 transition count 436
Discarding 22 places :
Symmetric choice reduction at 27 with 22 rule applications. Total rules 9794 place count 135 transition count 282
Iterating global reduction 27 with 22 rules applied. Total rules applied 9816 place count 135 transition count 282
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 9836 place count 135 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 9837 place count 135 transition count 262
Applied a total of 9837 rules in 8410 ms. Remains 135 /4477 variables (removed 4342) and now considering 262/11062 (removed 10800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 135 cols
[2024-05-25 13:08:53] [INFO ] Computed 42 invariants in 5 ms
[2024-05-25 13:08:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-25 13:08:53] [INFO ] [Real]Absence check using 4 positive and 38 generalized place invariants in 7 ms returned sat
[2024-05-25 13:08:53] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:08:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:08:53] [INFO ] [Nat]Absence check using 4 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-25 13:08:53] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:08:53] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-25 13:08:53] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Applied a total of 0 rules in 497 ms. Remains 4793 /4793 variables (removed 0) and now considering 8078/8078 (removed 0) transitions.
[2024-05-25 13:08:55] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4793 cols
[2024-05-25 13:08:55] [INFO ] Computed 1041 invariants in 183 ms
[2024-05-25 13:09:00] [INFO ] Implicit Places using invariants in 5362 ms returned []
[2024-05-25 13:09:00] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:09:00] [INFO ] Invariant cache hit.
[2024-05-25 13:09:03] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 8915 ms to find 0 implicit places.
[2024-05-25 13:09:04] [INFO ] Redundant transitions in 644 ms returned []
[2024-05-25 13:09:04] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:09:04] [INFO ] Invariant cache hit.
[2024-05-25 13:09:09] [INFO ] Dead Transitions using invariants and state equation in 4693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14758 ms. Remains : 4793/4793 places, 8078/8078 transitions.
Computed a total of 2192 stabilizing places and 2900 stable transitions
Computed a total of 2192 stabilizing places and 2900 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 168 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 197 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2024-05-25 13:09:10] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:09:10] [INFO ] Invariant cache hit.
[2024-05-25 13:09:10] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-05-25 13:09:11] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 309 ms returned sat
[2024-05-25 13:09:11] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 13:09:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2024-05-25 13:09:12] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 287 ms returned sat
[2024-05-25 13:09:17] [INFO ] After 5241ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 13:09:17] [INFO ] State equation strengthened by 2902 read => feed constraints.
[2024-05-25 13:09:26] [INFO ] After 9206ms SMT Verify possible using 2902 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-25 13:09:26] [INFO ] After 15377ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Free-agglomeration rule (complex) applied 316 times.
Iterating global reduction 0 with 316 rules applied. Total rules applied 316 place count 4793 transition count 11062
Reduce places removed 316 places and 0 transitions.
Iterating post reduction 0 with 316 rules applied. Total rules applied 632 place count 4477 transition count 11062
Applied a total of 632 rules in 1206 ms. Remains 4477 /4793 variables (removed 316) and now considering 11062/8078 (removed -2984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1206 ms. Remains : 4477/4793 places, 11062/8078 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23715 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23715 steps, saw 10875 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:09:31] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
// Phase 1: matrix 10196 rows 4477 cols
[2024-05-25 13:09:31] [INFO ] Computed 1041 invariants in 233 ms
[2024-05-25 13:09:32] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2024-05-25 13:09:32] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 301 ms returned sat
[2024-05-25 13:09:32] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:09:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2024-05-25 13:09:33] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 295 ms returned sat
[2024-05-25 13:09:40] [INFO ] After 6511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:09:40] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:09:49] [INFO ] After 9532ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 13:09:49] [INFO ] After 17019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 4477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 557 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4477/4477 places, 11062/11062 transitions.
Applied a total of 0 rules in 548 ms. Remains 4477 /4477 variables (removed 0) and now considering 11062/11062 (removed 0) transitions.
[2024-05-25 13:09:50] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 13:09:50] [INFO ] Invariant cache hit.
[2024-05-25 13:09:54] [INFO ] Implicit Places using invariants in 4254 ms returned []
Implicit Place search using SMT only with invariants took 4255 ms to find 0 implicit places.
[2024-05-25 13:09:54] [INFO ] Flow matrix only has 10196 transitions (discarded 866 similar events)
[2024-05-25 13:09:54] [INFO ] Invariant cache hit.
[2024-05-25 13:10:00] [INFO ] Dead Transitions using invariants and state equation in 5971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10778 ms. Remains : 4477/4477 places, 11062/11062 transitions.
Graph (trivial) has 3297 edges and 4477 vertex of which 23 / 4477 are part of one of the 1 SCC in 2 ms
Free SCC test removed 22 places
Drop transitions removed 549 transitions
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 1436 transitions.
Graph (complete) has 36057 edges and 4455 vertex of which 4433 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 4049 transition count 9408
Ensure Unique test removed 1 places
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 1 with 643 rules applied. Total rules applied 863 place count 3832 transition count 8982
Reduce places removed 213 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 210 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 2 with 599 rules applied. Total rules applied 1462 place count 3619 transition count 8596
Ensure Unique test removed 32 places
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 3 with 554 rules applied. Total rules applied 2016 place count 3411 transition count 8250
Reduce places removed 173 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 170 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 4 with 483 rules applied. Total rules applied 2499 place count 3238 transition count 7940
Ensure Unique test removed 28 places
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 5 with 442 rules applied. Total rules applied 2941 place count 3070 transition count 7666
Reduce places removed 137 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 6 with 379 rules applied. Total rules applied 3320 place count 2933 transition count 7424
Ensure Unique test removed 24 places
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 7 with 342 rules applied. Total rules applied 3662 place count 2801 transition count 7214
Reduce places removed 105 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 8 with 287 rules applied. Total rules applied 3949 place count 2696 transition count 7032
Ensure Unique test removed 20 places
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 9 with 254 rules applied. Total rules applied 4203 place count 2596 transition count 6878
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 10 with 207 rules applied. Total rules applied 4410 place count 2519 transition count 6748
Ensure Unique test removed 16 places
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 11 with 178 rules applied. Total rules applied 4588 place count 2447 transition count 6642
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 12 with 139 rules applied. Total rules applied 4727 place count 2394 transition count 6556
Ensure Unique test removed 12 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 13 with 114 rules applied. Total rules applied 4841 place count 2346 transition count 6490
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 14 with 83 rules applied. Total rules applied 4924 place count 2313 transition count 6440
Ensure Unique test removed 8 places
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 15 with 62 rules applied. Total rules applied 4986 place count 2285 transition count 6406
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 16 with 39 rules applied. Total rules applied 5025 place count 2268 transition count 6384
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 17 with 22 rules applied. Total rules applied 5047 place count 2256 transition count 6374
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 18 with 13 rules applied. Total rules applied 5060 place count 2251 transition count 6366
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 19 with 23 rules applied. Total rules applied 5083 place count 2247 transition count 6347
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 20 with 19 rules applied. Total rules applied 5102 place count 2228 transition count 6347
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 350 Pre rules applied. Total rules applied 5102 place count 2228 transition count 5997
Deduced a syphon composed of 350 places in 2 ms
Ensure Unique test removed 350 places
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 21 with 1050 rules applied. Total rules applied 6152 place count 1528 transition count 5997
Discarding 358 places :
Symmetric choice reduction at 21 with 358 rule applications. Total rules 6510 place count 1170 transition count 5639
Iterating global reduction 21 with 358 rules applied. Total rules applied 6868 place count 1170 transition count 5639
Discarding 455 places :
Symmetric choice reduction at 21 with 455 rule applications. Total rules 7323 place count 715 transition count 2454
Iterating global reduction 21 with 455 rules applied. Total rules applied 7778 place count 715 transition count 2454
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 415 transitions.
Iterating post reduction 21 with 415 rules applied. Total rules applied 8193 place count 715 transition count 2039
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 1 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 22 with 694 rules applied. Total rules applied 8887 place count 368 transition count 1692
Drop transitions removed 324 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 22 with 342 rules applied. Total rules applied 9229 place count 368 transition count 1350
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 23 with 126 rules applied. Total rules applied 9355 place count 368 transition count 1224
Ensure Unique test removed 98 places
Iterating post reduction 23 with 98 rules applied. Total rules applied 9453 place count 270 transition count 1224
Discarding 97 places :
Symmetric choice reduction at 24 with 97 rule applications. Total rules 9550 place count 173 transition count 545
Iterating global reduction 24 with 97 rules applied. Total rules applied 9647 place count 173 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 24 with 86 rules applied. Total rules applied 9733 place count 173 transition count 459
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 25 with 7 rules applied. Total rules applied 9740 place count 173 transition count 452
Free-agglomeration rule applied 2 times.
Iterating global reduction 25 with 2 rules applied. Total rules applied 9742 place count 173 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 9744 place count 171 transition count 450
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 26 with 14 rules applied. Total rules applied 9758 place count 171 transition count 436
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 26 with 14 rules applied. Total rules applied 9772 place count 157 transition count 436
Discarding 22 places :
Symmetric choice reduction at 27 with 22 rule applications. Total rules 9794 place count 135 transition count 282
Iterating global reduction 27 with 22 rules applied. Total rules applied 9816 place count 135 transition count 282
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 9836 place count 135 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 9837 place count 135 transition count 262
Applied a total of 9837 rules in 8270 ms. Remains 135 /4477 variables (removed 4342) and now considering 262/11062 (removed 10800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 135 cols
[2024-05-25 13:10:09] [INFO ] Computed 42 invariants in 5 ms
[2024-05-25 13:10:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 13:10:09] [INFO ] [Real]Absence check using 4 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-25 13:10:09] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:10:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 13:10:09] [INFO ] [Nat]Absence check using 4 positive and 38 generalized place invariants in 6 ms returned sat
[2024-05-25 13:10:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:10:09] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-25 13:10:09] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0)]
Knowledge based reduction with 14 factoid took 264 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1973 reset in 1127 ms.
Product exploration explored 100000 steps with 1973 reset in 1159 ms.
Built C files in :
/tmp/ltsmin10186928646055671131
[2024-05-25 13:10:12] [INFO ] Too many transitions (8078) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:10:13] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10186928646055671131
Running compilation step : cd /tmp/ltsmin10186928646055671131;'/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/ltsmin10186928646055671131;'/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/ltsmin10186928646055671131;'/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 6 out of 4793 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4793/4793 places, 8078/8078 transitions.
Applied a total of 0 rules in 508 ms. Remains 4793 /4793 variables (removed 0) and now considering 8078/8078 (removed 0) transitions.
[2024-05-25 13:10:16] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
// Phase 1: matrix 7478 rows 4793 cols
[2024-05-25 13:10:16] [INFO ] Computed 1041 invariants in 185 ms
[2024-05-25 13:10:21] [INFO ] Implicit Places using invariants in 5080 ms returned []
[2024-05-25 13:10:21] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:10:21] [INFO ] Invariant cache hit.
[2024-05-25 13:10:25] [INFO ] Implicit Places using invariants and state equation in 3659 ms returned []
Implicit Place search using SMT with State Equation took 8739 ms to find 0 implicit places.
[2024-05-25 13:10:25] [INFO ] Redundant transitions in 663 ms returned []
[2024-05-25 13:10:26] [INFO ] Flow matrix only has 7478 transitions (discarded 600 similar events)
[2024-05-25 13:10:26] [INFO ] Invariant cache hit.
[2024-05-25 13:10:30] [INFO ] Dead Transitions using invariants and state equation in 4596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14517 ms. Remains : 4793/4793 places, 8078/8078 transitions.
Built C files in :
/tmp/ltsmin12753385519836512957
[2024-05-25 13:10:30] [INFO ] Too many transitions (8078) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:10:30] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12753385519836512957
Running compilation step : cd /tmp/ltsmin12753385519836512957;'/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/ltsmin12753385519836512957;'/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/ltsmin12753385519836512957;'/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-25 13:10:34] [INFO ] Flatten gal took : 238 ms
[2024-05-25 13:10:34] [INFO ] Flatten gal took : 250 ms
[2024-05-25 13:10:34] [INFO ] Time to serialize gal into /tmp/LTL1032837119224081765.gal : 284 ms
[2024-05-25 13:10:34] [INFO ] Time to serialize properties into /tmp/LTL8585149308517109559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1032837119224081765.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12087634322861383607.hoa' '-atoms' '/tmp/LTL8585149308517109559.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/LTL8585149308517109559.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12087634322861383607.hoa
Detected timeout of ITS tools.
[2024-05-25 13:10:50] [INFO ] Flatten gal took : 239 ms
[2024-05-25 13:10:50] [INFO ] Flatten gal took : 255 ms
[2024-05-25 13:10:50] [INFO ] Time to serialize gal into /tmp/LTL9418584301028328735.gal : 40 ms
[2024-05-25 13:10:50] [INFO ] Time to serialize properties into /tmp/LTL4587914084422265624.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/LTL9418584301028328735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4587914084422265624.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 : !(((F("(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((Node0IsActive<1)||(Node0IsT...212
Formula 0 simplified : G!"(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))" & XF!"(((Node0IsActive<1)||(Node0IsTheNod...202
Detected timeout of ITS tools.
[2024-05-25 13:11:05] [INFO ] Flatten gal took : 252 ms
[2024-05-25 13:11:05] [INFO ] Applying decomposition
[2024-05-25 13:11:05] [INFO ] Flatten gal took : 241 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/graph76393630342955451.txt' '-o' '/tmp/graph76393630342955451.bin' '-w' '/tmp/graph76393630342955451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph76393630342955451.bin' '-l' '-1' '-v' '-w' '/tmp/graph76393630342955451.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:11:06] [INFO ] Decomposing Gal with order
[2024-05-25 13:11:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:11:07] [INFO ] Removed a total of 6811 redundant transitions.
[2024-05-25 13:11:07] [INFO ] Flatten gal took : 1118 ms
[2024-05-25 13:11:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4926 labels/synchronizations in 308 ms.
[2024-05-25 13:11:08] [INFO ] Time to serialize gal into /tmp/LTL568049979067770881.gal : 104 ms
[2024-05-25 13:11:08] [INFO ] Time to serialize properties into /tmp/LTL10609998413475245779.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/LTL568049979067770881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10609998413475245779.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...254
Read 1 LTL properties
Checking formula 0 : !(((F("(((i1.u1.Node14IsActive>=1)&&(i1.u1.Node14IsTheNodeMaster>=1))&&(i1.u1.Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((i1.u1.Nod...248
Formula 0 simplified : G!"(((i1.u1.Node14IsActive>=1)&&(i1.u1.Node14IsTheNodeMaster>=1))&&(i1.u1.Node22AsksIsThereANodeMaster>=1))" & XF!"(((i1.u1.Node0IsA...238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3219020653563841667
[2024-05-25 13:11:23] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3219020653563841667
Running compilation step : cd /tmp/ltsmin3219020653563841667;'/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/ltsmin3219020653563841667;'/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/ltsmin3219020653563841667;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02 finished in 271424 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)))'
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(X(F(p0)))||G(p1)))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 363 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 363 Pre rules applied. Total rules applied 12 place count 5222 transition count 8240
Deduced a syphon composed of 363 places in 5 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 2 with 726 rules applied. Total rules applied 738 place count 4859 transition count 8240
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 746 place count 4851 transition count 8208
Iterating global reduction 2 with 8 rules applied. Total rules applied 754 place count 4851 transition count 8208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 754 place count 4851 transition count 8207
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 756 place count 4850 transition count 8207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 760 place count 4846 transition count 8179
Iterating global reduction 2 with 4 rules applied. Total rules applied 764 place count 4846 transition count 8179
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 824 place count 4816 transition count 8149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 830 place count 4810 transition count 8143
Iterating global reduction 2 with 6 rules applied. Total rules applied 836 place count 4810 transition count 8143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 836 place count 4810 transition count 8138
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 846 place count 4805 transition count 8138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 852 place count 4799 transition count 8096
Iterating global reduction 2 with 6 rules applied. Total rules applied 858 place count 4799 transition count 8096
Applied a total of 858 rules in 2236 ms. Remains 4799 /5228 variables (removed 429) and now considering 8096/8609 (removed 513) transitions.
[2024-05-25 13:11:29] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
// Phase 1: matrix 7496 rows 4799 cols
[2024-05-25 13:11:29] [INFO ] Computed 1041 invariants in 192 ms
[2024-05-25 13:11:33] [INFO ] Implicit Places using invariants in 4011 ms returned []
[2024-05-25 13:11:33] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:11:33] [INFO ] Invariant cache hit.
[2024-05-25 13:11:36] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 7635 ms to find 0 implicit places.
[2024-05-25 13:11:36] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:11:36] [INFO ] Invariant cache hit.
[2024-05-25 13:11:41] [INFO ] Dead Transitions using invariants and state equation in 4819 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4799/5228 places, 8096/8609 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14691 ms. Remains : 4799/5228 places, 8096/8609 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s333 1) (GEQ s343 1)), p1:(OR (LT s2455 1) (LT s2525 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1942 reset in 1205 ms.
Product exploration explored 100000 steps with 1936 reset in 1335 ms.
Computed a total of 2200 stabilizing places and 2920 stable transitions
Computed a total of 2200 stabilizing places and 2920 stable transitions
Detected a total of 2200/4799 stabilizing places and 2920/8096 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:11:44] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:11:44] [INFO ] Invariant cache hit.
[2024-05-25 13:11:45] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2024-05-25 13:11:45] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 287 ms returned sat
[2024-05-25 13:11:49] [INFO ] After 4055ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:11:49] [INFO ] State equation strengthened by 2914 read => feed constraints.
[2024-05-25 13:11:50] [INFO ] After 499ms SMT Verify possible using 2914 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:11:50] [INFO ] After 5459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:11:50] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2024-05-25 13:11:51] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 276 ms returned sat
[2024-05-25 13:11:55] [INFO ] After 3968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:11:56] [INFO ] After 830ms SMT Verify possible using 2914 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:12:01] [INFO ] Deduced a trap composed of 473 places in 4908 ms of which 4 ms to minimize.
[2024-05-25 13:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5775 ms
[2024-05-25 13:12:02] [INFO ] After 6778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-25 13:12:02] [INFO ] After 11939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 8096/8096 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 4799 transition count 11046
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 4461 transition count 11046
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 724 place count 4461 transition count 11046
Applied a total of 724 rules in 1706 ms. Remains 4461 /4799 variables (removed 338) and now considering 11046/8096 (removed -2950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1706 ms. Remains : 4461/4799 places, 11046/8096 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24027 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24027 steps, saw 11015 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:12:07] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
// Phase 1: matrix 10160 rows 4461 cols
[2024-05-25 13:12:07] [INFO ] Computed 1041 invariants in 223 ms
[2024-05-25 13:12:08] [INFO ] [Real]Absence check using 49 positive place invariants in 63 ms returned sat
[2024-05-25 13:12:08] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 285 ms returned sat
[2024-05-25 13:12:13] [INFO ] After 5227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:12:13] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:12:15] [INFO ] After 1185ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:12:15] [INFO ] After 7364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:12:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 61 ms returned sat
[2024-05-25 13:12:15] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 272 ms returned sat
[2024-05-25 13:12:21] [INFO ] After 5292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:12:23] [INFO ] After 1988ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:12:23] [INFO ] After 2539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-25 13:12:24] [INFO ] After 9043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 533 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 535 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 542 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
[2024-05-25 13:12:25] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:12:25] [INFO ] Invariant cache hit.
[2024-05-25 13:12:30] [INFO ] Implicit Places using invariants in 5548 ms returned []
Implicit Place search using SMT only with invariants took 5548 ms to find 0 implicit places.
[2024-05-25 13:12:30] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:12:30] [INFO ] Invariant cache hit.
[2024-05-25 13:12:36] [INFO ] Dead Transitions using invariants and state equation in 5879 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11971 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Graph (trivial) has 3379 edges and 4461 vertex of which 25 / 4461 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 35970 edges and 4437 vertex of which 4415 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4029 transition count 9317
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3787 transition count 8836
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3546 transition count 8396
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3306 transition count 7998
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3106 transition count 7638
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2908 transition count 7316
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2746 transition count 7028
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2586 transition count 6774
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2458 transition count 6550
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2332 transition count 6356
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2234 transition count 6188
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2138 transition count 6046
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2066 transition count 5926
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1996 transition count 5828
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1946 transition count 5748
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1898 transition count 5686
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1866 transition count 5638
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1836 transition count 5604
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1818 transition count 5580
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1802 transition count 5566
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1794 transition count 5558
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1787 transition count 5556
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1785 transition count 5556
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6250 place count 1785 transition count 5206
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 348 places
Reduce places removed 698 places and 0 transitions.
Iterating global reduction 23 with 1048 rules applied. Total rules applied 7298 place count 1087 transition count 5206
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 727 transition count 4846
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 727 transition count 4846
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 727 transition count 4845
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 726 transition count 4845
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 8548 place count 198 transition count 1149
Iterating global reduction 23 with 528 rules applied. Total rules applied 9076 place count 198 transition count 1149
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 9604 place count 198 transition count 621
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 9654 place count 173 transition count 596
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9666 place count 173 transition count 584
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9678 place count 161 transition count 584
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 25 with 48 rules applied. Total rules applied 9726 place count 161 transition count 584
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9748 place count 139 transition count 430
Iterating global reduction 25 with 22 rules applied. Total rules applied 9770 place count 139 transition count 430
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9792 place count 139 transition count 408
Applied a total of 9792 rules in 6247 ms. Remains 139 /4461 variables (removed 4322) and now considering 408/11046 (removed 10638) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 408 rows 139 cols
[2024-05-25 13:12:42] [INFO ] Computed 43 invariants in 11 ms
[2024-05-25 13:12:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:12:42] [INFO ] [Real]Absence check using 3 positive and 40 generalized place invariants in 5 ms returned sat
[2024-05-25 13:12:42] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:12:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:12:42] [INFO ] [Nat]Absence check using 3 positive and 40 generalized place invariants in 6 ms returned sat
[2024-05-25 13:12:43] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:12:43] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-25 13:12:43] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4799/4799 places, 8096/8096 transitions.
Applied a total of 0 rules in 308 ms. Remains 4799 /4799 variables (removed 0) and now considering 8096/8096 (removed 0) transitions.
[2024-05-25 13:12:44] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
// Phase 1: matrix 7496 rows 4799 cols
[2024-05-25 13:12:44] [INFO ] Computed 1041 invariants in 179 ms
[2024-05-25 13:12:47] [INFO ] Implicit Places using invariants in 3938 ms returned []
[2024-05-25 13:12:47] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:12:47] [INFO ] Invariant cache hit.
[2024-05-25 13:12:51] [INFO ] Implicit Places using invariants and state equation in 3730 ms returned []
Implicit Place search using SMT with State Equation took 7682 ms to find 0 implicit places.
[2024-05-25 13:12:51] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:12:51] [INFO ] Invariant cache hit.
[2024-05-25 13:12:56] [INFO ] Dead Transitions using invariants and state equation in 4719 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12714 ms. Remains : 4799/4799 places, 8096/8096 transitions.
Computed a total of 2200 stabilizing places and 2920 stable transitions
Computed a total of 2200 stabilizing places and 2920 stable transitions
Detected a total of 2200/4799 stabilizing places and 2920/8096 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:12:57] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:12:57] [INFO ] Invariant cache hit.
[2024-05-25 13:12:57] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2024-05-25 13:12:57] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 296 ms returned sat
[2024-05-25 13:13:02] [INFO ] After 4204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:13:02] [INFO ] State equation strengthened by 2914 read => feed constraints.
[2024-05-25 13:13:02] [INFO ] After 515ms SMT Verify possible using 2914 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:13:02] [INFO ] After 5660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:13:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 13:13:03] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 297 ms returned sat
[2024-05-25 13:13:07] [INFO ] After 4228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:13:08] [INFO ] After 867ms SMT Verify possible using 2914 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:13:13] [INFO ] Deduced a trap composed of 473 places in 4712 ms of which 5 ms to minimize.
[2024-05-25 13:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5584 ms
[2024-05-25 13:13:14] [INFO ] After 6633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 277 ms.
[2024-05-25 13:13:14] [INFO ] After 12076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 8096/8096 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 4799 transition count 11046
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 4461 transition count 11046
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 724 place count 4461 transition count 11046
Applied a total of 724 rules in 1727 ms. Remains 4461 /4799 variables (removed 338) and now considering 11046/8096 (removed -2950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1727 ms. Remains : 4461/4799 places, 11046/8096 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23350 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23350 steps, saw 10721 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:13:20] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
// Phase 1: matrix 10160 rows 4461 cols
[2024-05-25 13:13:20] [INFO ] Computed 1041 invariants in 224 ms
[2024-05-25 13:13:20] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2024-05-25 13:13:21] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 280 ms returned sat
[2024-05-25 13:13:26] [INFO ] After 5306ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 13:13:26] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-05-25 13:13:27] [INFO ] After 1213ms SMT Verify possible using 6202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:13:27] [INFO ] After 7472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:13:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2024-05-25 13:13:28] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 270 ms returned sat
[2024-05-25 13:13:33] [INFO ] After 4983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:13:35] [INFO ] After 2028ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:13:36] [INFO ] After 2624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 375 ms.
[2024-05-25 13:13:36] [INFO ] After 8873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 582 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4461/4461 places, 11046/11046 transitions.
Applied a total of 0 rules in 577 ms. Remains 4461 /4461 variables (removed 0) and now considering 11046/11046 (removed 0) transitions.
[2024-05-25 13:13:37] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:13:37] [INFO ] Invariant cache hit.
[2024-05-25 13:13:43] [INFO ] Implicit Places using invariants in 5679 ms returned []
Implicit Place search using SMT only with invariants took 5680 ms to find 0 implicit places.
[2024-05-25 13:13:43] [INFO ] Flow matrix only has 10160 transitions (discarded 886 similar events)
[2024-05-25 13:13:43] [INFO ] Invariant cache hit.
[2024-05-25 13:13:49] [INFO ] Dead Transitions using invariants and state equation in 6408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12669 ms. Remains : 4461/4461 places, 11046/11046 transitions.
Graph (trivial) has 3379 edges and 4461 vertex of which 25 / 4461 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 35970 edges and 4437 vertex of which 4415 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t3668.t4016 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4029 transition count 9317
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3787 transition count 8836
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3546 transition count 8396
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3306 transition count 7998
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3106 transition count 7638
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 2908 transition count 7316
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2746 transition count 7028
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2586 transition count 6774
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2458 transition count 6550
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2332 transition count 6356
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2234 transition count 6188
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2138 transition count 6046
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2066 transition count 5926
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 1996 transition count 5828
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 1946 transition count 5748
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 1898 transition count 5686
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 1866 transition count 5638
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1836 transition count 5604
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1818 transition count 5580
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1802 transition count 5566
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1794 transition count 5558
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1787 transition count 5556
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1785 transition count 5556
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 350 Pre rules applied. Total rules applied 6250 place count 1785 transition count 5206
Deduced a syphon composed of 350 places in 1 ms
Ensure Unique test removed 348 places
Reduce places removed 698 places and 0 transitions.
Iterating global reduction 23 with 1048 rules applied. Total rules applied 7298 place count 1087 transition count 5206
Discarding 360 places :
Symmetric choice reduction at 23 with 360 rule applications. Total rules 7658 place count 727 transition count 4846
Iterating global reduction 23 with 360 rules applied. Total rules applied 8018 place count 727 transition count 4846
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8018 place count 727 transition count 4845
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8020 place count 726 transition count 4845
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 8548 place count 198 transition count 1149
Iterating global reduction 23 with 528 rules applied. Total rules applied 9076 place count 198 transition count 1149
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 9604 place count 198 transition count 621
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 9654 place count 173 transition count 596
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 9666 place count 173 transition count 584
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 9678 place count 161 transition count 584
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 25 with 48 rules applied. Total rules applied 9726 place count 161 transition count 584
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9748 place count 139 transition count 430
Iterating global reduction 25 with 22 rules applied. Total rules applied 9770 place count 139 transition count 430
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 9792 place count 139 transition count 408
Applied a total of 9792 rules in 6588 ms. Remains 139 /4461 variables (removed 4322) and now considering 408/11046 (removed 10638) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 408 rows 139 cols
[2024-05-25 13:13:56] [INFO ] Computed 43 invariants in 12 ms
[2024-05-25 13:13:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:13:56] [INFO ] [Real]Absence check using 3 positive and 40 generalized place invariants in 6 ms returned sat
[2024-05-25 13:13:56] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:13:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 13:13:56] [INFO ] [Nat]Absence check using 3 positive and 40 generalized place invariants in 5 ms returned sat
[2024-05-25 13:13:56] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:13:56] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 13:13:56] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 502 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1938 reset in 1111 ms.
Product exploration explored 100000 steps with 1935 reset in 1164 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4799/4799 places, 8096/8096 transitions.
Applied a total of 0 rules in 459 ms. Remains 4799 /4799 variables (removed 0) and now considering 8096/8096 (removed 0) transitions.
[2024-05-25 13:14:01] [INFO ] Redundant transitions in 649 ms returned []
[2024-05-25 13:14:01] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
// Phase 1: matrix 7496 rows 4799 cols
[2024-05-25 13:14:01] [INFO ] Computed 1041 invariants in 169 ms
[2024-05-25 13:14:06] [INFO ] Dead Transitions using invariants and state equation in 5184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6306 ms. Remains : 4799/4799 places, 8096/8096 transitions.
Built C files in :
/tmp/ltsmin5612605791656929771
[2024-05-25 13:14:06] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5612605791656929771
Running compilation step : cd /tmp/ltsmin5612605791656929771;'/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/ltsmin5612605791656929771;'/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/ltsmin5612605791656929771;'/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 4799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4799/4799 places, 8096/8096 transitions.
Applied a total of 0 rules in 308 ms. Remains 4799 /4799 variables (removed 0) and now considering 8096/8096 (removed 0) transitions.
[2024-05-25 13:14:10] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:14:10] [INFO ] Invariant cache hit.
[2024-05-25 13:14:13] [INFO ] Implicit Places using invariants in 3617 ms returned []
[2024-05-25 13:14:13] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:14:13] [INFO ] Invariant cache hit.
[2024-05-25 13:14:17] [INFO ] Implicit Places using invariants and state equation in 3927 ms returned []
Implicit Place search using SMT with State Equation took 7548 ms to find 0 implicit places.
[2024-05-25 13:14:17] [INFO ] Flow matrix only has 7496 transitions (discarded 600 similar events)
[2024-05-25 13:14:17] [INFO ] Invariant cache hit.
[2024-05-25 13:14:22] [INFO ] Dead Transitions using invariants and state equation in 4677 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12536 ms. Remains : 4799/4799 places, 8096/8096 transitions.
Built C files in :
/tmp/ltsmin1056596333020182064
[2024-05-25 13:14:22] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1056596333020182064
Running compilation step : cd /tmp/ltsmin1056596333020182064;'/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/ltsmin1056596333020182064;'/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/ltsmin1056596333020182064;'/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-25 13:14:25] [INFO ] Flatten gal took : 246 ms
[2024-05-25 13:14:25] [INFO ] Flatten gal took : 207 ms
[2024-05-25 13:14:26] [INFO ] Time to serialize gal into /tmp/LTL14791699235662065227.gal : 34 ms
[2024-05-25 13:14:26] [INFO ] Time to serialize properties into /tmp/LTL12498103209526201187.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14791699235662065227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11870302499436610402.hoa' '-atoms' '/tmp/LTL12498103209526201187.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...320
Loading property file /tmp/LTL12498103209526201187.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11870302499436610402.hoa
Detected timeout of ITS tools.
[2024-05-25 13:14:41] [INFO ] Flatten gal took : 205 ms
[2024-05-25 13:14:41] [INFO ] Flatten gal took : 215 ms
[2024-05-25 13:14:41] [INFO ] Time to serialize gal into /tmp/LTL1997164032652136430.gal : 37 ms
[2024-05-25 13:14:41] [INFO ] Time to serialize properties into /tmp/LTL15963080069690719453.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/LTL1997164032652136430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15963080069690719453.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...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))"))))||(G("((Node15HasAskedItsLeafSetToLx...211
Formula 0 simplified : XXG!"((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))" & F!"((Node15HasAskedItsLeafSetToLx6ToRepla...199
Detected timeout of ITS tools.
[2024-05-25 13:14:56] [INFO ] Flatten gal took : 207 ms
[2024-05-25 13:14:56] [INFO ] Applying decomposition
[2024-05-25 13:14:57] [INFO ] Flatten gal took : 209 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/graph11795760102954562014.txt' '-o' '/tmp/graph11795760102954562014.bin' '-w' '/tmp/graph11795760102954562014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11795760102954562014.bin' '-l' '-1' '-v' '-w' '/tmp/graph11795760102954562014.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:14:57] [INFO ] Decomposing Gal with order
[2024-05-25 13:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:14:59] [INFO ] Removed a total of 6809 redundant transitions.
[2024-05-25 13:14:59] [INFO ] Flatten gal took : 1229 ms
[2024-05-25 13:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 5133 labels/synchronizations in 329 ms.
[2024-05-25 13:15:00] [INFO ] Time to serialize gal into /tmp/LTL7932364634875158515.gal : 452 ms
[2024-05-25 13:15:00] [INFO ] Time to serialize properties into /tmp/LTL7297483046108589047.ltl : 6 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/LTL7932364634875158515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7297483046108589047.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...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i24.u19.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i24.u30.LeafSetOfRx1IsSentToNode0>=1))"))))||(G("((i0.u4.Node15...241
Formula 0 simplified : XXG!"((i24.u19.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i24.u30.LeafSetOfRx1IsSentToNode0>=1))" & F!"((i0.u4.Node15HasAsked...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2924546324821195385
[2024-05-25 13:15:15] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2924546324821195385
Running compilation step : cd /tmp/ltsmin2924546324821195385;'/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/ltsmin2924546324821195385;'/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/ltsmin2924546324821195385;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10 finished in 231551 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((X((F(p2)&&p1))||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 5228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5228/5228 places, 8609/8609 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 5228 transition count 8603
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 5222 transition count 8603
Performed 364 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 364 Pre rules applied. Total rules applied 12 place count 5222 transition count 8239
Deduced a syphon composed of 364 places in 6 ms
Reduce places removed 364 places and 0 transitions.
Iterating global reduction 2 with 728 rules applied. Total rules applied 740 place count 4858 transition count 8239
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 749 place count 4849 transition count 8206
Iterating global reduction 2 with 9 rules applied. Total rules applied 758 place count 4849 transition count 8206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 758 place count 4849 transition count 8204
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 762 place count 4847 transition count 8204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 767 place count 4842 transition count 8169
Iterating global reduction 2 with 5 rules applied. Total rules applied 772 place count 4842 transition count 8169
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 832 place count 4812 transition count 8139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 838 place count 4806 transition count 8133
Iterating global reduction 2 with 6 rules applied. Total rules applied 844 place count 4806 transition count 8133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 844 place count 4806 transition count 8128
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 854 place count 4801 transition count 8128
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 860 place count 4795 transition count 8086
Iterating global reduction 2 with 6 rules applied. Total rules applied 866 place count 4795 transition count 8086
Applied a total of 866 rules in 2389 ms. Remains 4795 /5228 variables (removed 433) and now considering 8086/8609 (removed 523) transitions.
[2024-05-25 13:15:21] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
// Phase 1: matrix 7486 rows 4795 cols
[2024-05-25 13:15:21] [INFO ] Computed 1041 invariants in 183 ms
[2024-05-25 13:15:27] [INFO ] Implicit Places using invariants in 6301 ms returned []
[2024-05-25 13:15:27] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:27] [INFO ] Invariant cache hit.
[2024-05-25 13:15:31] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 10219 ms to find 0 implicit places.
[2024-05-25 13:15:31] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:31] [INFO ] Invariant cache hit.
[2024-05-25 13:15:35] [INFO ] Dead Transitions using invariants and state equation in 4723 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4795/5228 places, 8086/8609 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17333 ms. Remains : 4795/5228 places, 8086/8609 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1151 1) (LT s1991 1)), p1:(AND (GEQ s1151 1) (GEQ s1991 1)), p2:(AND (GEQ s2592 1) (GEQ s2621 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1934 reset in 1299 ms.
Product exploration explored 100000 steps with 1936 reset in 1327 ms.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Detected a total of 2196/4795 stabilizing places and 2910/8086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 2815 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:15:41] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:41] [INFO ] Invariant cache hit.
[2024-05-25 13:15:42] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 14 factoid took 3448 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 452 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 13:15:46] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:46] [INFO ] Invariant cache hit.
[2024-05-25 13:15:50] [INFO ] Implicit Places using invariants in 3913 ms returned []
[2024-05-25 13:15:50] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:50] [INFO ] Invariant cache hit.
[2024-05-25 13:15:54] [INFO ] Implicit Places using invariants and state equation in 3892 ms returned []
Implicit Place search using SMT with State Equation took 7806 ms to find 0 implicit places.
[2024-05-25 13:15:54] [INFO ] Redundant transitions in 610 ms returned []
[2024-05-25 13:15:54] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:15:54] [INFO ] Invariant cache hit.
[2024-05-25 13:15:59] [INFO ] Dead Transitions using invariants and state equation in 4691 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13572 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Computed a total of 2196 stabilizing places and 2910 stable transitions
Computed a total of 2196 stabilizing places and 2910 stable transitions
Detected a total of 2196/4795 stabilizing places and 2910/8086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 2325 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 13:16:02] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:16:02] [INFO ] Invariant cache hit.
[2024-05-25 13:16:02] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 15 factoid took 3979 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1935 reset in 1215 ms.
Product exploration explored 100000 steps with 1934 reset in 1255 ms.
Built C files in :
/tmp/ltsmin8666413812175303164
[2024-05-25 13:16:10] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:16:10] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8666413812175303164
Running compilation step : cd /tmp/ltsmin8666413812175303164;'/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/ltsmin8666413812175303164;'/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/ltsmin8666413812175303164;'/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 4795 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4795/4795 places, 8086/8086 transitions.
Applied a total of 0 rules in 443 ms. Remains 4795 /4795 variables (removed 0) and now considering 8086/8086 (removed 0) transitions.
[2024-05-25 13:16:13] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:16:13] [INFO ] Invariant cache hit.
[2024-05-25 13:16:17] [INFO ] Implicit Places using invariants in 3872 ms returned []
[2024-05-25 13:16:17] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:16:17] [INFO ] Invariant cache hit.
[2024-05-25 13:16:21] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 7706 ms to find 0 implicit places.
[2024-05-25 13:16:22] [INFO ] Redundant transitions in 608 ms returned []
[2024-05-25 13:16:22] [INFO ] Flow matrix only has 7486 transitions (discarded 600 similar events)
[2024-05-25 13:16:22] [INFO ] Invariant cache hit.
[2024-05-25 13:16:27] [INFO ] Dead Transitions using invariants and state equation in 5119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13882 ms. Remains : 4795/4795 places, 8086/8086 transitions.
Built C files in :
/tmp/ltsmin5818111530701974199
[2024-05-25 13:16:27] [INFO ] Too many transitions (8086) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:16:27] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5818111530701974199
Running compilation step : cd /tmp/ltsmin5818111530701974199;'/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/ltsmin5818111530701974199;'/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/ltsmin5818111530701974199;'/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-25 13:16:30] [INFO ] Flatten gal took : 227 ms
[2024-05-25 13:16:31] [INFO ] Flatten gal took : 266 ms
[2024-05-25 13:16:31] [INFO ] Time to serialize gal into /tmp/LTL2687836869722582407.gal : 36 ms
[2024-05-25 13:16:31] [INFO ] Time to serialize properties into /tmp/LTL2691023478275060674.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2687836869722582407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15806191290851025830.hoa' '-atoms' '/tmp/LTL2691023478275060674.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/LTL2691023478275060674.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15806191290851025830.hoa
Detected timeout of ITS tools.
[2024-05-25 13:16:46] [INFO ] Flatten gal took : 244 ms
[2024-05-25 13:16:46] [INFO ] Flatten gal took : 242 ms
[2024-05-25 13:16:47] [INFO ] Time to serialize gal into /tmp/LTL5225981173446690303.gal : 658 ms
[2024-05-25 13:16:47] [INFO ] Time to serialize properties into /tmp/LTL1803772842810703085.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5225981173446690303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1803772842810703085.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 : !((F(G(("((Node4IsActive<1)||(Node9DontAnswerToAnyNode<1))")||(X(("((Node4IsActive>=1)&&(Node9DontAnswerToAnyNode>=1))")&&(F("((Node16...240
Formula 0 simplified : GF(!"((Node4IsActive<1)||(Node9DontAnswerToAnyNode<1))" & X(!"((Node4IsActive>=1)&&(Node9DontAnswerToAnyNode>=1))" | G!"((Node16HasA...230
Detected timeout of ITS tools.
[2024-05-25 13:17:02] [INFO ] Flatten gal took : 213 ms
[2024-05-25 13:17:02] [INFO ] Applying decomposition
[2024-05-25 13:17:02] [INFO ] Flatten gal took : 219 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/graph2520064704133904213.txt' '-o' '/tmp/graph2520064704133904213.bin' '-w' '/tmp/graph2520064704133904213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2520064704133904213.bin' '-l' '-1' '-v' '-w' '/tmp/graph2520064704133904213.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:17:03] [INFO ] Decomposing Gal with order
[2024-05-25 13:17:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:17:04] [INFO ] Removed a total of 6860 redundant transitions.
[2024-05-25 13:17:05] [INFO ] Flatten gal took : 1183 ms
[2024-05-25 13:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 5145 labels/synchronizations in 327 ms.
[2024-05-25 13:17:05] [INFO ] Time to serialize gal into /tmp/LTL10795479236683421690.gal : 59 ms
[2024-05-25 13:17:05] [INFO ] Time to serialize properties into /tmp/LTL3781671671018281433.ltl : 4 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/LTL10795479236683421690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3781671671018281433.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 : !((F(G(("((i25.u1.Node4IsActive<1)||(i25.u1.Node9DontAnswerToAnyNode<1))")||(X(("((i25.u1.Node4IsActive>=1)&&(i25.u1.Node9DontAnswerTo...283
Formula 0 simplified : GF(!"((i25.u1.Node4IsActive<1)||(i25.u1.Node9DontAnswerToAnyNode<1))" & X(!"((i25.u1.Node4IsActive>=1)&&(i25.u1.Node9DontAnswerToAny...273
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin332878417979961909
[2024-05-25 13:17:20] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin332878417979961909
Running compilation step : cd /tmp/ltsmin332878417979961909;'/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/ltsmin332878417979961909;'/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/ltsmin332878417979961909;'/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 MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11 finished in 125457 ms.
[2024-05-25 13:17:24] [INFO ] Flatten gal took : 251 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11580471711624389197
[2024-05-25 13:17:24] [INFO ] Too many transitions (8609) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:17:24] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11580471711624389197
Running compilation step : cd /tmp/ltsmin11580471711624389197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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-25 13:17:24] [INFO ] Applying decomposition
[2024-05-25 13:17:24] [INFO ] Flatten gal took : 249 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/graph13214136664039440773.txt' '-o' '/tmp/graph13214136664039440773.bin' '-w' '/tmp/graph13214136664039440773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13214136664039440773.bin' '-l' '-1' '-v' '-w' '/tmp/graph13214136664039440773.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:17:25] [INFO ] Decomposing Gal with order
[2024-05-25 13:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:17:26] [INFO ] Removed a total of 6610 redundant transitions.
[2024-05-25 13:17:26] [INFO ] Flatten gal took : 761 ms
[2024-05-25 13:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 3392 labels/synchronizations in 263 ms.
[2024-05-25 13:17:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8812200958466399488.gal : 466 ms
[2024-05-25 13:17:27] [INFO ] Time to serialize properties into /tmp/LTLFireability17939464556566331869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8812200958466399488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17939464556566331869.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 5 LTL properties
Checking formula 0 : !((F(G("(((i17.u201.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i16.u207.Node7NotifyThatHeIsActive<1))&&((i1.u7.Node13HasAs...237
Formula 0 simplified : GF!"(((i17.u201.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i16.u207.Node7NotifyThatHeIsActive<1))&&((i1.u7.Node13HasAske...231
Compilation finished in 48839 ms.
Running link step : cd /tmp/ltsmin11580471711624389197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin11580471711624389197;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin11580471711624389197;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11580471711624389197;'/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' '(<>((LTLAPp1==true))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin11580471711624389197;'/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' '(<>((LTLAPp1==true))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11580471711624389197;'/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' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 745096 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15080028 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="MultiCrashLeafsetExtension-PT-S24C07"
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 MultiCrashLeafsetExtension-PT-S24C07, 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 r263-tall-171654372000063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C07.tgz
mv MultiCrashLeafsetExtension-PT-S24C07 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 ;