About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.972 | 3600000.00 | 9625594.00 | 125360.50 | ?FFFT?TT??F??FTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821200700.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200700
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.5M
-rw-r--r-- 1 mcc users 14K Apr 29 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.3M May 10 09:34 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-S16C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652836100993
Running Version 202205111006
[2022-05-18 01:08:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:08:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:08:22] [INFO ] Load time of PNML (sax parser for PT used): 466 ms
[2022-05-18 01:08:22] [INFO ] Transformed 6876 places.
[2022-05-18 01:08:22] [INFO ] Transformed 9571 transitions.
[2022-05-18 01:08:22] [INFO ] Parsed PT model containing 6876 places and 9571 transitions in 609 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 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2153 places :
Symmetric choice reduction at 1 with 2153 rule applications. Total rules 2189 place count 4687 transition count 7418
Iterating global reduction 1 with 2153 rules applied. Total rules applied 4342 place count 4687 transition count 7418
Discarding 1891 places :
Symmetric choice reduction at 1 with 1891 rule applications. Total rules 6233 place count 2796 transition count 5527
Iterating global reduction 1 with 1891 rules applied. Total rules applied 8124 place count 2796 transition count 5527
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 8343 place count 2577 transition count 3775
Iterating global reduction 1 with 219 rules applied. Total rules applied 8562 place count 2577 transition count 3775
Applied a total of 8562 rules in 1543 ms. Remains 2577 /6876 variables (removed 4299) and now considering 3775/9571 (removed 5796) transitions.
[2022-05-18 01:08:24] [INFO ] Flow matrix only has 3503 transitions (discarded 272 similar events)
// Phase 1: matrix 3503 rows 2577 cols
[2022-05-18 01:08:24] [INFO ] Computed 613 place invariants in 178 ms
[2022-05-18 01:08:30] [INFO ] Implicit Places using invariants in 5893 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 28, 33, 40, 49, 60, 73, 88, 104, 120, 124, 126, 128, 130, 132, 134, 136, 149, 160, 169, 176, 181, 184, 222, 229, 232, 233, 234, 235, 236, 237, 238, 240, 243, 248, 255, 266, 277, 290, 304, 318, 319, 320, 321, 322, 323, 324, 325, 326, 337, 346, 353, 358, 361, 363, 398, 405, 408, 409, 410, 411, 412, 413, 414, 415, 416, 418, 421, 426, 433, 442, 453, 465, 477, 478, 479, 480, 481, 482, 483, 484, 485, 494, 501, 506, 509, 511, 513, 548, 555, 558, 559, 560, 561, 562, 563, 564, 565, 566, 568, 570, 573, 578, 585, 594, 604, 614, 615, 616, 617, 618, 619, 620, 621, 622, 629, 634, 637, 639, 641, 643, 678, 685, 689, 690, 691, 692, 693, 694, 695, 696, 701, 703, 705, 708, 713, 720, 728, 736, 737, 738, 739, 740, 742, 743, 744, 749, 754, 756, 758, 760, 762, 797, 804, 807, 808, 809, 810, 811, 812, 813, 814, 815, 817, 819, 821, 823, 826, 831, 837, 843, 844, 845, 846, 847, 848, 849, 850, 851, 854, 856, 858, 860, 862, 864, 899, 906, 909, 910, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 930, 934, 938, 939, 941, 942, 943, 945, 946, 948, 950, 955, 957, 959, 963, 998, 1005, 1008, 1009, 1010, 1011, 1012, 1013, 1015, 1016, 1018, 1020, 1022, 1024, 1029, 1031, 1033, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1046, 1048, 1050, 1052, 1054, 1056, 1091, 1093, 1097, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1110, 1112, 1114, 1116, 1118, 1120, 1122, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1135, 1137, 1139, 1141, 1143, 1145, 1180, 1187, 1190, 1191, 1192, 1193, 1195, 1196, 1197, 1198, 1200, 1202, 1204, 1208, 1210, 1212, 1215, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1273, 1280, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1293, 1295, 1297, 1299, 1301, 1303, 1306, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1322, 1324, 1326, 1328, 1330, 1332, 1367, 1374, 1377, 1378, 1379, 1380, 1382, 1383, 1384, 1385, 1389, 1391, 1393, 1395, 1397, 1400, 1405, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1425, 1428, 1430, 1432, 1434, 1437, 1472, 1479, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1492, 1494, 1496, 1499, 1502, 1508, 1515, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1540, 1545, 1548, 1550, 1552, 1554, 1589, 1596, 1599, 1600, 1601, 1602, 1603, 1604, 1605, 1606, 1607, 1609, 1611, 1613, 1616, 1621, 1628, 1637, 1648, 1649, 1650, 1651, 1652, 1654, 1655, 1656, 1667, 1674, 1679, 1682, 1684, 1686, 1721, 1728, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1744, 1746, 1749, 1754, 1761, 1770, 1781, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1813, 1822, 1829, 1834, 1837, 1839, 1874, 1881, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1894, 1897, 1902, 1909, 1918, 1929, 1942, 1957, 1958, 1959, 1960, 1961, 1963, 1965, 1979, 1990, 2002, 2009, 2017, 2020, 2055, 2057, 2061, 2064, 2065, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2075, 2080, 2087, 2096, 2107, 2120, 2135, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2160, 2175, 2188, 2199, 2208, 2215, 2220, 2256]
Discarding 550 places :
Implicit Place search using SMT only with invariants took 5961 ms to find 550 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2027/6876 places, 3775/9571 transitions.
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 242 place count 1785 transition count 3533
Iterating global reduction 0 with 242 rules applied. Total rules applied 484 place count 1785 transition count 3533
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 726 place count 1543 transition count 3291
Iterating global reduction 0 with 242 rules applied. Total rules applied 968 place count 1543 transition count 3291
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 1210 place count 1301 transition count 3049
Iterating global reduction 0 with 242 rules applied. Total rules applied 1452 place count 1301 transition count 3049
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1472 place count 1281 transition count 2889
Iterating global reduction 0 with 20 rules applied. Total rules applied 1492 place count 1281 transition count 2889
Applied a total of 1492 rules in 231 ms. Remains 1281 /2027 variables (removed 746) and now considering 2889/3775 (removed 886) transitions.
[2022-05-18 01:08:30] [INFO ] Flow matrix only has 2617 transitions (discarded 272 similar events)
// Phase 1: matrix 2617 rows 1281 cols
[2022-05-18 01:08:30] [INFO ] Computed 63 place invariants in 57 ms
[2022-05-18 01:08:31] [INFO ] Implicit Places using invariants in 1070 ms returned [607]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1075 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1280/6876 places, 2889/9571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1279 transition count 2888
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1279 transition count 2888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1278 transition count 2887
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1278 transition count 2887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1277 transition count 2886
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1277 transition count 2886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1276 transition count 2878
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1276 transition count 2878
Applied a total of 8 rules in 187 ms. Remains 1276 /1280 variables (removed 4) and now considering 2878/2889 (removed 11) transitions.
[2022-05-18 01:08:32] [INFO ] Flow matrix only has 2606 transitions (discarded 272 similar events)
// Phase 1: matrix 2606 rows 1276 cols
[2022-05-18 01:08:32] [INFO ] Computed 62 place invariants in 58 ms
[2022-05-18 01:08:33] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2022-05-18 01:08:33] [INFO ] Flow matrix only has 2606 transitions (discarded 272 similar events)
// Phase 1: matrix 2606 rows 1276 cols
[2022-05-18 01:08:33] [INFO ] Computed 62 place invariants in 27 ms
[2022-05-18 01:08:34] [INFO ] State equation strengthened by 1042 read => feed constraints.
[2022-05-18 01:08:46] [INFO ] Implicit Places using invariants and state equation in 13373 ms returned []
Implicit Place search using SMT with State Equation took 14404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 1276/6876 places, 2878/9571 transitions.
Finished structural reductions, in 3 iterations. Remains : 1276/6876 places, 2878/9571 transitions.
Support contains 46 out of 1276 places after structural reductions.
[2022-05-18 01:08:48] [INFO ] Flatten gal took : 215 ms
[2022-05-18 01:08:48] [INFO ] Flatten gal took : 153 ms
[2022-05-18 01:08:48] [INFO ] Input system was already deterministic with 2878 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 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 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-05-18 01:08:49] [INFO ] Flow matrix only has 2606 transitions (discarded 272 similar events)
// Phase 1: matrix 2606 rows 1276 cols
[2022-05-18 01:08:49] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-18 01:08:49] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2022-05-18 01:08:49] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 15 ms returned sat
[2022-05-18 01:08:52] [INFO ] After 3077ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-05-18 01:08:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2022-05-18 01:08:53] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 17 ms returned sat
[2022-05-18 01:08:55] [INFO ] After 2145ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2022-05-18 01:08:55] [INFO ] State equation strengthened by 1042 read => feed constraints.
[2022-05-18 01:08:58] [INFO ] After 2559ms SMT Verify possible using 1042 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2022-05-18 01:08:59] [INFO ] Deduced a trap composed of 365 places in 598 ms of which 8 ms to minimize.
[2022-05-18 01:08:59] [INFO ] Deduced a trap composed of 494 places in 535 ms of which 2 ms to minimize.
[2022-05-18 01:09:00] [INFO ] Deduced a trap composed of 357 places in 488 ms of which 1 ms to minimize.
[2022-05-18 01:09:01] [INFO ] Deduced a trap composed of 351 places in 507 ms of which 2 ms to minimize.
[2022-05-18 01:09:01] [INFO ] Deduced a trap composed of 370 places in 565 ms of which 2 ms to minimize.
[2022-05-18 01:09:02] [INFO ] Deduced a trap composed of 378 places in 584 ms of which 2 ms to minimize.
[2022-05-18 01:09:03] [INFO ] Deduced a trap composed of 289 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:09:04] [INFO ] Deduced a trap composed of 384 places in 588 ms of which 2 ms to minimize.
[2022-05-18 01:09:04] [INFO ] Deduced a trap composed of 389 places in 602 ms of which 1 ms to minimize.
[2022-05-18 01:09:05] [INFO ] Deduced a trap composed of 330 places in 626 ms of which 2 ms to minimize.
[2022-05-18 01:09:06] [INFO ] Deduced a trap composed of 407 places in 615 ms of which 3 ms to minimize.
[2022-05-18 01:09:06] [INFO ] Deduced a trap composed of 272 places in 560 ms of which 1 ms to minimize.
[2022-05-18 01:09:07] [INFO ] Deduced a trap composed of 374 places in 620 ms of which 1 ms to minimize.
[2022-05-18 01:09:08] [INFO ] Deduced a trap composed of 387 places in 589 ms of which 1 ms to minimize.
[2022-05-18 01:09:08] [INFO ] Deduced a trap composed of 305 places in 546 ms of which 1 ms to minimize.
[2022-05-18 01:09:09] [INFO ] Deduced a trap composed of 364 places in 575 ms of which 1 ms to minimize.
[2022-05-18 01:09:10] [INFO ] Deduced a trap composed of 419 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:09:10] [INFO ] Deduced a trap composed of 288 places in 553 ms of which 1 ms to minimize.
[2022-05-18 01:09:11] [INFO ] Deduced a trap composed of 407 places in 536 ms of which 1 ms to minimize.
[2022-05-18 01:09:12] [INFO ] Deduced a trap composed of 393 places in 611 ms of which 2 ms to minimize.
[2022-05-18 01:09:12] [INFO ] Deduced a trap composed of 346 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:09:13] [INFO ] Deduced a trap composed of 345 places in 580 ms of which 2 ms to minimize.
[2022-05-18 01:09:14] [INFO ] Deduced a trap composed of 343 places in 541 ms of which 1 ms to minimize.
[2022-05-18 01:09:14] [INFO ] Deduced a trap composed of 327 places in 561 ms of which 3 ms to minimize.
[2022-05-18 01:09:15] [INFO ] Deduced a trap composed of 346 places in 583 ms of which 2 ms to minimize.
[2022-05-18 01:09:16] [INFO ] Deduced a trap composed of 358 places in 579 ms of which 1 ms to minimize.
[2022-05-18 01:09:16] [INFO ] Deduced a trap composed of 315 places in 527 ms of which 2 ms to minimize.
[2022-05-18 01:09:17] [INFO ] Deduced a trap composed of 376 places in 571 ms of which 2 ms to minimize.
[2022-05-18 01:09:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:09:17] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:14
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 24 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1276 transition count 2851
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1249 transition count 2851
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 54 place count 1249 transition count 2833
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 90 place count 1231 transition count 2833
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 1225 transition count 2792
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 1225 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1224 transition count 2784
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1224 transition count 2784
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 164 place count 1194 transition count 2754
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 1190 transition count 2750
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 1190 transition count 2750
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 176 place count 1186 transition count 2718
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 1186 transition count 2718
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 315 place count 1186 transition count 3731
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 450 place count 1051 transition count 3731
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 458 place count 1051 transition count 3731
Applied a total of 458 rules in 848 ms. Remains 1051 /1276 variables (removed 225) and now considering 3731/2878 (removed -853) transitions.
Finished structural reductions, in 1 iterations. Remains : 1051/1276 places, 3731/2878 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-18 01:09:19] [INFO ] Flow matrix only has 3347 transitions (discarded 384 similar events)
// Phase 1: matrix 3347 rows 1051 cols
[2022-05-18 01:09:19] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-18 01:09:20] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-18 01:09:20] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 13 ms returned sat
[2022-05-18 01:09:22] [INFO ] After 2450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-18 01:09:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-18 01:09:22] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 13 ms returned sat
[2022-05-18 01:09:24] [INFO ] After 1828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-18 01:09:24] [INFO ] State equation strengthened by 2120 read => feed constraints.
[2022-05-18 01:09:28] [INFO ] After 3600ms SMT Verify possible using 2120 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-18 01:09:29] [INFO ] Deduced a trap composed of 248 places in 477 ms of which 1 ms to minimize.
[2022-05-18 01:09:29] [INFO ] Deduced a trap composed of 112 places in 559 ms of which 1 ms to minimize.
[2022-05-18 01:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2022-05-18 01:09:30] [INFO ] Deduced a trap composed of 226 places in 507 ms of which 1 ms to minimize.
[2022-05-18 01:09:31] [INFO ] Deduced a trap composed of 227 places in 493 ms of which 1 ms to minimize.
[2022-05-18 01:09:31] [INFO ] Deduced a trap composed of 167 places in 499 ms of which 1 ms to minimize.
[2022-05-18 01:09:32] [INFO ] Deduced a trap composed of 336 places in 474 ms of which 1 ms to minimize.
[2022-05-18 01:09:33] [INFO ] Deduced a trap composed of 221 places in 463 ms of which 1 ms to minimize.
[2022-05-18 01:09:33] [INFO ] Deduced a trap composed of 249 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:09:34] [INFO ] Deduced a trap composed of 231 places in 493 ms of which 1 ms to minimize.
[2022-05-18 01:09:35] [INFO ] Deduced a trap composed of 173 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:09:35] [INFO ] Deduced a trap composed of 240 places in 480 ms of which 1 ms to minimize.
[2022-05-18 01:09:36] [INFO ] Deduced a trap composed of 239 places in 486 ms of which 1 ms to minimize.
[2022-05-18 01:09:37] [INFO ] Deduced a trap composed of 207 places in 437 ms of which 0 ms to minimize.
[2022-05-18 01:09:38] [INFO ] Deduced a trap composed of 202 places in 466 ms of which 1 ms to minimize.
[2022-05-18 01:09:38] [INFO ] Deduced a trap composed of 273 places in 438 ms of which 1 ms to minimize.
[2022-05-18 01:09:39] [INFO ] Deduced a trap composed of 220 places in 482 ms of which 1 ms to minimize.
[2022-05-18 01:09:39] [INFO ] Deduced a trap composed of 246 places in 472 ms of which 1 ms to minimize.
[2022-05-18 01:09:40] [INFO ] Deduced a trap composed of 225 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:09:41] [INFO ] Deduced a trap composed of 225 places in 447 ms of which 0 ms to minimize.
[2022-05-18 01:09:41] [INFO ] Deduced a trap composed of 255 places in 445 ms of which 0 ms to minimize.
[2022-05-18 01:09:42] [INFO ] Deduced a trap composed of 214 places in 462 ms of which 1 ms to minimize.
[2022-05-18 01:09:43] [INFO ] Deduced a trap composed of 212 places in 479 ms of which 1 ms to minimize.
[2022-05-18 01:09:44] [INFO ] Deduced a trap composed of 256 places in 480 ms of which 1 ms to minimize.
[2022-05-18 01:09:45] [INFO ] Deduced a trap composed of 206 places in 513 ms of which 1 ms to minimize.
[2022-05-18 01:09:46] [INFO ] Deduced a trap composed of 95 places in 576 ms of which 1 ms to minimize.
[2022-05-18 01:09:47] [INFO ] Deduced a trap composed of 163 places in 518 ms of which 1 ms to minimize.
[2022-05-18 01:09:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:09:47] [INFO ] After 25363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 18 out of 1051 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1051/1051 places, 3731/3731 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1051 transition count 3729
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1049 transition count 3729
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 1046 transition count 3719
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 1046 transition count 3719
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1046 transition count 3719
Applied a total of 12 rules in 260 ms. Remains 1046 /1051 variables (removed 5) and now considering 3719/3731 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 1046/1051 places, 3719/3731 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-18 01:09:48] [INFO ] Flow matrix only has 3335 transitions (discarded 384 similar events)
// Phase 1: matrix 3335 rows 1046 cols
[2022-05-18 01:09:49] [INFO ] Computed 62 place invariants in 27 ms
[2022-05-18 01:09:49] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:09:49] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 23 ms returned sat
[2022-05-18 01:09:49] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-18 01:09:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:09:49] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 6 ms returned sat
[2022-05-18 01:09:51] [INFO ] After 1583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-18 01:09:51] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2022-05-18 01:09:55] [INFO ] After 4265ms SMT Verify possible using 2113 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-18 01:09:57] [INFO ] Deduced a trap composed of 184 places in 502 ms of which 1 ms to minimize.
[2022-05-18 01:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2022-05-18 01:09:58] [INFO ] Deduced a trap composed of 167 places in 502 ms of which 1 ms to minimize.
[2022-05-18 01:09:58] [INFO ] Deduced a trap composed of 154 places in 517 ms of which 1 ms to minimize.
[2022-05-18 01:09:59] [INFO ] Deduced a trap composed of 209 places in 479 ms of which 1 ms to minimize.
[2022-05-18 01:10:00] [INFO ] Deduced a trap composed of 197 places in 486 ms of which 1 ms to minimize.
[2022-05-18 01:10:01] [INFO ] Deduced a trap composed of 148 places in 483 ms of which 1 ms to minimize.
[2022-05-18 01:10:01] [INFO ] Deduced a trap composed of 183 places in 482 ms of which 1 ms to minimize.
[2022-05-18 01:10:02] [INFO ] Deduced a trap composed of 217 places in 450 ms of which 1 ms to minimize.
[2022-05-18 01:10:03] [INFO ] Deduced a trap composed of 210 places in 459 ms of which 2 ms to minimize.
[2022-05-18 01:10:03] [INFO ] Deduced a trap composed of 218 places in 495 ms of which 1 ms to minimize.
[2022-05-18 01:10:04] [INFO ] Deduced a trap composed of 206 places in 475 ms of which 0 ms to minimize.
[2022-05-18 01:10:05] [INFO ] Deduced a trap composed of 281 places in 474 ms of which 2 ms to minimize.
[2022-05-18 01:10:05] [INFO ] Deduced a trap composed of 214 places in 502 ms of which 1 ms to minimize.
[2022-05-18 01:10:06] [INFO ] Deduced a trap composed of 199 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:10:07] [INFO ] Deduced a trap composed of 212 places in 494 ms of which 1 ms to minimize.
[2022-05-18 01:10:07] [INFO ] Deduced a trap composed of 230 places in 492 ms of which 1 ms to minimize.
[2022-05-18 01:10:08] [INFO ] Deduced a trap composed of 203 places in 506 ms of which 0 ms to minimize.
[2022-05-18 01:10:09] [INFO ] Deduced a trap composed of 189 places in 530 ms of which 1 ms to minimize.
[2022-05-18 01:10:09] [INFO ] Deduced a trap composed of 195 places in 504 ms of which 1 ms to minimize.
[2022-05-18 01:10:10] [INFO ] Deduced a trap composed of 242 places in 501 ms of which 1 ms to minimize.
[2022-05-18 01:10:11] [INFO ] Deduced a trap composed of 174 places in 533 ms of which 2 ms to minimize.
[2022-05-18 01:10:12] [INFO ] Deduced a trap composed of 178 places in 524 ms of which 1 ms to minimize.
[2022-05-18 01:10:12] [INFO ] Deduced a trap composed of 233 places in 491 ms of which 1 ms to minimize.
[2022-05-18 01:10:13] [INFO ] Deduced a trap composed of 228 places in 511 ms of which 1 ms to minimize.
[2022-05-18 01:10:14] [INFO ] Deduced a trap composed of 206 places in 492 ms of which 1 ms to minimize.
[2022-05-18 01:10:14] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 17086 ms
[2022-05-18 01:10:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:10:14] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 15 out of 1046 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1046/1046 places, 3719/3719 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1046 transition count 3718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1045 transition count 3718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1045 transition count 3717
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1044 transition count 3717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1043 transition count 3716
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1043 transition count 3716
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1043 transition count 3716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1042 transition count 3715
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1042 transition count 3715
Applied a total of 10 rules in 316 ms. Remains 1042 /1046 variables (removed 4) and now considering 3715/3719 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 1042/1046 places, 3715/3719 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 59358 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59358 steps, saw 25192 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
[2022-05-18 01:10:18] [INFO ] Flow matrix only has 3331 transitions (discarded 384 similar events)
// Phase 1: matrix 3331 rows 1042 cols
[2022-05-18 01:10:18] [INFO ] Computed 62 place invariants in 24 ms
[2022-05-18 01:10:19] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2022-05-18 01:10:19] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 12 ms returned sat
[2022-05-18 01:10:21] [INFO ] After 2295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-18 01:10:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-18 01:10:21] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 11 ms returned sat
[2022-05-18 01:10:23] [INFO ] After 1703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-18 01:10:23] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2022-05-18 01:10:26] [INFO ] After 3413ms SMT Verify possible using 2113 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-18 01:10:27] [INFO ] Deduced a trap composed of 88 places in 584 ms of which 1 ms to minimize.
[2022-05-18 01:10:28] [INFO ] Deduced a trap composed of 170 places in 503 ms of which 1 ms to minimize.
[2022-05-18 01:10:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1346 ms
[2022-05-18 01:10:30] [INFO ] Deduced a trap composed of 113 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:10:30] [INFO ] Deduced a trap composed of 387 places in 514 ms of which 1 ms to minimize.
[2022-05-18 01:10:31] [INFO ] Deduced a trap composed of 115 places in 578 ms of which 1 ms to minimize.
[2022-05-18 01:10:32] [INFO ] Deduced a trap composed of 93 places in 592 ms of which 1 ms to minimize.
[2022-05-18 01:10:32] [INFO ] Deduced a trap composed of 82 places in 576 ms of which 1 ms to minimize.
[2022-05-18 01:10:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3406 ms
[2022-05-18 01:10:33] [INFO ] Deduced a trap composed of 228 places in 445 ms of which 1 ms to minimize.
[2022-05-18 01:10:34] [INFO ] Deduced a trap composed of 236 places in 481 ms of which 1 ms to minimize.
[2022-05-18 01:10:35] [INFO ] Deduced a trap composed of 222 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:10:35] [INFO ] Deduced a trap composed of 203 places in 478 ms of which 1 ms to minimize.
[2022-05-18 01:10:36] [INFO ] Deduced a trap composed of 193 places in 518 ms of which 1 ms to minimize.
[2022-05-18 01:10:37] [INFO ] Deduced a trap composed of 171 places in 509 ms of which 1 ms to minimize.
[2022-05-18 01:10:37] [INFO ] Deduced a trap composed of 211 places in 457 ms of which 1 ms to minimize.
[2022-05-18 01:10:38] [INFO ] Deduced a trap composed of 189 places in 505 ms of which 1 ms to minimize.
[2022-05-18 01:10:39] [INFO ] Deduced a trap composed of 189 places in 488 ms of which 1 ms to minimize.
[2022-05-18 01:10:39] [INFO ] Deduced a trap composed of 272 places in 481 ms of which 1 ms to minimize.
[2022-05-18 01:10:40] [INFO ] Deduced a trap composed of 194 places in 504 ms of which 1 ms to minimize.
[2022-05-18 01:10:40] [INFO ] Deduced a trap composed of 222 places in 465 ms of which 0 ms to minimize.
[2022-05-18 01:10:41] [INFO ] Deduced a trap composed of 163 places in 502 ms of which 1 ms to minimize.
[2022-05-18 01:10:42] [INFO ] Deduced a trap composed of 213 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:10:42] [INFO ] Deduced a trap composed of 202 places in 525 ms of which 3 ms to minimize.
[2022-05-18 01:10:43] [INFO ] Deduced a trap composed of 182 places in 505 ms of which 2 ms to minimize.
[2022-05-18 01:10:44] [INFO ] Deduced a trap composed of 215 places in 458 ms of which 1 ms to minimize.
[2022-05-18 01:10:44] [INFO ] Deduced a trap composed of 155 places in 498 ms of which 1 ms to minimize.
[2022-05-18 01:10:45] [INFO ] Deduced a trap composed of 170 places in 489 ms of which 1 ms to minimize.
[2022-05-18 01:10:46] [INFO ] Deduced a trap composed of 181 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:10:46] [INFO ] Deduced a trap composed of 2 places in 632 ms of which 1 ms to minimize.
[2022-05-18 01:10:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:10:46] [INFO ] After 25661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 15 out of 1042 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1042/1042 places, 3715/3715 transitions.
Applied a total of 0 rules in 100 ms. Remains 1042 /1042 variables (removed 0) and now considering 3715/3715 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1042/1042 places, 3715/3715 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1042/1042 places, 3715/3715 transitions.
Applied a total of 0 rules in 111 ms. Remains 1042 /1042 variables (removed 0) and now considering 3715/3715 (removed 0) transitions.
[2022-05-18 01:10:47] [INFO ] Flow matrix only has 3331 transitions (discarded 384 similar events)
// Phase 1: matrix 3331 rows 1042 cols
[2022-05-18 01:10:47] [INFO ] Computed 62 place invariants in 29 ms
[2022-05-18 01:10:48] [INFO ] Implicit Places using invariants in 1027 ms returned [87, 374, 399, 458, 459, 521, 568, 698, 822]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1037 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1033/1042 places, 3715/3715 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1028 transition count 3710
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1028 transition count 3710
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1023 transition count 3705
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1023 transition count 3705
Applied a total of 20 rules in 176 ms. Remains 1023 /1033 variables (removed 10) and now considering 3705/3715 (removed 10) transitions.
[2022-05-18 01:10:48] [INFO ] Flow matrix only has 3321 transitions (discarded 384 similar events)
// Phase 1: matrix 3321 rows 1023 cols
[2022-05-18 01:10:48] [INFO ] Computed 53 place invariants in 20 ms
[2022-05-18 01:10:49] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2022-05-18 01:10:49] [INFO ] Flow matrix only has 3321 transitions (discarded 384 similar events)
// Phase 1: matrix 3321 rows 1023 cols
[2022-05-18 01:10:49] [INFO ] Computed 53 place invariants in 28 ms
[2022-05-18 01:10:50] [INFO ] State equation strengthened by 2113 read => feed constraints.
[2022-05-18 01:11:07] [INFO ] Implicit Places using invariants and state equation in 18512 ms returned []
Implicit Place search using SMT with State Equation took 19543 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1023/1042 places, 3705/3715 transitions.
Finished structural reductions, in 2 iterations. Remains : 1023/1042 places, 3705/3715 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 444 stabilizing places and 1245 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||p1)))))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1276/1276 places, 2878/2878 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 0 with 30 rules applied. Total rules applied 30 place count 1276 transition count 2848
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1246 transition count 2848
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 1246 transition count 2825
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 1223 transition count 2825
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 117 place count 1212 transition count 2779
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 1212 transition count 2779
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 128 place count 1212 transition count 2776
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 1209 transition count 2776
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 1203 transition count 2728
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 1203 transition count 2728
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 204 place count 1174 transition count 2699
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 211 place count 1167 transition count 2692
Iterating global reduction 2 with 7 rules applied. Total rules applied 218 place count 1167 transition count 2692
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1160 transition count 2636
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1160 transition count 2636
Applied a total of 232 rules in 479 ms. Remains 1160 /1276 variables (removed 116) and now considering 2636/2878 (removed 242) transitions.
[2022-05-18 01:11:08] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1160 cols
[2022-05-18 01:11:08] [INFO ] Computed 62 place invariants in 24 ms
[2022-05-18 01:11:09] [INFO ] Implicit Places using invariants in 954 ms returned [93, 161, 416, 446, 514, 515, 533, 578, 629, 745, 778, 919, 920]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 956 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1147/1276 places, 2636/2878 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1140 transition count 2629
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1140 transition count 2629
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1133 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1133 transition count 2622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1128 transition count 2582
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1128 transition count 2582
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1122 transition count 2576
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1116 transition count 2570
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1116 transition count 2570
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1110 transition count 2522
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1110 transition count 2522
Applied a total of 74 rules in 408 ms. Remains 1110 /1147 variables (removed 37) and now considering 2522/2636 (removed 114) transitions.
[2022-05-18 01:11:10] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:10] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:11:11] [INFO ] Implicit Places using invariants in 899 ms returned []
[2022-05-18 01:11:11] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:11] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 01:11:11] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:11:19] [INFO ] Implicit Places using invariants and state equation in 8440 ms returned []
Implicit Place search using SMT with State Equation took 9350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1276 places, 2522/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1110/1276 places, 2522/2878 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s630 1) (GEQ s1086 1))) (NOT (AND (GEQ s574 1) (GEQ s611 1)))), p0:(AND (GEQ s630 1) (GEQ s1086 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1718 reset in 659 ms.
Product exploration explored 100000 steps with 1720 reset in 625 ms.
Computed a total of 295 stabilizing places and 906 stable transitions
Computed a total of 295 stabilizing places and 906 stable transitions
Detected a total of 295/1110 stabilizing places and 906/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:11:21] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:21] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-18 01:11:21] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:11:21] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:11:22] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:11:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:11:22] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-18 01:11:23] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:11:23] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:11:23] [INFO ] After 194ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:11:24] [INFO ] Deduced a trap composed of 105 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:11:24] [INFO ] Deduced a trap composed of 243 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:11:25] [INFO ] Deduced a trap composed of 87 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:11:25] [INFO ] Deduced a trap composed of 295 places in 405 ms of which 1 ms to minimize.
[2022-05-18 01:11:26] [INFO ] Deduced a trap composed of 93 places in 446 ms of which 1 ms to minimize.
[2022-05-18 01:11:26] [INFO ] Deduced a trap composed of 343 places in 440 ms of which 1 ms to minimize.
[2022-05-18 01:11:27] [INFO ] Deduced a trap composed of 93 places in 468 ms of which 1 ms to minimize.
[2022-05-18 01:11:27] [INFO ] Deduced a trap composed of 318 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:11:28] [INFO ] Deduced a trap composed of 82 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:11:28] [INFO ] Deduced a trap composed of 94 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:11:29] [INFO ] Deduced a trap composed of 102 places in 445 ms of which 1 ms to minimize.
[2022-05-18 01:11:29] [INFO ] Deduced a trap composed of 95 places in 417 ms of which 1 ms to minimize.
[2022-05-18 01:11:30] [INFO ] Deduced a trap composed of 104 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:11:30] [INFO ] Deduced a trap composed of 80 places in 419 ms of which 1 ms to minimize.
[2022-05-18 01:11:31] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 2 ms to minimize.
[2022-05-18 01:11:31] [INFO ] Deduced a trap composed of 82 places in 457 ms of which 1 ms to minimize.
[2022-05-18 01:11:32] [INFO ] Deduced a trap composed of 333 places in 429 ms of which 1 ms to minimize.
[2022-05-18 01:11:32] [INFO ] Deduced a trap composed of 104 places in 457 ms of which 1 ms to minimize.
[2022-05-18 01:11:33] [INFO ] Deduced a trap composed of 90 places in 477 ms of which 1 ms to minimize.
[2022-05-18 01:11:33] [INFO ] Deduced a trap composed of 100 places in 477 ms of which 1 ms to minimize.
[2022-05-18 01:11:34] [INFO ] Deduced a trap composed of 67 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:11:34] [INFO ] Deduced a trap composed of 101 places in 467 ms of which 4 ms to minimize.
[2022-05-18 01:11:35] [INFO ] Deduced a trap composed of 67 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:11:35] [INFO ] Deduced a trap composed of 116 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:11:36] [INFO ] Deduced a trap composed of 67 places in 451 ms of which 1 ms to minimize.
[2022-05-18 01:11:37] [INFO ] Deduced a trap composed of 91 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:11:37] [INFO ] Deduced a trap composed of 88 places in 441 ms of which 1 ms to minimize.
[2022-05-18 01:11:38] [INFO ] Deduced a trap composed of 67 places in 457 ms of which 1 ms to minimize.
[2022-05-18 01:11:38] [INFO ] Deduced a trap composed of 116 places in 425 ms of which 1 ms to minimize.
[2022-05-18 01:11:39] [INFO ] Deduced a trap composed of 91 places in 435 ms of which 1 ms to minimize.
[2022-05-18 01:11:39] [INFO ] Deduced a trap composed of 277 places in 446 ms of which 1 ms to minimize.
[2022-05-18 01:11:40] [INFO ] Deduced a trap composed of 82 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:11:40] [INFO ] Deduced a trap composed of 318 places in 427 ms of which 1 ms to minimize.
[2022-05-18 01:11:41] [INFO ] Deduced a trap composed of 79 places in 453 ms of which 1 ms to minimize.
[2022-05-18 01:11:41] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 17770 ms
[2022-05-18 01:11:41] [INFO ] After 18034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-18 01:11:41] [INFO ] After 19027ms 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 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2522/2522 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1110 transition count 4275
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 980 transition count 4275
Applied a total of 260 rules in 290 ms. Remains 980 /1110 variables (removed 130) and now considering 4275/2522 (removed -1753) transitions.
Finished structural reductions, in 1 iterations. Remains : 980/1110 places, 4275/2522 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37694 steps, run visited all 1 properties in 1562 ms. (steps per millisecond=24 )
Probabilistic random walk after 37694 steps, saw 16025 distinct states, run finished after 1562 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1110/1110 places, 2522/2522 transitions.
Applied a total of 0 rules in 82 ms. Remains 1110 /1110 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2022-05-18 01:11:44] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:44] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 01:11:45] [INFO ] Implicit Places using invariants in 979 ms returned []
[2022-05-18 01:11:45] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:45] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 01:11:45] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:11:53] [INFO ] Implicit Places using invariants and state equation in 8299 ms returned []
Implicit Place search using SMT with State Equation took 9279 ms to find 0 implicit places.
[2022-05-18 01:11:53] [INFO ] Redundant transitions in 135 ms returned []
[2022-05-18 01:11:53] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:53] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 01:11:54] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2522/2522 transitions.
Computed a total of 295 stabilizing places and 906 stable transitions
Computed a total of 295 stabilizing places and 906 stable transitions
Detected a total of 295/1110 stabilizing places and 906/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:11:54] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:11:55] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:11:55] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:11:55] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:11:55] [INFO ] After 818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:11:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:11:55] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-18 01:11:56] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:11:56] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:11:56] [INFO ] After 191ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:11:57] [INFO ] Deduced a trap composed of 105 places in 434 ms of which 1 ms to minimize.
[2022-05-18 01:11:57] [INFO ] Deduced a trap composed of 243 places in 438 ms of which 1 ms to minimize.
[2022-05-18 01:11:58] [INFO ] Deduced a trap composed of 87 places in 450 ms of which 1 ms to minimize.
[2022-05-18 01:11:58] [INFO ] Deduced a trap composed of 295 places in 426 ms of which 1 ms to minimize.
[2022-05-18 01:11:59] [INFO ] Deduced a trap composed of 93 places in 441 ms of which 0 ms to minimize.
[2022-05-18 01:11:59] [INFO ] Deduced a trap composed of 343 places in 412 ms of which 1 ms to minimize.
[2022-05-18 01:12:00] [INFO ] Deduced a trap composed of 93 places in 419 ms of which 0 ms to minimize.
[2022-05-18 01:12:00] [INFO ] Deduced a trap composed of 318 places in 407 ms of which 1 ms to minimize.
[2022-05-18 01:12:01] [INFO ] Deduced a trap composed of 82 places in 443 ms of which 1 ms to minimize.
[2022-05-18 01:12:01] [INFO ] Deduced a trap composed of 94 places in 457 ms of which 1 ms to minimize.
[2022-05-18 01:12:02] [INFO ] Deduced a trap composed of 102 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:12:02] [INFO ] Deduced a trap composed of 95 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:12:03] [INFO ] Deduced a trap composed of 104 places in 447 ms of which 1 ms to minimize.
[2022-05-18 01:12:04] [INFO ] Deduced a trap composed of 80 places in 441 ms of which 1 ms to minimize.
[2022-05-18 01:12:04] [INFO ] Deduced a trap composed of 83 places in 461 ms of which 1 ms to minimize.
[2022-05-18 01:12:05] [INFO ] Deduced a trap composed of 82 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:12:05] [INFO ] Deduced a trap composed of 333 places in 433 ms of which 1 ms to minimize.
[2022-05-18 01:12:06] [INFO ] Deduced a trap composed of 104 places in 480 ms of which 1 ms to minimize.
[2022-05-18 01:12:06] [INFO ] Deduced a trap composed of 90 places in 483 ms of which 1 ms to minimize.
[2022-05-18 01:12:07] [INFO ] Deduced a trap composed of 100 places in 461 ms of which 1 ms to minimize.
[2022-05-18 01:12:07] [INFO ] Deduced a trap composed of 67 places in 471 ms of which 1 ms to minimize.
[2022-05-18 01:12:08] [INFO ] Deduced a trap composed of 101 places in 469 ms of which 1 ms to minimize.
[2022-05-18 01:12:08] [INFO ] Deduced a trap composed of 67 places in 445 ms of which 1 ms to minimize.
[2022-05-18 01:12:09] [INFO ] Deduced a trap composed of 116 places in 437 ms of which 1 ms to minimize.
[2022-05-18 01:12:09] [INFO ] Deduced a trap composed of 67 places in 462 ms of which 1 ms to minimize.
[2022-05-18 01:12:10] [INFO ] Deduced a trap composed of 91 places in 451 ms of which 1 ms to minimize.
[2022-05-18 01:12:11] [INFO ] Deduced a trap composed of 88 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:12:11] [INFO ] Deduced a trap composed of 67 places in 442 ms of which 1 ms to minimize.
[2022-05-18 01:12:12] [INFO ] Deduced a trap composed of 116 places in 439 ms of which 1 ms to minimize.
[2022-05-18 01:12:12] [INFO ] Deduced a trap composed of 91 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:12:13] [INFO ] Deduced a trap composed of 277 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:12:13] [INFO ] Deduced a trap composed of 82 places in 434 ms of which 1 ms to minimize.
[2022-05-18 01:12:14] [INFO ] Deduced a trap composed of 318 places in 418 ms of which 1 ms to minimize.
[2022-05-18 01:12:14] [INFO ] Deduced a trap composed of 79 places in 425 ms of which 1 ms to minimize.
[2022-05-18 01:12:14] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 17735 ms
[2022-05-18 01:12:14] [INFO ] After 17995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-18 01:12:14] [INFO ] After 18970ms 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 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2522/2522 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1110 transition count 4275
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 980 transition count 4275
Applied a total of 260 rules in 227 ms. Remains 980 /1110 variables (removed 130) and now considering 4275/2522 (removed -1753) transitions.
Finished structural reductions, in 1 iterations. Remains : 980/1110 places, 4275/2522 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37694 steps, run visited all 1 properties in 1581 ms. (steps per millisecond=23 )
Probabilistic random walk after 37694 steps, saw 16025 distinct states, run finished after 1581 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1718 reset in 526 ms.
Product exploration explored 100000 steps with 1718 reset in 538 ms.
Built C files in :
/tmp/ltsmin4779798117485564705
[2022-05-18 01:12:18] [INFO ] Too many transitions (2522) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:12:18] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4779798117485564705
Running compilation step : cd /tmp/ltsmin4779798117485564705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4779798117485564705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4779798117485564705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1110/1110 places, 2522/2522 transitions.
Applied a total of 0 rules in 94 ms. Remains 1110 /1110 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2022-05-18 01:12:21] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:12:21] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:12:22] [INFO ] Implicit Places using invariants in 918 ms returned []
[2022-05-18 01:12:22] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:12:22] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:12:23] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:12:31] [INFO ] Implicit Places using invariants and state equation in 8503 ms returned []
Implicit Place search using SMT with State Equation took 9423 ms to find 0 implicit places.
[2022-05-18 01:12:31] [INFO ] Redundant transitions in 134 ms returned []
[2022-05-18 01:12:31] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2022-05-18 01:12:31] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 01:12:32] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2522/2522 transitions.
Built C files in :
/tmp/ltsmin3400930465878776815
[2022-05-18 01:12:32] [INFO ] Too many transitions (2522) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:12:32] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3400930465878776815
Running compilation step : cd /tmp/ltsmin3400930465878776815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3400930465878776815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3400930465878776815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:12:35] [INFO ] Flatten gal took : 115 ms
[2022-05-18 01:12:35] [INFO ] Flatten gal took : 88 ms
[2022-05-18 01:12:35] [INFO ] Time to serialize gal into /tmp/LTL17037479312246547902.gal : 19 ms
[2022-05-18 01:12:36] [INFO ] Time to serialize properties into /tmp/LTL8830754108569123702.ltl : 221 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17037479312246547902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8830754108569123702.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1703747...267
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((Node11ManageTheCrashOfNode15>=1)&&(Rx0IsAtTheRightExtremityOfTheLeafSet>=1))"))U((G(!("((Node11ManageTheCrashOfNode15>=1)...392
Formula 0 simplified : !GF(!"((Node11ManageTheCrashOfNode15>=1)&&(Rx0IsAtTheRightExtremityOfTheLeafSet>=1))" U ("((!((Node11ManageTheCrashOfNode15>=1)&&(Rx...379
Detected timeout of ITS tools.
[2022-05-18 01:12:51] [INFO ] Flatten gal took : 80 ms
[2022-05-18 01:12:51] [INFO ] Applying decomposition
[2022-05-18 01:12:51] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16624332554988433132.txt' '-o' '/tmp/graph16624332554988433132.bin' '-w' '/tmp/graph16624332554988433132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16624332554988433132.bin' '-l' '-1' '-v' '-w' '/tmp/graph16624332554988433132.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:12:51] [INFO ] Decomposing Gal with order
[2022-05-18 01:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:12:52] [INFO ] Removed a total of 2268 redundant transitions.
[2022-05-18 01:12:52] [INFO ] Flatten gal took : 607 ms
[2022-05-18 01:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 944 labels/synchronizations in 125 ms.
[2022-05-18 01:12:52] [INFO ] Time to serialize gal into /tmp/LTL10822630493131064884.gal : 26 ms
[2022-05-18 01:12:52] [INFO ] Time to serialize properties into /tmp/LTL5863992521002327608.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10822630493131064884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5863992521002327608.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1082263...246
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i18.i0.i0.u92.Node11ManageTheCrashOfNode15>=1)&&(i18.i0.i0.u19.Rx0IsAtTheRightExtremityOfTheLeafSet>=1))"))U((G(!("((i18....492
Formula 0 simplified : !GF(!"((i18.i0.i0.u92.Node11ManageTheCrashOfNode15>=1)&&(i18.i0.i0.u19.Rx0IsAtTheRightExtremityOfTheLeafSet>=1))" U ("((!((i18.i0.i0...479
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3476012060969782013
[2022-05-18 01:13:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3476012060969782013
Running compilation step : cd /tmp/ltsmin3476012060969782013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3476012060969782013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3476012060969782013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 122575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F((F(p1)&&p2)))))'
Support contains 6 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1259 transition count 2819
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1259 transition count 2819
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 1248 transition count 2780
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 1248 transition count 2780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1241 transition count 2724
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1241 transition count 2724
Applied a total of 70 rules in 314 ms. Remains 1241 /1276 variables (removed 35) and now considering 2724/2878 (removed 154) transitions.
[2022-05-18 01:13:12] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1241 cols
[2022-05-18 01:13:12] [INFO ] Computed 62 place invariants in 29 ms
[2022-05-18 01:13:13] [INFO ] Implicit Places using invariants in 1108 ms returned [103, 195, 455, 485, 557, 558, 579, 803, 838, 981, 982]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1114 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1230/1276 places, 2724/2878 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1219 transition count 2713
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1219 transition count 2713
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1208 transition count 2702
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1208 transition count 2702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1197 transition count 2691
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1197 transition count 2691
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1188 transition count 2619
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1188 transition count 2619
Applied a total of 84 rules in 267 ms. Remains 1188 /1230 variables (removed 42) and now considering 2619/2724 (removed 105) transitions.
[2022-05-18 01:13:14] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1188 cols
[2022-05-18 01:13:14] [INFO ] Computed 51 place invariants in 22 ms
[2022-05-18 01:13:15] [INFO ] Implicit Places using invariants in 920 ms returned []
[2022-05-18 01:13:15] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1188 cols
[2022-05-18 01:13:15] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-18 01:13:15] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 01:13:23] [INFO ] Implicit Places using invariants and state equation in 7917 ms returned []
Implicit Place search using SMT with State Equation took 8838 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1188/1276 places, 2619/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1188/1276 places, 2619/2878 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s334 1) (LT s523 1)), p1:(AND (GEQ s606 1) (GEQ s619 1)), p0:(AND (GEQ s659 1) (GEQ s687 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 finished in 12663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U p1))||p2))))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1259 transition count 2819
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1259 transition count 2819
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 1248 transition count 2780
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 1248 transition count 2780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1241 transition count 2724
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1241 transition count 2724
Applied a total of 70 rules in 224 ms. Remains 1241 /1276 variables (removed 35) and now considering 2724/2878 (removed 154) transitions.
[2022-05-18 01:13:23] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1241 cols
[2022-05-18 01:13:23] [INFO ] Computed 62 place invariants in 28 ms
[2022-05-18 01:13:24] [INFO ] Implicit Places using invariants in 990 ms returned [103, 457, 487, 559, 560, 581, 629, 683, 838, 981, 982]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 993 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1230/1276 places, 2724/2878 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1219 transition count 2713
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1219 transition count 2713
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1208 transition count 2702
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1208 transition count 2702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1197 transition count 2691
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1197 transition count 2691
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1188 transition count 2619
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1188 transition count 2619
Applied a total of 84 rules in 272 ms. Remains 1188 /1230 variables (removed 42) and now considering 2619/2724 (removed 105) transitions.
[2022-05-18 01:13:24] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1188 cols
[2022-05-18 01:13:24] [INFO ] Computed 51 place invariants in 21 ms
[2022-05-18 01:13:25] [INFO ] Implicit Places using invariants in 966 ms returned []
[2022-05-18 01:13:25] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1188 cols
[2022-05-18 01:13:25] [INFO ] Computed 51 place invariants in 18 ms
[2022-05-18 01:13:26] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 01:13:36] [INFO ] Implicit Places using invariants and state equation in 10571 ms returned []
Implicit Place search using SMT with State Equation took 11538 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1188/1276 places, 2619/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1188/1276 places, 2619/2878 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s770 1) (GEQ s797 1)), p1:(AND (OR (AND (GEQ s770 1) (GEQ s797 1)) (AND (GEQ s216 1) (GEQ s297 1))) (GEQ s770 1) (GEQ s797 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]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 finished in 13170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(p0))||F(p1))) U p2))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1260 transition count 2827
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1260 transition count 2827
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 1249 transition count 2774
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 1249 transition count 2774
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1244 transition count 2734
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1244 transition count 2734
Applied a total of 64 rules in 259 ms. Remains 1244 /1276 variables (removed 32) and now considering 2734/2878 (removed 144) transitions.
[2022-05-18 01:13:36] [INFO ] Flow matrix only has 2462 transitions (discarded 272 similar events)
// Phase 1: matrix 2462 rows 1244 cols
[2022-05-18 01:13:36] [INFO ] Computed 62 place invariants in 27 ms
[2022-05-18 01:13:37] [INFO ] Implicit Places using invariants in 1018 ms returned [103, 195, 455, 485, 557, 558, 579, 627, 681, 799, 981]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1233/1276 places, 2734/2878 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1222 transition count 2723
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1222 transition count 2723
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1211 transition count 2712
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1211 transition count 2712
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1200 transition count 2701
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1200 transition count 2701
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1191 transition count 2629
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1191 transition count 2629
Applied a total of 84 rules in 284 ms. Remains 1191 /1233 variables (removed 42) and now considering 2629/2734 (removed 105) transitions.
[2022-05-18 01:13:38] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1191 cols
[2022-05-18 01:13:38] [INFO ] Computed 51 place invariants in 20 ms
[2022-05-18 01:13:39] [INFO ] Implicit Places using invariants in 941 ms returned []
[2022-05-18 01:13:39] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1191 cols
[2022-05-18 01:13:39] [INFO ] Computed 51 place invariants in 17 ms
[2022-05-18 01:13:39] [INFO ] State equation strengthened by 867 read => feed constraints.
[2022-05-18 01:13:46] [INFO ] Implicit Places using invariants and state equation in 7884 ms returned []
Implicit Place search using SMT with State Equation took 8840 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1191/1276 places, 2629/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1191/1276 places, 2629/2878 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s942 1) (GEQ s1164 1)), p1:(GEQ s975 1), p0:(GEQ s799 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 10563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(X(F(!p0)) U (X(p1)&&X(p2))))))'
Support contains 7 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1259 transition count 2826
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1259 transition count 2826
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 1247 transition count 2772
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1247 transition count 2772
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1241 transition count 2724
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1241 transition count 2724
Applied a total of 70 rules in 221 ms. Remains 1241 /1276 variables (removed 35) and now considering 2724/2878 (removed 154) transitions.
[2022-05-18 01:13:47] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1241 cols
[2022-05-18 01:13:47] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-18 01:13:48] [INFO ] Implicit Places using invariants in 1083 ms returned [103, 195, 455, 485, 557, 582, 630, 684, 803, 838, 981, 982]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1107 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1229/1276 places, 2724/2878 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1217 transition count 2712
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1217 transition count 2712
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1205 transition count 2700
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1205 transition count 2700
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1193 transition count 2688
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1193 transition count 2688
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1183 transition count 2608
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1183 transition count 2608
Applied a total of 92 rules in 278 ms. Remains 1183 /1229 variables (removed 46) and now considering 2608/2724 (removed 116) transitions.
[2022-05-18 01:13:48] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2022-05-18 01:13:48] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:13:49] [INFO ] Implicit Places using invariants in 940 ms returned []
[2022-05-18 01:13:49] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2022-05-18 01:13:49] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-18 01:13:50] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:13:57] [INFO ] Implicit Places using invariants and state equation in 7892 ms returned []
Implicit Place search using SMT with State Equation took 8863 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1276 places, 2608/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1183/1276 places, 2608/2878 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s524 1)), p1:(AND (GEQ s694 1) (GEQ s1135 1)), p2:(OR (GEQ s547 1) (AND (GEQ s292 1) (GEQ s521 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1206 reset in 499 ms.
Product exploration explored 100000 steps with 1205 reset in 587 ms.
Computed a total of 351 stabilizing places and 975 stable transitions
Computed a total of 351 stabilizing places and 975 stable transitions
Detected a total of 351/1183 stabilizing places and 975/2608 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 733 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 01:14:00] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2022-05-18 01:14:00] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 01:14:00] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:14:00] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 29 ms returned sat
[2022-05-18 01:14:00] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p2 p1)))
Knowledge based reduction with 14 factoid took 762 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 finished in 14201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(!(F(X(!p0)) U p1)))))'
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1258 transition count 2818
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1258 transition count 2818
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1246 transition count 2764
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1246 transition count 2764
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1240 transition count 2716
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1240 transition count 2716
Applied a total of 72 rules in 245 ms. Remains 1240 /1276 variables (removed 36) and now considering 2716/2878 (removed 162) transitions.
[2022-05-18 01:14:01] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1240 cols
[2022-05-18 01:14:01] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 01:14:02] [INFO ] Implicit Places using invariants in 1006 ms returned [103, 195, 455, 485, 557, 558, 630, 684, 802, 837, 980, 981]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1228/1276 places, 2716/2878 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1216 transition count 2704
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1216 transition count 2704
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1204 transition count 2692
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1204 transition count 2692
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1192 transition count 2680
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1192 transition count 2680
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1182 transition count 2600
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1182 transition count 2600
Applied a total of 92 rules in 257 ms. Remains 1182 /1228 variables (removed 46) and now considering 2600/2716 (removed 116) transitions.
[2022-05-18 01:14:02] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1182 cols
[2022-05-18 01:14:02] [INFO ] Computed 50 place invariants in 43 ms
[2022-05-18 01:14:03] [INFO ] Implicit Places using invariants in 967 ms returned []
[2022-05-18 01:14:03] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1182 cols
[2022-05-18 01:14:03] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-18 01:14:04] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:14:13] [INFO ] Implicit Places using invariants and state equation in 10167 ms returned [1163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1276 places, 2600/2878 transitions.
Applied a total of 0 rules in 48 ms. Remains 1181 /1181 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1181/1276 places, 2600/2878 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s651 1) (GEQ s1064 1)), p0:(LT s564 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1205 reset in 455 ms.
Product exploration explored 100000 steps with 1204 reset in 462 ms.
Computed a total of 349 stabilizing places and 967 stable transitions
Computed a total of 349 stabilizing places and 967 stable transitions
Detected a total of 349/1181 stabilizing places and 967/2600 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85351 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85351 steps, saw 36944 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:14:18] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:14:18] [INFO ] Computed 49 place invariants in 30 ms
[2022-05-18 01:14:18] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-18 01:14:18] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 18 ms returned sat
[2022-05-18 01:14:19] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:14:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-18 01:14:19] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 9 ms returned sat
[2022-05-18 01:14:20] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:20] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:14:20] [INFO ] After 229ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:21] [INFO ] Deduced a trap composed of 328 places in 488 ms of which 4 ms to minimize.
[2022-05-18 01:14:21] [INFO ] Deduced a trap composed of 375 places in 473 ms of which 1 ms to minimize.
[2022-05-18 01:14:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1171 ms
[2022-05-18 01:14:21] [INFO ] After 1453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-18 01:14:21] [INFO ] After 2466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1181/1181 places, 2600/2600 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 0 with 32 rules applied. Total rules applied 32 place count 1181 transition count 2568
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1149 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1149 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1133 transition count 2552
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 134 place count 1114 transition count 2533
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 267 place count 1114 transition count 4276
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 400 place count 981 transition count 4276
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 981 transition count 4276
Applied a total of 401 rules in 459 ms. Remains 981 /1181 variables (removed 200) and now considering 4276/2600 (removed -1676) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1181 places, 4276/2600 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70840 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70840 steps, saw 29847 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:14:25] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:14:25] [INFO ] Computed 49 place invariants in 56 ms
[2022-05-18 01:14:25] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:14:25] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:14:26] [INFO ] After 1123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:14:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2022-05-18 01:14:27] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-18 01:14:28] [INFO ] After 974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:28] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:14:28] [INFO ] After 511ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:28] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-18 01:14:28] [INFO ] After 2015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 115 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 121 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:14:29] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:14:29] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 01:14:30] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2022-05-18 01:14:30] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:14:30] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:14:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:14:51] [INFO ] Implicit Places using invariants and state equation in 21351 ms returned []
Implicit Place search using SMT with State Equation took 22575 ms to find 0 implicit places.
[2022-05-18 01:14:51] [INFO ] Redundant transitions in 238 ms returned []
[2022-05-18 01:14:51] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:14:51] [INFO ] Computed 49 place invariants in 36 ms
[2022-05-18 01:14:53] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1053 edges and 981 vertex of which 17 / 981 are part of one of the 1 SCC in 28 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4854 edges and 965 vertex of which 951 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 934 transition count 3507
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 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 1 with 290 rules applied. Total rules applied 391 place count 837 transition count 3314
Reduce places removed 96 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 2 with 264 rules applied. Total rules applied 655 place count 741 transition count 3146
Reduce places removed 72 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 3 with 214 rules applied. Total rules applied 869 place count 669 transition count 3004
Reduce places removed 70 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 4 with 190 rules applied. Total rules applied 1059 place count 599 transition count 2884
Reduce places removed 50 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 5 with 148 rules applied. Total rules applied 1207 place count 549 transition count 2786
Reduce places removed 48 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 6 with 128 rules applied. Total rules applied 1335 place count 501 transition count 2706
Reduce places removed 32 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 7 with 94 rules applied. Total rules applied 1429 place count 469 transition count 2644
Reduce places removed 30 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 8 with 78 rules applied. Total rules applied 1507 place count 439 transition count 2596
Reduce places removed 18 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 9 with 52 rules applied. Total rules applied 1559 place count 421 transition count 2562
Reduce places removed 16 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 10 with 40 rules applied. Total rules applied 1599 place count 405 transition count 2538
Reduce places removed 8 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 11 with 22 rules applied. Total rules applied 1621 place count 397 transition count 2524
Reduce places removed 6 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 12 with 14 rules applied. Total rules applied 1635 place count 391 transition count 2516
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 388 transition count 2514
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 388 transition count 2499
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 373 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1954 place count 89 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2238 place count 89 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 14 with 255 rules applied. Total rules applied 2493 place count 89 transition count 84
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2502 place count 80 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2502 place count 80 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 79 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2515 place count 68 transition count 68
Iterating global reduction 16 with 11 rules applied. Total rules applied 2526 place count 68 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2530 place count 64 transition count 64
Iterating global reduction 16 with 4 rules applied. Total rules applied 2534 place count 64 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2538 place count 62 transition count 62
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2539 place count 61 transition count 60
Iterating global reduction 16 with 1 rules applied. Total rules applied 2540 place count 61 transition count 60
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2555 place count 61 transition count 45
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2570 place count 46 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2571 place count 46 transition count 45
Applied a total of 2571 rules in 539 ms. Remains 46 /981 variables (removed 935) and now considering 45/4276 (removed 4231) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 46 cols
[2022-05-18 01:14:53] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 01:14:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 01:14:54] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:14:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:14:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 01:14:54] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:14:54] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:54] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:14:54] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:14:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15606443418689728354.gal : 1 ms
[2022-05-18 01:14:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9395754678161404348.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15532484312209120225;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15606443418689728354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9395754678161404348.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9395754678161404348.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 60
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :60 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 457
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :457 after 1058
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1058 after 1789
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2272,0.038484,4664,2,1217,11,3885,7,0,211,2774,0
Total reachable state count : 2272
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.038956,4928,2,352,11,3885,7,0,213,2774,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 277 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1181 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 2600/2600 transitions.
Applied a total of 0 rules in 47 ms. Remains 1181 /1181 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-18 01:14:54] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:14:54] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:14:55] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2022-05-18 01:14:55] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:14:55] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:14:56] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:15:05] [INFO ] Implicit Places using invariants and state equation in 9694 ms returned []
Implicit Place search using SMT with State Equation took 10726 ms to find 0 implicit places.
[2022-05-18 01:15:05] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:15:05] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:15:06] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1181 places, 2600/2600 transitions.
Computed a total of 349 stabilizing places and 967 stable transitions
Computed a total of 349 stabilizing places and 967 stable transitions
Detected a total of 349/1181 stabilizing places and 967/2600 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87000 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 87000 steps, saw 37650 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:15:09] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:15:09] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:15:10] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 01:15:10] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 01:15:10] [INFO ] After 1011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:15:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-05-18 01:15:11] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 10 ms returned sat
[2022-05-18 01:15:11] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:11] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:15:12] [INFO ] After 231ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:12] [INFO ] Deduced a trap composed of 328 places in 471 ms of which 2 ms to minimize.
[2022-05-18 01:15:13] [INFO ] Deduced a trap composed of 375 places in 478 ms of which 1 ms to minimize.
[2022-05-18 01:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1164 ms
[2022-05-18 01:15:13] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-18 01:15:13] [INFO ] After 2487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1181/1181 places, 2600/2600 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 0 with 32 rules applied. Total rules applied 32 place count 1181 transition count 2568
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1149 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1149 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1133 transition count 2552
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 134 place count 1114 transition count 2533
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 267 place count 1114 transition count 4276
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 400 place count 981 transition count 4276
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 981 transition count 4276
Applied a total of 401 rules in 444 ms. Remains 981 /1181 variables (removed 200) and now considering 4276/2600 (removed -1676) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1181 places, 4276/2600 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71955 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71955 steps, saw 30305 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:15:17] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:15:17] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-18 01:15:17] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:15:17] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:15:18] [INFO ] After 1178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:15:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:15:18] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:15:19] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:15:19] [INFO ] After 532ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:20] [INFO ] After 691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-18 01:15:20] [INFO ] After 1894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 114 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 142 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:15:20] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:15:20] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:15:21] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2022-05-18 01:15:21] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:15:21] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 01:15:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:15:41] [INFO ] Implicit Places using invariants and state equation in 19800 ms returned []
Implicit Place search using SMT with State Equation took 20924 ms to find 0 implicit places.
[2022-05-18 01:15:41] [INFO ] Redundant transitions in 191 ms returned []
[2022-05-18 01:15:41] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 981 cols
[2022-05-18 01:15:41] [INFO ] Computed 49 place invariants in 32 ms
[2022-05-18 01:15:43] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1053 edges and 981 vertex of which 17 / 981 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4854 edges and 965 vertex of which 951 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 934 transition count 3507
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 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 1 with 290 rules applied. Total rules applied 391 place count 837 transition count 3314
Reduce places removed 96 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 2 with 264 rules applied. Total rules applied 655 place count 741 transition count 3146
Reduce places removed 72 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 3 with 214 rules applied. Total rules applied 869 place count 669 transition count 3004
Reduce places removed 70 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 4 with 190 rules applied. Total rules applied 1059 place count 599 transition count 2884
Reduce places removed 50 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 5 with 148 rules applied. Total rules applied 1207 place count 549 transition count 2786
Reduce places removed 48 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 6 with 128 rules applied. Total rules applied 1335 place count 501 transition count 2706
Reduce places removed 32 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 7 with 94 rules applied. Total rules applied 1429 place count 469 transition count 2644
Reduce places removed 30 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 8 with 78 rules applied. Total rules applied 1507 place count 439 transition count 2596
Reduce places removed 18 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 9 with 52 rules applied. Total rules applied 1559 place count 421 transition count 2562
Reduce places removed 16 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 10 with 40 rules applied. Total rules applied 1599 place count 405 transition count 2538
Reduce places removed 8 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 11 with 22 rules applied. Total rules applied 1621 place count 397 transition count 2524
Reduce places removed 6 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 12 with 14 rules applied. Total rules applied 1635 place count 391 transition count 2516
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 388 transition count 2514
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 388 transition count 2499
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 373 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1954 place count 89 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2238 place count 89 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 14 with 255 rules applied. Total rules applied 2493 place count 89 transition count 84
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2502 place count 80 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2502 place count 80 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 79 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2515 place count 68 transition count 68
Iterating global reduction 16 with 11 rules applied. Total rules applied 2526 place count 68 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2530 place count 64 transition count 64
Iterating global reduction 16 with 4 rules applied. Total rules applied 2534 place count 64 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2538 place count 62 transition count 62
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2539 place count 61 transition count 60
Iterating global reduction 16 with 1 rules applied. Total rules applied 2540 place count 61 transition count 60
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2555 place count 61 transition count 45
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2570 place count 46 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2571 place count 46 transition count 45
Applied a total of 2571 rules in 364 ms. Remains 46 /981 variables (removed 935) and now considering 45/4276 (removed 4231) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 46 cols
[2022-05-18 01:15:43] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 01:15:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 01:15:43] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:15:43] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:15:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 01:15:43] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:15:43] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:43] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:15:43] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:15:43] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:15:43] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:15:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15592642017846051659.gal : 0 ms
[2022-05-18 01:15:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5201444007164048871.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6140682207639548572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15592642017846051659.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5201444007164048871.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5201444007164048871.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 60
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :60 after 139
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :139 after 457
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :457 after 1058
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1058 after 1789
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2272,0.031287,4864,2,1217,11,3885,7,0,211,2774,0
Total reachable state count : 2272
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.031658,4864,2,352,11,3885,7,0,213,2774,0
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1205 reset in 410 ms.
Product exploration explored 100000 steps with 1206 reset in 426 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 2600/2600 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1181 transition count 2600
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 32 place count 1181 transition count 2601
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 1181 transition count 2601
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 1165 transition count 2585
Deduced a syphon composed of 32 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 1165 transition count 2585
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 1165 transition count 2585
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 1163 transition count 2583
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 1163 transition count 2583
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 103 rules in 540 ms. Remains 1163 /1181 variables (removed 18) and now considering 2583/2600 (removed 17) transitions.
[2022-05-18 01:15:47] [INFO ] Redundant transitions in 137 ms returned []
[2022-05-18 01:15:47] [INFO ] Flow matrix only has 2311 transitions (discarded 272 similar events)
// Phase 1: matrix 2311 rows 1163 cols
[2022-05-18 01:15:47] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:15:48] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1163/1181 places, 2583/2600 transitions.
Finished structural reductions, in 1 iterations. Remains : 1163/1181 places, 2583/2600 transitions.
Product exploration explored 100000 steps with 1714 reset in 844 ms.
Product exploration explored 100000 steps with 1714 reset in 888 ms.
Built C files in :
/tmp/ltsmin10502706457007245304
[2022-05-18 01:15:50] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10502706457007245304
Running compilation step : cd /tmp/ltsmin10502706457007245304;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10502706457007245304;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10502706457007245304;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 1181 /1181 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-18 01:15:54] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:15:54] [INFO ] Computed 49 place invariants in 28 ms
[2022-05-18 01:15:55] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2022-05-18 01:15:55] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:15:55] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 01:15:55] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:16:04] [INFO ] Implicit Places using invariants and state equation in 9694 ms returned []
Implicit Place search using SMT with State Equation took 10762 ms to find 0 implicit places.
[2022-05-18 01:16:04] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1181 cols
[2022-05-18 01:16:04] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:16:05] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1181 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin6997600981965614014
[2022-05-18 01:16:05] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6997600981965614014
Running compilation step : cd /tmp/ltsmin6997600981965614014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6997600981965614014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6997600981965614014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:16:09] [INFO ] Flatten gal took : 193 ms
[2022-05-18 01:16:09] [INFO ] Flatten gal took : 140 ms
[2022-05-18 01:16:09] [INFO ] Time to serialize gal into /tmp/LTL3196553288773724702.gal : 45 ms
[2022-05-18 01:16:09] [INFO ] Time to serialize properties into /tmp/LTL11955737477660332770.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3196553288773724702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11955737477660332770.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3196553...267
Read 1 LTL properties
Checking formula 0 : !((X((G(X("(Node7HasTheLeafSetOfLx6ToReplaceNode5<1)")))&&(F(!((F(X("(Node7HasTheLeafSetOfLx6ToReplaceNode5>=1)")))U("((NodesCanDetect...245
Formula 0 simplified : !X(GX"(Node7HasTheLeafSetOfLx6ToReplaceNode5<1)" & F!(FX"(Node7HasTheLeafSetOfLx6ToReplaceNode5>=1)" U "((NodesCanDetectThatNode11Ha...228
Detected timeout of ITS tools.
[2022-05-18 01:16:24] [INFO ] Flatten gal took : 99 ms
[2022-05-18 01:16:24] [INFO ] Applying decomposition
[2022-05-18 01:16:24] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13307747915208943858.txt' '-o' '/tmp/graph13307747915208943858.bin' '-w' '/tmp/graph13307747915208943858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13307747915208943858.bin' '-l' '-1' '-v' '-w' '/tmp/graph13307747915208943858.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:16:24] [INFO ] Decomposing Gal with order
[2022-05-18 01:16:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:16:25] [INFO ] Removed a total of 3125 redundant transitions.
[2022-05-18 01:16:25] [INFO ] Flatten gal took : 241 ms
[2022-05-18 01:16:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1167 labels/synchronizations in 107 ms.
[2022-05-18 01:16:25] [INFO ] Time to serialize gal into /tmp/LTL4295998380461579845.gal : 38 ms
[2022-05-18 01:16:25] [INFO ] Time to serialize properties into /tmp/LTL11775674831770515678.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4295998380461579845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11775674831770515678.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4295998...246
Read 1 LTL properties
Checking formula 0 : !((X((G(X("(i16.u203.Node7HasTheLeafSetOfLx6ToReplaceNode5<1)")))&&(F(!((F(X("(i16.u203.Node7HasTheLeafSetOfLx6ToReplaceNode5>=1)")))U...276
Formula 0 simplified : !X(GX"(i16.u203.Node7HasTheLeafSetOfLx6ToReplaceNode5<1)" & F!(FX"(i16.u203.Node7HasTheLeafSetOfLx6ToReplaceNode5>=1)" U "((i12.u86....259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12964912147582282028
[2022-05-18 01:16:40] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12964912147582282028
Running compilation step : cd /tmp/ltsmin12964912147582282028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12964912147582282028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12964912147582282028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 finished in 162413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||(F(p1)&&p0))))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1258 transition count 2825
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1258 transition count 2825
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 1245 transition count 2770
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 1245 transition count 2770
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 1238 transition count 2714
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 1238 transition count 2714
Applied a total of 76 rules in 205 ms. Remains 1238 /1276 variables (removed 38) and now considering 2714/2878 (removed 164) transitions.
[2022-05-18 01:16:43] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1238 cols
[2022-05-18 01:16:43] [INFO ] Computed 62 place invariants in 30 ms
[2022-05-18 01:16:44] [INFO ] Implicit Places using invariants in 987 ms returned [103, 195, 455, 485, 557, 558, 579, 627, 681, 800, 835, 978, 979]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1225/1276 places, 2714/2878 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1212 transition count 2701
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1212 transition count 2701
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1199 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1199 transition count 2688
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1186 transition count 2675
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1186 transition count 2675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1175 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1175 transition count 2587
Applied a total of 100 rules in 247 ms. Remains 1175 /1225 variables (removed 50) and now considering 2587/2714 (removed 127) transitions.
[2022-05-18 01:16:45] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2022-05-18 01:16:45] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-18 01:16:46] [INFO ] Implicit Places using invariants in 984 ms returned []
[2022-05-18 01:16:46] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2022-05-18 01:16:46] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:16:47] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:16:55] [INFO ] Implicit Places using invariants and state equation in 9716 ms returned [1156]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10707 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1276 places, 2587/2878 transitions.
Applied a total of 0 rules in 39 ms. Remains 1174 /1174 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1174/1276 places, 2587/2878 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s690 1) (LT s1119 1)), p1:(AND (OR (LT s645 1) (LT s956 1)) (OR (LT s690 1) (LT s1119 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1205 reset in 446 ms.
Product exploration explored 100000 steps with 1204 reset in 458 ms.
Computed a total of 342 stabilizing places and 954 stable transitions
Computed a total of 342 stabilizing places and 954 stable transitions
Detected a total of 342/1174 stabilizing places and 954/2587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 577 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 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 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 01:16:58] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:16:58] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 01:16:58] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:16:58] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:16:59] [INFO ] After 1021ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 01:16:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:16:59] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 9 ms returned sat
[2022-05-18 01:17:00] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-18 01:17:00] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:17:00] [INFO ] After 338ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-18 01:17:00] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-18 01:17:00] [INFO ] After 1637ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 2587/2587 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 0 with 33 rules applied. Total rules applied 33 place count 1174 transition count 2554
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1141 transition count 2554
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 66 place count 1141 transition count 2538
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 98 place count 1125 transition count 2538
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 130 place count 1109 transition count 2522
Free-agglomeration rule (complex) applied 120 times.
Iterating global reduction 2 with 120 rules applied. Total rules applied 250 place count 1109 transition count 3340
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 370 place count 989 transition count 3340
Applied a total of 370 rules in 266 ms. Remains 989 /1174 variables (removed 185) and now considering 3340/2587 (removed -753) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1174 places, 3340/2587 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80608 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80608 steps, saw 33991 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:17:04] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:04] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 01:17:04] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 01:17:04] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:17:05] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:17:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-18 01:17:05] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:17:06] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:06] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:17:06] [INFO ] After 521ms SMT Verify possible using 1777 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:07] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-18 01:17:07] [INFO ] After 1767ms 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 989 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 81 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 102 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2022-05-18 01:17:07] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:07] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 01:17:08] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2022-05-18 01:17:08] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:08] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 01:17:09] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:17:22] [INFO ] Implicit Places using invariants and state equation in 14000 ms returned []
Implicit Place search using SMT with State Equation took 15070 ms to find 0 implicit places.
[2022-05-18 01:17:22] [INFO ] Redundant transitions in 131 ms returned []
[2022-05-18 01:17:22] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:22] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-18 01:17:23] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Graph (trivial) has 1050 edges and 989 vertex of which 16 / 989 are part of one of the 1 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 259 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 650 transitions.
Graph (complete) has 3929 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 943 transition count 2593
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 1 with 260 rules applied. Total rules applied 359 place count 848 transition count 2428
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 2 with 218 rules applied. Total rules applied 577 place count 766 transition count 2292
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 54 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 3 with 166 rules applied. Total rules applied 743 place count 707 transition count 2185
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 48 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 4 with 137 rules applied. Total rules applied 880 place count 654 transition count 2101
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 98 rules applied. Total rules applied 978 place count 618 transition count 2039
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 6 with 76 rules applied. Total rules applied 1054 place count 587 transition count 1994
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 47 rules applied. Total rules applied 1101 place count 568 transition count 1966
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 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 8 with 28 rules applied. Total rules applied 1129 place count 554 transition count 1952
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 9 with 14 rules applied. Total rules applied 1143 place count 549 transition count 1943
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1152 place count 540 transition count 1943
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 1152 place count 540 transition count 1935
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1168 place count 532 transition count 1935
Discarding 229 places :
Symmetric choice reduction at 11 with 229 rule applications. Total rules 1397 place count 303 transition count 937
Iterating global reduction 11 with 229 rules applied. Total rules applied 1626 place count 303 transition count 937
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 206 rules applied. Total rules applied 1832 place count 303 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1841 place count 294 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1841 place count 294 transition count 730
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1843 place count 293 transition count 730
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1852 place count 284 transition count 721
Iterating global reduction 13 with 9 rules applied. Total rules applied 1861 place count 284 transition count 721
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 13 with 312 rules applied. Total rules applied 2173 place count 128 transition count 565
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 13 with 152 rules applied. Total rules applied 2325 place count 128 transition count 413
Discarding 46 places :
Symmetric choice reduction at 14 with 46 rule applications. Total rules 2371 place count 82 transition count 167
Iterating global reduction 14 with 46 rules applied. Total rules applied 2417 place count 82 transition count 167
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 14 with 37 rules applied. Total rules applied 2454 place count 82 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2455 place count 81 transition count 126
Iterating global reduction 15 with 1 rules applied. Total rules applied 2456 place count 81 transition count 126
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 15 with 16 rules applied. Total rules applied 2472 place count 81 transition count 110
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 15 with 5 rules applied. Total rules applied 2477 place count 81 transition count 105
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 6 rules applied. Total rules applied 2483 place count 76 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2484 place count 75 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2484 place count 75 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2486 place count 74 transition count 103
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2495 place count 65 transition count 73
Iterating global reduction 18 with 9 rules applied. Total rules applied 2504 place count 65 transition count 73
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 18 with 15 rules applied. Total rules applied 2519 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2521 place count 63 transition count 56
Iterating global reduction 19 with 2 rules applied. Total rules applied 2523 place count 63 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 2525 place count 62 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2526 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2527 place count 61 transition count 61
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 20 with 16 rules applied. Total rules applied 2543 place count 61 transition count 61
Applied a total of 2543 rules in 543 ms. Remains 61 /989 variables (removed 928) and now considering 61/3340 (removed 3279) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 61 cols
[2022-05-18 01:17:24] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 01:17:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:17:24] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:17:24] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:17:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:17:24] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:17:24] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:24] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-18 01:17:24] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:24] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:17:24] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:17:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14870010623909302284.gal : 1 ms
[2022-05-18 01:17:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6176052229078085096.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5863871297443754107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14870010623909302284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6176052229078085096.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6176052229078085096.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 105
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105 after 358
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :358 after 809
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :809 after 2058
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8408,0.216833,11240,2,7853,14,27030,7,0,294,24254,0
Total reachable state count : 8408
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,162,0.225562,11240,2,1723,14,27030,7,0,300,24254,0
ITS tools runner thread asked to quit. Dying gracefully.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 14 factoid took 574 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 2587/2587 transitions.
Applied a total of 0 rules in 34 ms. Remains 1174 /1174 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
[2022-05-18 01:17:25] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:17:25] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-18 01:17:26] [INFO ] Implicit Places using invariants in 922 ms returned []
[2022-05-18 01:17:26] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:17:26] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-18 01:17:27] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:17:36] [INFO ] Implicit Places using invariants and state equation in 9352 ms returned []
Implicit Place search using SMT with State Equation took 10290 ms to find 0 implicit places.
[2022-05-18 01:17:36] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:17:36] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 01:17:37] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1174 places, 2587/2587 transitions.
Computed a total of 342 stabilizing places and 954 stable transitions
Computed a total of 342 stabilizing places and 954 stable transitions
Detected a total of 342/1174 stabilizing places and 954/2587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:17:37] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:17:37] [INFO ] Computed 48 place invariants in 39 ms
[2022-05-18 01:17:37] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 01:17:37] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:17:38] [INFO ] After 995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:17:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:17:38] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:17:39] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:39] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:17:40] [INFO ] After 338ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:40] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-18 01:17:40] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 2587/2587 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 0 with 33 rules applied. Total rules applied 33 place count 1174 transition count 2554
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1141 transition count 2554
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 66 place count 1141 transition count 2538
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 98 place count 1125 transition count 2538
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 130 place count 1109 transition count 2522
Free-agglomeration rule (complex) applied 120 times.
Iterating global reduction 2 with 120 rules applied. Total rules applied 250 place count 1109 transition count 3340
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 370 place count 989 transition count 3340
Applied a total of 370 rules in 278 ms. Remains 989 /1174 variables (removed 185) and now considering 3340/2587 (removed -753) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1174 places, 3340/2587 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81739 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81739 steps, saw 34464 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:17:43] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:43] [INFO ] Computed 48 place invariants in 20 ms
[2022-05-18 01:17:43] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 01:17:43] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:17:44] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:17:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 01:17:44] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:17:45] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:45] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:17:46] [INFO ] After 516ms SMT Verify possible using 1777 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:17:46] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-18 01:17:46] [INFO ] After 1830ms 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 989 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 80 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 79 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2022-05-18 01:17:46] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:46] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 01:17:47] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2022-05-18 01:17:47] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:17:47] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 01:17:48] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:18:02] [INFO ] Implicit Places using invariants and state equation in 14657 ms returned []
Implicit Place search using SMT with State Equation took 15693 ms to find 0 implicit places.
[2022-05-18 01:18:02] [INFO ] Redundant transitions in 133 ms returned []
[2022-05-18 01:18:02] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:18:02] [INFO ] Computed 48 place invariants in 29 ms
[2022-05-18 01:18:03] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Graph (trivial) has 1050 edges and 989 vertex of which 16 / 989 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 259 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 650 transitions.
Graph (complete) has 3929 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 943 transition count 2593
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 1 with 260 rules applied. Total rules applied 359 place count 848 transition count 2428
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 2 with 218 rules applied. Total rules applied 577 place count 766 transition count 2292
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 54 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 3 with 166 rules applied. Total rules applied 743 place count 707 transition count 2185
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 48 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 4 with 137 rules applied. Total rules applied 880 place count 654 transition count 2101
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 98 rules applied. Total rules applied 978 place count 618 transition count 2039
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 6 with 76 rules applied. Total rules applied 1054 place count 587 transition count 1994
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 47 rules applied. Total rules applied 1101 place count 568 transition count 1966
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 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 8 with 28 rules applied. Total rules applied 1129 place count 554 transition count 1952
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 9 with 14 rules applied. Total rules applied 1143 place count 549 transition count 1943
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1152 place count 540 transition count 1943
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 1152 place count 540 transition count 1935
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1168 place count 532 transition count 1935
Discarding 229 places :
Symmetric choice reduction at 11 with 229 rule applications. Total rules 1397 place count 303 transition count 937
Iterating global reduction 11 with 229 rules applied. Total rules applied 1626 place count 303 transition count 937
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 206 rules applied. Total rules applied 1832 place count 303 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1841 place count 294 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1841 place count 294 transition count 730
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1843 place count 293 transition count 730
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1852 place count 284 transition count 721
Iterating global reduction 13 with 9 rules applied. Total rules applied 1861 place count 284 transition count 721
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 13 with 312 rules applied. Total rules applied 2173 place count 128 transition count 565
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 13 with 152 rules applied. Total rules applied 2325 place count 128 transition count 413
Discarding 46 places :
Symmetric choice reduction at 14 with 46 rule applications. Total rules 2371 place count 82 transition count 167
Iterating global reduction 14 with 46 rules applied. Total rules applied 2417 place count 82 transition count 167
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 14 with 37 rules applied. Total rules applied 2454 place count 82 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2455 place count 81 transition count 126
Iterating global reduction 15 with 1 rules applied. Total rules applied 2456 place count 81 transition count 126
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 15 with 16 rules applied. Total rules applied 2472 place count 81 transition count 110
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 15 with 5 rules applied. Total rules applied 2477 place count 81 transition count 105
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 6 rules applied. Total rules applied 2483 place count 76 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2484 place count 75 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2484 place count 75 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2486 place count 74 transition count 103
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2495 place count 65 transition count 73
Iterating global reduction 18 with 9 rules applied. Total rules applied 2504 place count 65 transition count 73
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 18 with 15 rules applied. Total rules applied 2519 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2521 place count 63 transition count 56
Iterating global reduction 19 with 2 rules applied. Total rules applied 2523 place count 63 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 2525 place count 62 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2526 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2527 place count 61 transition count 61
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 20 with 16 rules applied. Total rules applied 2543 place count 61 transition count 61
Applied a total of 2543 rules in 539 ms. Remains 61 /989 variables (removed 928) and now considering 61/3340 (removed 3279) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 61 cols
[2022-05-18 01:18:04] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 01:18:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:18:04] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:18:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:18:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:18:04] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 01:18:04] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:18:04] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-18 01:18:04] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:18:04] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:18:04] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:18:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12465594931599893533.gal : 4 ms
[2022-05-18 01:18:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6690821934074000986.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3138513464848112142;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12465594931599893533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6690821934074000986.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6690821934074000986.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 105
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105 after 358
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :358 after 809
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :809 after 2058
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8408,0.208678,11240,2,7853,14,26958,7,0,294,24253,0
Total reachable state count : 8408
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.209966,11240,2,62,14,26958,7,0,298,24253,0
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1204 reset in 435 ms.
Product exploration explored 100000 steps with 1205 reset in 456 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1174/1174 places, 2587/2587 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1174 transition count 2587
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 33 place count 1174 transition count 2587
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 49 place count 1174 transition count 2587
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 1157 transition count 2570
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 1157 transition count 2570
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 99 place count 1157 transition count 2570
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 99 rules in 177 ms. Remains 1157 /1174 variables (removed 17) and now considering 2570/2587 (removed 17) transitions.
[2022-05-18 01:18:07] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-18 01:18:07] [INFO ] Flow matrix only has 2298 transitions (discarded 272 similar events)
// Phase 1: matrix 2298 rows 1157 cols
[2022-05-18 01:18:07] [INFO ] Computed 48 place invariants in 31 ms
[2022-05-18 01:18:08] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1174 places, 2570/2587 transitions.
Finished structural reductions, in 1 iterations. Remains : 1157/1174 places, 2570/2587 transitions.
Product exploration explored 100000 steps with 1206 reset in 498 ms.
Product exploration explored 100000 steps with 1208 reset in 524 ms.
Built C files in :
/tmp/ltsmin1181563595193995898
[2022-05-18 01:18:09] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1181563595193995898
Running compilation step : cd /tmp/ltsmin1181563595193995898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1181563595193995898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1181563595193995898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 2587/2587 transitions.
Applied a total of 0 rules in 50 ms. Remains 1174 /1174 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
[2022-05-18 01:18:12] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:18:12] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-18 01:18:14] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2022-05-18 01:18:14] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:18:14] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 01:18:15] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:18:23] [INFO ] Implicit Places using invariants and state equation in 9462 ms returned []
Implicit Place search using SMT with State Equation took 11131 ms to find 0 implicit places.
[2022-05-18 01:18:23] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1174 cols
[2022-05-18 01:18:23] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 01:18:24] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1174 places, 2587/2587 transitions.
Built C files in :
/tmp/ltsmin13992122951551613319
[2022-05-18 01:18:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13992122951551613319
Running compilation step : cd /tmp/ltsmin13992122951551613319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13992122951551613319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13992122951551613319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:18:27] [INFO ] Flatten gal took : 90 ms
[2022-05-18 01:18:27] [INFO ] Flatten gal took : 85 ms
[2022-05-18 01:18:27] [INFO ] Time to serialize gal into /tmp/LTL6689010191387395492.gal : 16 ms
[2022-05-18 01:18:27] [INFO ] Time to serialize properties into /tmp/LTL14376745706586880947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6689010191387395492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14376745706586880947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6689010...267
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))")))||((F("(((Node11IsTheNodeMaster<1)||(Node15Ha...345
Formula 0 simplified : !G(GX"((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))" | ("((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheL...333
Detected timeout of ITS tools.
[2022-05-18 01:18:43] [INFO ] Flatten gal took : 78 ms
[2022-05-18 01:18:43] [INFO ] Applying decomposition
[2022-05-18 01:18:43] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16175232799408092078.txt' '-o' '/tmp/graph16175232799408092078.bin' '-w' '/tmp/graph16175232799408092078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16175232799408092078.bin' '-l' '-1' '-v' '-w' '/tmp/graph16175232799408092078.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:18:43] [INFO ] Decomposing Gal with order
[2022-05-18 01:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:18:43] [INFO ] Removed a total of 3115 redundant transitions.
[2022-05-18 01:18:43] [INFO ] Flatten gal took : 186 ms
[2022-05-18 01:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1222 labels/synchronizations in 71 ms.
[2022-05-18 01:18:43] [INFO ] Time to serialize gal into /tmp/LTL16488080917402094721.gal : 20 ms
[2022-05-18 01:18:43] [INFO ] Time to serialize properties into /tmp/LTL1863777234738159945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16488080917402094721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1863777234738159945.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1648808...246
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i18.i1.i6.u184.Node12ManageTheCrashOfNode6<1)||(i18.i1.i6.u33.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))")))||((F("(((i0.u1....446
Formula 0 simplified : !G(GX"((i18.i1.i6.u184.Node12ManageTheCrashOfNode6<1)||(i18.i1.i6.u33.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))" | ("((i18.i1.i6.u184....434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6503346996642954244
[2022-05-18 01:18:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6503346996642954244
Running compilation step : cd /tmp/ltsmin6503346996642954244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6503346996642954244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6503346996642954244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 138147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1276 transition count 2849
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1247 transition count 2849
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 58 place count 1247 transition count 2826
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 104 place count 1224 transition count 2826
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 116 place count 1212 transition count 2772
Iterating global reduction 2 with 12 rules applied. Total rules applied 128 place count 1212 transition count 2772
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 128 place count 1212 transition count 2769
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 1209 transition count 2769
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 1203 transition count 2721
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 1203 transition count 2721
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 204 place count 1174 transition count 2692
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 1168 transition count 2686
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 1168 transition count 2686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 1162 transition count 2638
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 1162 transition count 2638
Applied a total of 228 rules in 339 ms. Remains 1162 /1276 variables (removed 114) and now considering 2638/2878 (removed 240) transitions.
[2022-05-18 01:19:02] [INFO ] Flow matrix only has 2366 transitions (discarded 272 similar events)
// Phase 1: matrix 2366 rows 1162 cols
[2022-05-18 01:19:02] [INFO ] Computed 62 place invariants in 39 ms
[2022-05-18 01:19:03] [INFO ] Implicit Places using invariants in 1002 ms returned [93, 161, 416, 446, 514, 515, 533, 578, 629, 744, 777, 918]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1150/1276 places, 2638/2878 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1143 transition count 2631
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1143 transition count 2631
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1136 transition count 2624
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1136 transition count 2624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1131 transition count 2584
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1131 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1126 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1121 transition count 2574
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1121 transition count 2574
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1116 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1116 transition count 2534
Applied a total of 68 rules in 340 ms. Remains 1116 /1150 variables (removed 34) and now considering 2534/2638 (removed 104) transitions.
[2022-05-18 01:19:03] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:19:03] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 01:19:04] [INFO ] Implicit Places using invariants in 891 ms returned []
[2022-05-18 01:19:04] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:19:04] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 01:19:05] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:19:13] [INFO ] Implicit Places using invariants and state equation in 8824 ms returned []
Implicit Place search using SMT with State Equation took 9716 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1276 places, 2534/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1116/1276 places, 2534/2878 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 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}]], initial=1, aps=[p0:(LT s929 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1714 reset in 533 ms.
Product exploration explored 100000 steps with 1714 reset in 557 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1116 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86489 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86489 steps, saw 36702 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:19:17] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:19:17] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:19:17] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:19:17] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:19:18] [INFO ] After 724ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:19:18] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:19:18] [INFO ] After 141ms SMT Verify possible using 846 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:19:18] [INFO ] After 1075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:19:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:19:18] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:19:19] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:19] [INFO ] After 154ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:20] [INFO ] Deduced a trap composed of 281 places in 429 ms of which 1 ms to minimize.
[2022-05-18 01:19:20] [INFO ] Deduced a trap composed of 264 places in 435 ms of which 1 ms to minimize.
[2022-05-18 01:19:21] [INFO ] Deduced a trap composed of 324 places in 444 ms of which 1 ms to minimize.
[2022-05-18 01:19:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1583 ms
[2022-05-18 01:19:21] [INFO ] After 1794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-18 01:19:21] [INFO ] After 2750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1116/1116 places, 2534/2534 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 983 transition count 4277
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 983 transition count 4277
Applied a total of 267 rules in 332 ms. Remains 983 /1116 variables (removed 133) and now considering 4277/2534 (removed -1743) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/1116 places, 4277/2534 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69375 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69375 steps, saw 29222 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:19:25] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:19:25] [INFO ] Computed 50 place invariants in 31 ms
[2022-05-18 01:19:25] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:19:25] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:19:26] [INFO ] After 952ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:19:26] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:19:26] [INFO ] After 339ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:19:26] [INFO ] After 1469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:19:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:19:26] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:19:27] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:28] [INFO ] After 442ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:28] [INFO ] Deduced a trap composed of 199 places in 474 ms of which 1 ms to minimize.
[2022-05-18 01:19:29] [INFO ] Deduced a trap composed of 153 places in 499 ms of which 1 ms to minimize.
[2022-05-18 01:19:30] [INFO ] Deduced a trap composed of 189 places in 470 ms of which 1 ms to minimize.
[2022-05-18 01:19:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2021 ms
[2022-05-18 01:19:30] [INFO ] After 2546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-18 01:19:30] [INFO ] After 3743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 115 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 134 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2022-05-18 01:19:30] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:19:30] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:19:31] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2022-05-18 01:19:31] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:19:31] [INFO ] Computed 50 place invariants in 31 ms
[2022-05-18 01:19:32] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:19:53] [INFO ] Implicit Places using invariants and state equation in 21868 ms returned []
Implicit Place search using SMT with State Equation took 23057 ms to find 0 implicit places.
[2022-05-18 01:19:53] [INFO ] Redundant transitions in 225 ms returned []
[2022-05-18 01:19:53] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:19:53] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-18 01:19:55] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 983/983 places, 4277/4277 transitions.
Graph (trivial) has 1054 edges and 983 vertex of which 17 / 983 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4854 edges and 967 vertex of which 953 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 936 transition count 3508
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 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 1 with 290 rules applied. Total rules applied 391 place count 839 transition count 3315
Reduce places removed 96 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 2 with 264 rules applied. Total rules applied 655 place count 743 transition count 3147
Reduce places removed 72 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 3 with 214 rules applied. Total rules applied 869 place count 671 transition count 3005
Reduce places removed 70 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 4 with 190 rules applied. Total rules applied 1059 place count 601 transition count 2885
Reduce places removed 50 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 5 with 148 rules applied. Total rules applied 1207 place count 551 transition count 2787
Reduce places removed 48 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 6 with 128 rules applied. Total rules applied 1335 place count 503 transition count 2707
Reduce places removed 32 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 7 with 94 rules applied. Total rules applied 1429 place count 471 transition count 2645
Reduce places removed 30 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 8 with 78 rules applied. Total rules applied 1507 place count 441 transition count 2597
Reduce places removed 18 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 9 with 52 rules applied. Total rules applied 1559 place count 423 transition count 2563
Reduce places removed 16 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 10 with 40 rules applied. Total rules applied 1599 place count 407 transition count 2539
Reduce places removed 8 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 11 with 22 rules applied. Total rules applied 1621 place count 399 transition count 2525
Reduce places removed 6 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 12 with 14 rules applied. Total rules applied 1635 place count 393 transition count 2517
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 390 transition count 2515
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 390 transition count 2499
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 374 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1956 place count 90 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2240 place count 90 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 14 with 255 rules applied. Total rules applied 2495 place count 90 transition count 84
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2504 place count 81 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2504 place count 81 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2506 place count 80 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2517 place count 69 transition count 68
Iterating global reduction 16 with 11 rules applied. Total rules applied 2528 place count 69 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2532 place count 65 transition count 64
Iterating global reduction 16 with 4 rules applied. Total rules applied 2536 place count 65 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2540 place count 63 transition count 62
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2541 place count 62 transition count 60
Iterating global reduction 16 with 1 rules applied. Total rules applied 2542 place count 62 transition count 60
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2557 place count 62 transition count 45
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2572 place count 47 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2573 place count 47 transition count 45
Applied a total of 2573 rules in 374 ms. Remains 47 /983 variables (removed 936) and now considering 45/4277 (removed 4232) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 47 cols
[2022-05-18 01:19:55] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 01:19:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 01:19:55] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:19:55] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:19:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 01:19:55] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:19:55] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:55] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:19:55] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:19:55] [INFO ] Flatten gal took : 4 ms
[2022-05-18 01:19:55] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1083814206904147688.gal : 0 ms
[2022-05-18 01:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13347363287285319746.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11336788349878185443;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1083814206904147688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13347363287285319746.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13347363287285319746.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 626
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2272,0.083774,6720,2,2958,12,8445,7,0,214,9524,0
Total reachable state count : 2272
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.084395,6720,2,925,12,8445,7,0,216,9524,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 1 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2534/2534 transitions.
Applied a total of 0 rules in 69 ms. Remains 1116 /1116 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2022-05-18 01:19:56] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:19:56] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 01:19:57] [INFO ] Implicit Places using invariants in 913 ms returned []
[2022-05-18 01:19:57] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:19:57] [INFO ] Computed 50 place invariants in 35 ms
[2022-05-18 01:19:57] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:20:06] [INFO ] Implicit Places using invariants and state equation in 9266 ms returned []
Implicit Place search using SMT with State Equation took 10192 ms to find 0 implicit places.
[2022-05-18 01:20:06] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-18 01:20:06] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:20:06] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 01:20:07] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1116/1116 places, 2534/2534 transitions.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1116 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87801 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87801 steps, saw 37250 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:20:10] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:20:11] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 01:20:11] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:20:11] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:20:11] [INFO ] After 717ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:20:11] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:20:12] [INFO ] After 142ms SMT Verify possible using 846 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:20:12] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:20:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 01:20:12] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:20:12] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:13] [INFO ] After 166ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:13] [INFO ] Deduced a trap composed of 281 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:20:14] [INFO ] Deduced a trap composed of 264 places in 438 ms of which 1 ms to minimize.
[2022-05-18 01:20:14] [INFO ] Deduced a trap composed of 324 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:20:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1608 ms
[2022-05-18 01:20:14] [INFO ] After 1837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-18 01:20:14] [INFO ] After 2845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1116/1116 places, 2534/2534 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 983 transition count 4277
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 983 transition count 4277
Applied a total of 267 rules in 320 ms. Remains 983 /1116 variables (removed 133) and now considering 4277/2534 (removed -1743) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/1116 places, 4277/2534 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70181 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70181 steps, saw 29567 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:20:18] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:20:18] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:20:18] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 01:20:18] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 01:20:19] [INFO ] After 920ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:20:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:20:19] [INFO ] After 333ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:20:19] [INFO ] After 1418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:20:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:20:20] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 01:20:20] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:21] [INFO ] After 437ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:21] [INFO ] Deduced a trap composed of 199 places in 472 ms of which 1 ms to minimize.
[2022-05-18 01:20:22] [INFO ] Deduced a trap composed of 153 places in 512 ms of which 1 ms to minimize.
[2022-05-18 01:20:23] [INFO ] Deduced a trap composed of 189 places in 501 ms of which 1 ms to minimize.
[2022-05-18 01:20:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2049 ms
[2022-05-18 01:20:23] [INFO ] After 2564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-18 01:20:23] [INFO ] After 3706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 116 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 131 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2022-05-18 01:20:23] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:20:23] [INFO ] Computed 50 place invariants in 32 ms
[2022-05-18 01:20:25] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2022-05-18 01:20:25] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:20:25] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 01:20:26] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:20:47] [INFO ] Implicit Places using invariants and state equation in 22875 ms returned []
Implicit Place search using SMT with State Equation took 24105 ms to find 0 implicit places.
[2022-05-18 01:20:48] [INFO ] Redundant transitions in 222 ms returned []
[2022-05-18 01:20:48] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2022-05-18 01:20:48] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-18 01:20:49] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 983/983 places, 4277/4277 transitions.
Graph (trivial) has 1054 edges and 983 vertex of which 17 / 983 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4854 edges and 967 vertex of which 953 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 936 transition count 3508
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 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 1 with 290 rules applied. Total rules applied 391 place count 839 transition count 3315
Reduce places removed 96 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 2 with 264 rules applied. Total rules applied 655 place count 743 transition count 3147
Reduce places removed 72 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 3 with 214 rules applied. Total rules applied 869 place count 671 transition count 3005
Reduce places removed 70 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 4 with 190 rules applied. Total rules applied 1059 place count 601 transition count 2885
Reduce places removed 50 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 5 with 148 rules applied. Total rules applied 1207 place count 551 transition count 2787
Reduce places removed 48 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 6 with 128 rules applied. Total rules applied 1335 place count 503 transition count 2707
Reduce places removed 32 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 7 with 94 rules applied. Total rules applied 1429 place count 471 transition count 2645
Reduce places removed 30 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 8 with 78 rules applied. Total rules applied 1507 place count 441 transition count 2597
Reduce places removed 18 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 9 with 52 rules applied. Total rules applied 1559 place count 423 transition count 2563
Reduce places removed 16 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 10 with 40 rules applied. Total rules applied 1599 place count 407 transition count 2539
Reduce places removed 8 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 11 with 22 rules applied. Total rules applied 1621 place count 399 transition count 2525
Reduce places removed 6 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 12 with 14 rules applied. Total rules applied 1635 place count 393 transition count 2517
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 390 transition count 2515
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 390 transition count 2499
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 374 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1956 place count 90 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2240 place count 90 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 14 with 255 rules applied. Total rules applied 2495 place count 90 transition count 84
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2504 place count 81 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2504 place count 81 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2506 place count 80 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2517 place count 69 transition count 68
Iterating global reduction 16 with 11 rules applied. Total rules applied 2528 place count 69 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2532 place count 65 transition count 64
Iterating global reduction 16 with 4 rules applied. Total rules applied 2536 place count 65 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2540 place count 63 transition count 62
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2541 place count 62 transition count 60
Iterating global reduction 16 with 1 rules applied. Total rules applied 2542 place count 62 transition count 60
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2557 place count 62 transition count 45
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2572 place count 47 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2573 place count 47 transition count 45
Applied a total of 2573 rules in 354 ms. Remains 47 /983 variables (removed 936) and now considering 45/4277 (removed 4232) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 47 cols
[2022-05-18 01:20:50] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 01:20:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 01:20:50] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:20:50] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:20:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 01:20:50] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:20:50] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:50] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:20:50] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:20:50] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:20:50] [INFO ] Flatten gal took : 5 ms
[2022-05-18 01:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2194341161645003376.gal : 1 ms
[2022-05-18 01:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16416405020990786141.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms24663837306841950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2194341161645003376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16416405020990786141.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16416405020990786141.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 626
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2272,0.086232,6716,2,2958,12,8445,7,0,214,9524,0
Total reachable state count : 2272
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.086869,6716,2,925,12,8445,7,0,216,9524,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1715 reset in 512 ms.
Product exploration explored 100000 steps with 1713 reset in 529 ms.
Built C files in :
/tmp/ltsmin12887725800026978239
[2022-05-18 01:20:51] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:20:51] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12887725800026978239
Running compilation step : cd /tmp/ltsmin12887725800026978239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12887725800026978239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12887725800026978239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2534/2534 transitions.
Applied a total of 0 rules in 72 ms. Remains 1116 /1116 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2022-05-18 01:20:54] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:20:54] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-18 01:20:55] [INFO ] Implicit Places using invariants in 883 ms returned []
[2022-05-18 01:20:55] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:20:55] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 01:20:56] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 01:21:03] [INFO ] Implicit Places using invariants and state equation in 8277 ms returned []
Implicit Place search using SMT with State Equation took 9160 ms to find 0 implicit places.
[2022-05-18 01:21:04] [INFO ] Redundant transitions in 76 ms returned []
[2022-05-18 01:21:04] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2022-05-18 01:21:04] [INFO ] Computed 50 place invariants in 31 ms
[2022-05-18 01:21:05] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1116/1116 places, 2534/2534 transitions.
Built C files in :
/tmp/ltsmin2468205953438245996
[2022-05-18 01:21:05] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:21:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2468205953438245996
Running compilation step : cd /tmp/ltsmin2468205953438245996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2468205953438245996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2468205953438245996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:21:08] [INFO ] Flatten gal took : 65 ms
[2022-05-18 01:21:08] [INFO ] Flatten gal took : 66 ms
[2022-05-18 01:21:08] [INFO ] Time to serialize gal into /tmp/LTL1281370637539716191.gal : 11 ms
[2022-05-18 01:21:08] [INFO ] Time to serialize properties into /tmp/LTL8682804227986379542.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1281370637539716191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8682804227986379542.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1281370...266
Read 1 LTL properties
Checking formula 0 : !((G("(Node15HasTheLeafSetOfRx7ToReplaceNode13<1)")))
Formula 0 simplified : !G"(Node15HasTheLeafSetOfRx7ToReplaceNode13<1)"
Detected timeout of ITS tools.
[2022-05-18 01:21:23] [INFO ] Flatten gal took : 67 ms
[2022-05-18 01:21:23] [INFO ] Applying decomposition
[2022-05-18 01:21:23] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16682506069735689116.txt' '-o' '/tmp/graph16682506069735689116.bin' '-w' '/tmp/graph16682506069735689116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16682506069735689116.bin' '-l' '-1' '-v' '-w' '/tmp/graph16682506069735689116.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:21:23] [INFO ] Decomposing Gal with order
[2022-05-18 01:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:21:23] [INFO ] Removed a total of 2270 redundant transitions.
[2022-05-18 01:21:24] [INFO ] Flatten gal took : 291 ms
[2022-05-18 01:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1321 labels/synchronizations in 54 ms.
[2022-05-18 01:21:24] [INFO ] Time to serialize gal into /tmp/LTL1798139665639842534.gal : 11 ms
[2022-05-18 01:21:24] [INFO ] Time to serialize properties into /tmp/LTL6673237271249193630.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1798139665639842534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6673237271249193630.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1798139...245
Read 1 LTL properties
Checking formula 0 : !((G("(i18.u173.Node15HasTheLeafSetOfRx7ToReplaceNode13<1)")))
Formula 0 simplified : !G"(i18.u173.Node15HasTheLeafSetOfRx7ToReplaceNode13<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10905569397110086833
[2022-05-18 01:21:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10905569397110086833
Running compilation step : cd /tmp/ltsmin10905569397110086833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10905569397110086833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10905569397110086833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 finished in 160357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1257 transition count 2817
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1257 transition count 2817
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 1244 transition count 2762
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 1244 transition count 2762
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 1237 transition count 2706
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 1237 transition count 2706
Applied a total of 78 rules in 145 ms. Remains 1237 /1276 variables (removed 39) and now considering 2706/2878 (removed 172) transitions.
[2022-05-18 01:21:42] [INFO ] Flow matrix only has 2434 transitions (discarded 272 similar events)
// Phase 1: matrix 2434 rows 1237 cols
[2022-05-18 01:21:42] [INFO ] Computed 62 place invariants in 34 ms
[2022-05-18 01:21:43] [INFO ] Implicit Places using invariants in 976 ms returned [103, 195, 455, 485, 557, 558, 579, 627, 681, 799, 834, 977, 978]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 993 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1224/1276 places, 2706/2878 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1211 transition count 2693
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1211 transition count 2693
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1198 transition count 2680
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1198 transition count 2680
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1185 transition count 2667
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1185 transition count 2667
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1174 transition count 2579
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1174 transition count 2579
Applied a total of 100 rules in 181 ms. Remains 1174 /1224 variables (removed 50) and now considering 2579/2706 (removed 127) transitions.
[2022-05-18 01:21:43] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:21:43] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:21:44] [INFO ] Implicit Places using invariants in 902 ms returned []
[2022-05-18 01:21:44] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:21:44] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 01:21:45] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:21:52] [INFO ] Implicit Places using invariants and state equation in 7577 ms returned []
Implicit Place search using SMT with State Equation took 8492 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1276 places, 2579/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1174/1276 places, 2579/2878 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 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 s186 1) (LT s189 1) (LT s596 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 1205 reset in 455 ms.
Product exploration explored 100000 steps with 1203 reset in 488 ms.
Computed a total of 342 stabilizing places and 946 stable transitions
Computed a total of 342 stabilizing places and 946 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 119 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86121 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86121 steps, saw 37192 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:21:56] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:21:56] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:21:56] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 01:21:56] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:21:57] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:21:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:21:57] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:21:58] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:21:58] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:21:58] [INFO ] After 465ms SMT Verify possible using 832 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:21:58] [INFO ] After 600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-18 01:21:58] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 2579/2579 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 0 with 32 rules applied. Total rules applied 32 place count 1174 transition count 2547
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1142 transition count 2547
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1142 transition count 2531
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1126 transition count 2531
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 18 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 1110 transition count 2515
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 2 with 129 rules applied. Total rules applied 257 place count 1110 transition count 4276
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 2 with 129 rules applied. Total rules applied 386 place count 981 transition count 4276
Applied a total of 386 rules in 296 ms. Remains 981 /1174 variables (removed 193) and now considering 4276/2579 (removed -1697) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1174 places, 4276/2579 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71083 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71083 steps, saw 29944 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:22:02] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:22:02] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:22:02] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:22:02] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:22:03] [INFO ] After 1316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:22:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:22:03] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:22:05] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:22:07] [INFO ] After 1863ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:07] [INFO ] After 2064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-05-18 01:22:07] [INFO ] After 3535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 132 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 120 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:22:07] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:22:07] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 01:22:08] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2022-05-18 01:22:08] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:22:08] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:22:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:22:32] [INFO ] Implicit Places using invariants and state equation in 24195 ms returned []
Implicit Place search using SMT with State Equation took 25373 ms to find 0 implicit places.
[2022-05-18 01:22:33] [INFO ] Redundant transitions in 223 ms returned []
[2022-05-18 01:22:33] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:22:33] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:22:34] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1018 edges and 981 vertex of which 16 / 981 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 275 transitions
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 642 transitions.
Graph (complete) has 4872 edges and 966 vertex of which 952 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 935 transition count 3559
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 192 rules applied. Total rules applied 269 place count 862 transition count 3440
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 159 rules applied. Total rules applied 428 place count 803 transition count 3340
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 121 rules applied. Total rules applied 549 place count 762 transition count 3260
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 103 rules applied. Total rules applied 652 place count 723 transition count 3196
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 73 rules applied. Total rules applied 725 place count 698 transition count 3148
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 59 rules applied. Total rules applied 784 place count 675 transition count 3112
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 37 rules applied. Total rules applied 821 place count 662 transition count 3088
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 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 8 with 27 rules applied. Total rules applied 848 place count 651 transition count 3072
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 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 9 with 13 rules applied. Total rules applied 861 place count 646 transition count 3064
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 7 rules applied. Total rules applied 868 place count 643 transition count 3060
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 872 place count 642 transition count 3057
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 874 place count 640 transition count 3057
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 874 place count 640 transition count 3041
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 906 place count 624 transition count 3041
Discarding 246 places :
Symmetric choice reduction at 13 with 246 rule applications. Total rules 1152 place count 378 transition count 1178
Iterating global reduction 13 with 246 rules applied. Total rules applied 1398 place count 378 transition count 1178
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 13 with 199 rules applied. Total rules applied 1597 place count 378 transition count 979
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 0 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 14 with 508 rules applied. Total rules applied 2105 place count 124 transition count 725
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 14 with 252 rules applied. Total rules applied 2357 place count 124 transition count 473
Discarding 31 places :
Symmetric choice reduction at 15 with 31 rule applications. Total rules 2388 place count 93 transition count 194
Iterating global reduction 15 with 31 rules applied. Total rules applied 2419 place count 93 transition count 194
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2426 place count 86 transition count 159
Iterating global reduction 15 with 7 rules applied. Total rules applied 2433 place count 86 transition count 159
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2440 place count 79 transition count 152
Iterating global reduction 15 with 7 rules applied. Total rules applied 2447 place count 79 transition count 152
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 15 with 17 rules applied. Total rules applied 2464 place count 79 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2464 place count 79 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2466 place count 78 transition count 134
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 2474 place count 70 transition count 70
Iterating global reduction 15 with 8 rules applied. Total rules applied 2482 place count 70 transition count 70
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 2494 place count 70 transition count 58
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 2497 place count 67 transition count 52
Iterating global reduction 16 with 3 rules applied. Total rules applied 2500 place count 67 transition count 52
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2502 place count 65 transition count 50
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 65 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2507 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 64 transition count 46
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2510 place count 63 transition count 45
Iterating global reduction 16 with 1 rules applied. Total rules applied 2511 place count 63 transition count 45
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 16 with 17 rules applied. Total rules applied 2528 place count 63 transition count 28
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 2545 place count 46 transition count 28
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2546 place count 45 transition count 27
Iterating global reduction 17 with 1 rules applied. Total rules applied 2547 place count 45 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2548 place count 45 transition count 27
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2549 place count 44 transition count 26
Iterating global reduction 17 with 1 rules applied. Total rules applied 2550 place count 44 transition count 26
Applied a total of 2550 rules in 651 ms. Remains 44 /981 variables (removed 937) and now considering 26/4276 (removed 4250) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 44 cols
[2022-05-18 01:22:35] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 01:22:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:22:35] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:22:35] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:22:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 01:22:35] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:22:35] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:35] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 01:22:35] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:35] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:22:35] [INFO ] Flatten gal took : 1 ms
[2022-05-18 01:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14262647473213956695.gal : 1 ms
[2022-05-18 01:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5337613360938796476.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3521797257022885758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14262647473213956695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5337613360938796476.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5337613360938796476.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.011953,3896,2,68,6,230,6,0,183,70,0
Total reachable state count : 8
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.012423,4336,2,45,6,230,7,0,188,70,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 2579/2579 transitions.
Applied a total of 0 rules in 40 ms. Remains 1174 /1174 variables (removed 0) and now considering 2579/2579 (removed 0) transitions.
[2022-05-18 01:22:35] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:22:35] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:22:36] [INFO ] Implicit Places using invariants in 945 ms returned []
[2022-05-18 01:22:36] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:22:36] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-18 01:22:37] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:22:44] [INFO ] Implicit Places using invariants and state equation in 7807 ms returned []
Implicit Place search using SMT with State Equation took 8754 ms to find 0 implicit places.
[2022-05-18 01:22:44] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:22:44] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1174 places, 2579/2579 transitions.
Computed a total of 342 stabilizing places and 946 stable transitions
Computed a total of 342 stabilizing places and 946 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1625 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86255 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86255 steps, saw 37248 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:22:50] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:22:50] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:22:50] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:22:50] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-18 01:22:51] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:22:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:22:51] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-18 01:22:52] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:52] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:22:52] [INFO ] After 467ms SMT Verify possible using 832 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:53] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-18 01:22:53] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 2579/2579 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 0 with 32 rules applied. Total rules applied 32 place count 1174 transition count 2547
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1142 transition count 2547
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1142 transition count 2531
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1126 transition count 2531
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 1110 transition count 2515
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 2 with 129 rules applied. Total rules applied 257 place count 1110 transition count 4276
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 2 with 129 rules applied. Total rules applied 386 place count 981 transition count 4276
Applied a total of 386 rules in 278 ms. Remains 981 /1174 variables (removed 193) and now considering 4276/2579 (removed -1697) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1174 places, 4276/2579 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70790 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70790 steps, saw 29827 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:22:56] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:22:56] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:22:56] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:22:56] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-18 01:22:58] [INFO ] After 1351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:22:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:22:58] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 8 ms returned sat
[2022-05-18 01:22:59] [INFO ] After 1148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:22:59] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:23:01] [INFO ] After 1864ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:23:01] [INFO ] After 2063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2022-05-18 01:23:01] [INFO ] After 3542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 111 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 121 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:23:01] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:23:01] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:23:02] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2022-05-18 01:23:02] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:23:02] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:23:03] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:23:24] [INFO ] Implicit Places using invariants and state equation in 22011 ms returned []
Implicit Place search using SMT with State Equation took 23157 ms to find 0 implicit places.
[2022-05-18 01:23:25] [INFO ] Redundant transitions in 220 ms returned []
[2022-05-18 01:23:25] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:23:25] [INFO ] Computed 49 place invariants in 41 ms
[2022-05-18 01:23:26] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1018 edges and 981 vertex of which 16 / 981 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 275 transitions
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 642 transitions.
Graph (complete) has 4872 edges and 966 vertex of which 952 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 935 transition count 3559
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 192 rules applied. Total rules applied 269 place count 862 transition count 3440
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 159 rules applied. Total rules applied 428 place count 803 transition count 3340
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 121 rules applied. Total rules applied 549 place count 762 transition count 3260
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 103 rules applied. Total rules applied 652 place count 723 transition count 3196
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 73 rules applied. Total rules applied 725 place count 698 transition count 3148
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 59 rules applied. Total rules applied 784 place count 675 transition count 3112
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 37 rules applied. Total rules applied 821 place count 662 transition count 3088
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 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 8 with 27 rules applied. Total rules applied 848 place count 651 transition count 3072
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 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 9 with 13 rules applied. Total rules applied 861 place count 646 transition count 3064
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 7 rules applied. Total rules applied 868 place count 643 transition count 3060
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 872 place count 642 transition count 3057
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 874 place count 640 transition count 3057
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 874 place count 640 transition count 3041
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 906 place count 624 transition count 3041
Discarding 246 places :
Symmetric choice reduction at 13 with 246 rule applications. Total rules 1152 place count 378 transition count 1178
Iterating global reduction 13 with 246 rules applied. Total rules applied 1398 place count 378 transition count 1178
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 13 with 199 rules applied. Total rules applied 1597 place count 378 transition count 979
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 0 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 14 with 508 rules applied. Total rules applied 2105 place count 124 transition count 725
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 14 with 252 rules applied. Total rules applied 2357 place count 124 transition count 473
Discarding 31 places :
Symmetric choice reduction at 15 with 31 rule applications. Total rules 2388 place count 93 transition count 194
Iterating global reduction 15 with 31 rules applied. Total rules applied 2419 place count 93 transition count 194
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2426 place count 86 transition count 159
Iterating global reduction 15 with 7 rules applied. Total rules applied 2433 place count 86 transition count 159
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2440 place count 79 transition count 152
Iterating global reduction 15 with 7 rules applied. Total rules applied 2447 place count 79 transition count 152
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 15 with 17 rules applied. Total rules applied 2464 place count 79 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2464 place count 79 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2466 place count 78 transition count 134
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 2474 place count 70 transition count 70
Iterating global reduction 15 with 8 rules applied. Total rules applied 2482 place count 70 transition count 70
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 2494 place count 70 transition count 58
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 2497 place count 67 transition count 52
Iterating global reduction 16 with 3 rules applied. Total rules applied 2500 place count 67 transition count 52
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2502 place count 65 transition count 50
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 65 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2507 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 64 transition count 46
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2510 place count 63 transition count 45
Iterating global reduction 16 with 1 rules applied. Total rules applied 2511 place count 63 transition count 45
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 16 with 17 rules applied. Total rules applied 2528 place count 63 transition count 28
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 2545 place count 46 transition count 28
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2546 place count 45 transition count 27
Iterating global reduction 17 with 1 rules applied. Total rules applied 2547 place count 45 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2548 place count 45 transition count 27
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2549 place count 44 transition count 26
Iterating global reduction 17 with 1 rules applied. Total rules applied 2550 place count 44 transition count 26
Applied a total of 2550 rules in 643 ms. Remains 44 /981 variables (removed 937) and now considering 26/4276 (removed 4250) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 44 cols
[2022-05-18 01:23:27] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 01:23:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:27] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:23:27] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:23:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:27] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:23:27] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:23:27] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:23:27] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:23:27] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:23:27] [INFO ] Flatten gal took : 1 ms
[2022-05-18 01:23:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5713155890868761276.gal : 0 ms
[2022-05-18 01:23:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10917479293069475493.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1403559712882949589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5713155890868761276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10917479293069475493.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10917479293069475493.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.007245,3900,2,68,6,230,6,0,183,70,0
Total reachable state count : 8
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.007762,4340,2,45,6,230,7,0,188,70,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1205 reset in 450 ms.
Product exploration explored 100000 steps with 1204 reset in 480 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1174/1174 places, 2579/2579 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1174 transition count 2579
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 32 place count 1174 transition count 2579
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 1174 transition count 2579
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 1158 transition count 2563
Deduced a syphon composed of 32 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 1158 transition count 2563
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 1158 transition count 2563
Deduced a syphon composed of 48 places in 2 ms
Applied a total of 96 rules in 191 ms. Remains 1158 /1174 variables (removed 16) and now considering 2563/2579 (removed 16) transitions.
[2022-05-18 01:23:29] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-18 01:23:29] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1158 cols
[2022-05-18 01:23:29] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:23:30] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1158/1174 places, 2563/2579 transitions.
Finished structural reductions, in 1 iterations. Remains : 1158/1174 places, 2563/2579 transitions.
Product exploration explored 100000 steps with 1712 reset in 813 ms.
Product exploration explored 100000 steps with 1714 reset in 836 ms.
Built C files in :
/tmp/ltsmin9596548190965204662
[2022-05-18 01:23:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9596548190965204662
Running compilation step : cd /tmp/ltsmin9596548190965204662;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9596548190965204662;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9596548190965204662;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 2579/2579 transitions.
Applied a total of 0 rules in 38 ms. Remains 1174 /1174 variables (removed 0) and now considering 2579/2579 (removed 0) transitions.
[2022-05-18 01:23:35] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:23:35] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-18 01:23:35] [INFO ] Implicit Places using invariants in 934 ms returned []
[2022-05-18 01:23:35] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:23:35] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:23:36] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:23:43] [INFO ] Implicit Places using invariants and state equation in 7165 ms returned []
Implicit Place search using SMT with State Equation took 8103 ms to find 0 implicit places.
[2022-05-18 01:23:43] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1174 cols
[2022-05-18 01:23:43] [INFO ] Computed 49 place invariants in 21 ms
[2022-05-18 01:23:44] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1174 places, 2579/2579 transitions.
Built C files in :
/tmp/ltsmin15954803484915795933
[2022-05-18 01:23:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15954803484915795933
Running compilation step : cd /tmp/ltsmin15954803484915795933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15954803484915795933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15954803484915795933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:23:47] [INFO ] Flatten gal took : 76 ms
[2022-05-18 01:23:47] [INFO ] Flatten gal took : 76 ms
[2022-05-18 01:23:47] [INFO ] Time to serialize gal into /tmp/LTL4244460684147678301.gal : 8 ms
[2022-05-18 01:23:47] [INFO ] Time to serialize properties into /tmp/LTL5294133551943373469.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4244460684147678301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5294133551943373469.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4244460...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((Node1IsActive<1)||(Node1IsTheNodeMaster<1))||(Node9AsksIsThereANodeMaster<1))")))))
Formula 0 simplified : !XXG"(((Node1IsActive<1)||(Node1IsTheNodeMaster<1))||(Node9AsksIsThereANodeMaster<1))"
Detected timeout of ITS tools.
[2022-05-18 01:24:02] [INFO ] Flatten gal took : 76 ms
[2022-05-18 01:24:02] [INFO ] Applying decomposition
[2022-05-18 01:24:02] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15268145589102883366.txt' '-o' '/tmp/graph15268145589102883366.bin' '-w' '/tmp/graph15268145589102883366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15268145589102883366.bin' '-l' '-1' '-v' '-w' '/tmp/graph15268145589102883366.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:24:02] [INFO ] Decomposing Gal with order
[2022-05-18 01:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:24:03] [INFO ] Removed a total of 1861 redundant transitions.
[2022-05-18 01:24:03] [INFO ] Flatten gal took : 169 ms
[2022-05-18 01:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1087 labels/synchronizations in 47 ms.
[2022-05-18 01:24:03] [INFO ] Time to serialize gal into /tmp/LTL15211751163058794415.gal : 14 ms
[2022-05-18 01:24:03] [INFO ] Time to serialize properties into /tmp/LTL1632346168133085322.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15211751163058794415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1632346168133085322.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1521175...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((i0.u0.Node1IsActive<1)||(i0.u0.Node1IsTheNodeMaster<1))||(i0.u0.Node9AsksIsThereANodeMaster<1))")))))
Formula 0 simplified : !XXG"(((i0.u0.Node1IsActive<1)||(i0.u0.Node1IsTheNodeMaster<1))||(i0.u0.Node9AsksIsThereANodeMaster<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13685624147472822103
[2022-05-18 01:24:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13685624147472822103
Running compilation step : cd /tmp/ltsmin13685624147472822103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13685624147472822103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13685624147472822103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 159042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(X(F(X((F(G(p0))&&F(p1))))))))))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1259 transition count 2826
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1259 transition count 2826
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 1247 transition count 2779
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1247 transition count 2779
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 1240 transition count 2723
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 1240 transition count 2723
Applied a total of 72 rules in 168 ms. Remains 1240 /1276 variables (removed 36) and now considering 2723/2878 (removed 155) transitions.
[2022-05-18 01:24:21] [INFO ] Flow matrix only has 2451 transitions (discarded 272 similar events)
// Phase 1: matrix 2451 rows 1240 cols
[2022-05-18 01:24:21] [INFO ] Computed 62 place invariants in 27 ms
[2022-05-18 01:24:22] [INFO ] Implicit Places using invariants in 988 ms returned [103, 195, 455, 485, 558, 581, 629, 683, 802, 837, 980, 981]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 990 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1228/1276 places, 2723/2878 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1216 transition count 2711
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1216 transition count 2711
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1204 transition count 2699
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1204 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1192 transition count 2687
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1192 transition count 2687
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1182 transition count 2607
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1182 transition count 2607
Applied a total of 92 rules in 197 ms. Remains 1182 /1228 variables (removed 46) and now considering 2607/2723 (removed 116) transitions.
[2022-05-18 01:24:22] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2022-05-18 01:24:22] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:24:23] [INFO ] Implicit Places using invariants in 957 ms returned []
[2022-05-18 01:24:23] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2022-05-18 01:24:23] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 01:24:24] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:24:34] [INFO ] Implicit Places using invariants and state equation in 10544 ms returned [1138]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11504 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1276 places, 2607/2878 transitions.
Applied a total of 0 rules in 34 ms. Remains 1181 /1181 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1181/1276 places, 2607/2878 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s549 1) (LT s552 1)), p0:(OR (LT s706 1) (LT s1152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1203 reset in 434 ms.
Product exploration explored 100000 steps with 1206 reset in 444 ms.
Computed a total of 349 stabilizing places and 974 stable transitions
Computed a total of 349 stabilizing places and 974 stable transitions
Detected a total of 349/1181 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 5631 steps, including 67 resets, run visited all 2 properties in 62 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 2607/2607 transitions.
Applied a total of 0 rules in 39 ms. Remains 1181 /1181 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2022-05-18 01:24:36] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:24:36] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 01:24:37] [INFO ] Implicit Places using invariants in 984 ms returned []
[2022-05-18 01:24:37] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:24:37] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-18 01:24:38] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:24:46] [INFO ] Implicit Places using invariants and state equation in 8888 ms returned []
Implicit Place search using SMT with State Equation took 9874 ms to find 0 implicit places.
[2022-05-18 01:24:46] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:24:46] [INFO ] Computed 49 place invariants in 30 ms
[2022-05-18 01:24:47] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1181 places, 2607/2607 transitions.
Computed a total of 349 stabilizing places and 974 stable transitions
Computed a total of 349 stabilizing places and 974 stable transitions
Detected a total of 349/1181 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:24:48] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:24:48] [INFO ] Computed 49 place invariants in 28 ms
[2022-05-18 01:24:48] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 01:24:48] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 01:24:49] [INFO ] After 716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:24:49] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:24:49] [INFO ] After 168ms SMT Verify possible using 853 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:24:49] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:24:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2022-05-18 01:24:49] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 10 ms returned sat
[2022-05-18 01:24:50] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:24:50] [INFO ] After 168ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:24:51] [INFO ] Deduced a trap composed of 104 places in 480 ms of which 2 ms to minimize.
[2022-05-18 01:24:51] [INFO ] Deduced a trap composed of 93 places in 487 ms of which 2 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 282 places in 489 ms of which 1 ms to minimize.
[2022-05-18 01:24:53] [INFO ] Deduced a trap composed of 241 places in 510 ms of which 1 ms to minimize.
[2022-05-18 01:24:53] [INFO ] Deduced a trap composed of 297 places in 478 ms of which 1 ms to minimize.
[2022-05-18 01:24:54] [INFO ] Deduced a trap composed of 285 places in 505 ms of which 1 ms to minimize.
[2022-05-18 01:24:55] [INFO ] Deduced a trap composed of 78 places in 501 ms of which 1 ms to minimize.
[2022-05-18 01:24:55] [INFO ] Deduced a trap composed of 94 places in 499 ms of which 1 ms to minimize.
[2022-05-18 01:24:56] [INFO ] Deduced a trap composed of 109 places in 488 ms of which 1 ms to minimize.
[2022-05-18 01:24:57] [INFO ] Deduced a trap composed of 124 places in 494 ms of which 1 ms to minimize.
[2022-05-18 01:24:57] [INFO ] Deduced a trap composed of 92 places in 489 ms of which 2 ms to minimize.
[2022-05-18 01:24:58] [INFO ] Deduced a trap composed of 129 places in 475 ms of which 1 ms to minimize.
[2022-05-18 01:24:59] [INFO ] Deduced a trap composed of 147 places in 485 ms of which 1 ms to minimize.
[2022-05-18 01:24:59] [INFO ] Deduced a trap composed of 148 places in 478 ms of which 1 ms to minimize.
[2022-05-18 01:25:00] [INFO ] Deduced a trap composed of 136 places in 490 ms of which 1 ms to minimize.
[2022-05-18 01:25:01] [INFO ] Deduced a trap composed of 100 places in 487 ms of which 2 ms to minimize.
[2022-05-18 01:25:01] [INFO ] Deduced a trap composed of 103 places in 538 ms of which 1 ms to minimize.
[2022-05-18 01:25:02] [INFO ] Deduced a trap composed of 134 places in 470 ms of which 1 ms to minimize.
[2022-05-18 01:25:02] [INFO ] Deduced a trap composed of 102 places in 461 ms of which 1 ms to minimize.
[2022-05-18 01:25:03] [INFO ] Deduced a trap composed of 100 places in 465 ms of which 1 ms to minimize.
[2022-05-18 01:25:04] [INFO ] Deduced a trap composed of 90 places in 500 ms of which 2 ms to minimize.
[2022-05-18 01:25:05] [INFO ] Deduced a trap composed of 109 places in 517 ms of which 1 ms to minimize.
[2022-05-18 01:25:06] [INFO ] Deduced a trap composed of 96 places in 513 ms of which 1 ms to minimize.
[2022-05-18 01:25:07] [INFO ] Deduced a trap composed of 111 places in 473 ms of which 1 ms to minimize.
[2022-05-18 01:25:07] [INFO ] Deduced a trap composed of 217 places in 519 ms of which 1 ms to minimize.
[2022-05-18 01:25:08] [INFO ] Deduced a trap composed of 101 places in 510 ms of which 1 ms to minimize.
[2022-05-18 01:25:09] [INFO ] Deduced a trap composed of 103 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:25:09] [INFO ] Deduced a trap composed of 107 places in 541 ms of which 1 ms to minimize.
[2022-05-18 01:25:10] [INFO ] Deduced a trap composed of 119 places in 489 ms of which 1 ms to minimize.
[2022-05-18 01:25:11] [INFO ] Deduced a trap composed of 100 places in 499 ms of which 1 ms to minimize.
[2022-05-18 01:25:12] [INFO ] Deduced a trap composed of 87 places in 469 ms of which 2 ms to minimize.
[2022-05-18 01:25:12] [INFO ] Deduced a trap composed of 106 places in 480 ms of which 1 ms to minimize.
[2022-05-18 01:25:13] [INFO ] Deduced a trap composed of 287 places in 515 ms of which 1 ms to minimize.
[2022-05-18 01:25:14] [INFO ] Deduced a trap composed of 102 places in 476 ms of which 1 ms to minimize.
[2022-05-18 01:25:14] [INFO ] Deduced a trap composed of 105 places in 449 ms of which 1 ms to minimize.
[2022-05-18 01:25:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:25:14] [INFO ] After 25233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1181/1181 places, 2607/2607 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 0 with 32 rules applied. Total rules applied 32 place count 1181 transition count 2575
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1149 transition count 2575
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1149 transition count 2559
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1133 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1132 transition count 2551
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1132 transition count 2551
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 134 place count 1114 transition count 2533
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 267 place count 1114 transition count 4276
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 400 place count 981 transition count 4276
Applied a total of 400 rules in 343 ms. Remains 981 /1181 variables (removed 200) and now considering 4276/2607 (removed -1669) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1181 places, 4276/2607 transitions.
Finished random walk after 7160 steps, including 149 resets, run visited all 1 properties in 132 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1205 reset in 432 ms.
Product exploration explored 100000 steps with 1205 reset in 440 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 2607/2607 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1181 transition count 2607
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 32 place count 1181 transition count 2607
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 1181 transition count 2607
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 1165 transition count 2591
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 1165 transition count 2591
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 98 place count 1165 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 1164 transition count 2590
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 1164 transition count 2590
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 100 rules in 226 ms. Remains 1164 /1181 variables (removed 17) and now considering 2590/2607 (removed 17) transitions.
[2022-05-18 01:25:17] [INFO ] Redundant transitions in 80 ms returned []
[2022-05-18 01:25:17] [INFO ] Flow matrix only has 2318 transitions (discarded 272 similar events)
// Phase 1: matrix 2318 rows 1164 cols
[2022-05-18 01:25:17] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-18 01:25:18] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1164/1181 places, 2590/2607 transitions.
Finished structural reductions, in 1 iterations. Remains : 1164/1181 places, 2590/2607 transitions.
Product exploration explored 100000 steps with 1706 reset in 769 ms.
Product exploration explored 100000 steps with 1707 reset in 791 ms.
Built C files in :
/tmp/ltsmin15020254566274689635
[2022-05-18 01:25:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15020254566274689635
Running compilation step : cd /tmp/ltsmin15020254566274689635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15020254566274689635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15020254566274689635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 2607/2607 transitions.
Applied a total of 0 rules in 54 ms. Remains 1181 /1181 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2022-05-18 01:25:23] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:25:23] [INFO ] Computed 49 place invariants in 33 ms
[2022-05-18 01:25:24] [INFO ] Implicit Places using invariants in 961 ms returned []
[2022-05-18 01:25:24] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:25:24] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 01:25:25] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:25:32] [INFO ] Implicit Places using invariants and state equation in 8354 ms returned []
Implicit Place search using SMT with State Equation took 9316 ms to find 0 implicit places.
[2022-05-18 01:25:32] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1181 cols
[2022-05-18 01:25:32] [INFO ] Computed 49 place invariants in 28 ms
[2022-05-18 01:25:33] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1181 places, 2607/2607 transitions.
Built C files in :
/tmp/ltsmin5954324628330750726
[2022-05-18 01:25:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5954324628330750726
Running compilation step : cd /tmp/ltsmin5954324628330750726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5954324628330750726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5954324628330750726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:25:37] [INFO ] Flatten gal took : 70 ms
[2022-05-18 01:25:37] [INFO ] Flatten gal took : 70 ms
[2022-05-18 01:25:37] [INFO ] Time to serialize gal into /tmp/LTL10537031428322964475.gal : 7 ms
[2022-05-18 01:25:37] [INFO ] Time to serialize properties into /tmp/LTL6531410381757783846.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10537031428322964475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6531410381757783846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1053703...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(X(F(X((F(G("((Node12ManageTheCrashOfNode8<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))")))&&(F("((Node6HasAskedItsLeafSetT...221
Formula 0 simplified : !XXFXXFX(FG"((Node12ManageTheCrashOfNode8<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))" & F"((Node6HasAskedItsLeafSetToRx2ToReplace...198
Detected timeout of ITS tools.
[2022-05-18 01:25:52] [INFO ] Flatten gal took : 70 ms
[2022-05-18 01:25:52] [INFO ] Applying decomposition
[2022-05-18 01:25:52] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17533780830195113350.txt' '-o' '/tmp/graph17533780830195113350.bin' '-w' '/tmp/graph17533780830195113350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17533780830195113350.bin' '-l' '-1' '-v' '-w' '/tmp/graph17533780830195113350.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:25:52] [INFO ] Decomposing Gal with order
[2022-05-18 01:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:25:52] [INFO ] Removed a total of 1927 redundant transitions.
[2022-05-18 01:25:52] [INFO ] Flatten gal took : 170 ms
[2022-05-18 01:25:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 927 labels/synchronizations in 44 ms.
[2022-05-18 01:25:52] [INFO ] Time to serialize gal into /tmp/LTL2364058629372627229.gal : 12 ms
[2022-05-18 01:25:52] [INFO ] Time to serialize properties into /tmp/LTL10586422298600626303.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2364058629372627229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10586422298600626303.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2364058...246
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(X(F(X((F(G("((i3.i1.i1.u34.Node12ManageTheCrashOfNode8<1)||(i3.i1.i1.u188.Rx3IsAtTheRightExtremityOfTheLeafSet<1))")))&&(F(...275
Formula 0 simplified : !XXFXXFX(FG"((i3.i1.i1.u34.Node12ManageTheCrashOfNode8<1)||(i3.i1.i1.u188.Rx3IsAtTheRightExtremityOfTheLeafSet<1))" & F"((i3.i1.i2.u...252
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4058590695801770355
[2022-05-18 01:26:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4058590695801770355
Running compilation step : cd /tmp/ltsmin4058590695801770355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4058590695801770355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4058590695801770355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 109706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p1))&&p0)))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2878/2878 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1259 transition count 2826
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1259 transition count 2826
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 1247 transition count 2779
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1247 transition count 2779
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 1240 transition count 2723
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 1240 transition count 2723
Applied a total of 72 rules in 172 ms. Remains 1240 /1276 variables (removed 36) and now considering 2723/2878 (removed 155) transitions.
[2022-05-18 01:26:11] [INFO ] Flow matrix only has 2451 transitions (discarded 272 similar events)
// Phase 1: matrix 2451 rows 1240 cols
[2022-05-18 01:26:11] [INFO ] Computed 62 place invariants in 28 ms
[2022-05-18 01:26:12] [INFO ] Implicit Places using invariants in 1003 ms returned [103, 195, 455, 559, 560, 581, 629, 684, 802, 837, 980, 981]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1228/1276 places, 2723/2878 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1216 transition count 2711
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1216 transition count 2711
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1204 transition count 2699
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1204 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1192 transition count 2687
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1192 transition count 2687
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1182 transition count 2607
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1182 transition count 2607
Applied a total of 92 rules in 200 ms. Remains 1182 /1228 variables (removed 46) and now considering 2607/2723 (removed 116) transitions.
[2022-05-18 01:26:12] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2022-05-18 01:26:12] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:26:13] [INFO ] Implicit Places using invariants in 932 ms returned []
[2022-05-18 01:26:13] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2022-05-18 01:26:13] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 01:26:14] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:26:21] [INFO ] Implicit Places using invariants and state equation in 7879 ms returned []
Implicit Place search using SMT with State Equation took 8814 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1276 places, 2607/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1182/1276 places, 2607/2878 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s483 1) (GEQ s490 1)), p1:(AND (GEQ s611 1) (GEQ s1128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 10373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(!(F(X(!p0)) U p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||(F(p1)&&p0))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1276/1276 places, 2878/2878 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 0 with 30 rules applied. Total rules applied 30 place count 1276 transition count 2848
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1246 transition count 2848
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 1246 transition count 2825
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 1223 transition count 2825
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 117 place count 1212 transition count 2779
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 1212 transition count 2779
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 128 place count 1212 transition count 2776
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 1209 transition count 2776
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 1203 transition count 2728
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 1203 transition count 2728
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 202 place count 1175 transition count 2700
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 1168 transition count 2693
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 1168 transition count 2693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1161 transition count 2637
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1161 transition count 2637
Applied a total of 230 rules in 327 ms. Remains 1161 /1276 variables (removed 115) and now considering 2637/2878 (removed 241) transitions.
[2022-05-18 01:26:22] [INFO ] Flow matrix only has 2365 transitions (discarded 272 similar events)
// Phase 1: matrix 2365 rows 1161 cols
[2022-05-18 01:26:22] [INFO ] Computed 62 place invariants in 25 ms
[2022-05-18 01:26:23] [INFO ] Implicit Places using invariants in 963 ms returned [93, 161, 416, 446, 514, 515, 533, 578, 630, 746, 779, 920, 921]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 974 ms to find 13 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1148/1276 places, 2637/2878 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1141 transition count 2630
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1141 transition count 2630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1134 transition count 2623
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1134 transition count 2623
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1129 transition count 2583
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1129 transition count 2583
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1123 transition count 2577
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1117 transition count 2571
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1117 transition count 2571
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1111 transition count 2523
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1111 transition count 2523
Applied a total of 74 rules in 286 ms. Remains 1111 /1148 variables (removed 37) and now considering 2523/2637 (removed 114) transitions.
[2022-05-18 01:26:23] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1111 cols
[2022-05-18 01:26:23] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:26:24] [INFO ] Implicit Places using invariants in 880 ms returned []
[2022-05-18 01:26:24] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1111 cols
[2022-05-18 01:26:24] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:26:24] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:26:33] [INFO ] Implicit Places using invariants and state equation in 9755 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10639 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1110/1276 places, 2523/2878 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1110 transition count 2522
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1109 transition count 2522
Applied a total of 2 rules in 63 ms. Remains 1109 /1110 variables (removed 1) and now considering 2522/2523 (removed 1) transitions.
[2022-05-18 01:26:34] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:26:34] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 01:26:34] [INFO ] Implicit Places using invariants in 914 ms returned []
[2022-05-18 01:26:34] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:26:34] [INFO ] Computed 48 place invariants in 30 ms
[2022-05-18 01:26:35] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:26:45] [INFO ] Implicit Places using invariants and state equation in 10234 ms returned []
Implicit Place search using SMT with State Equation took 11151 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 1109/1276 places, 2522/2878 transitions.
Finished structural reductions, in 3 iterations. Remains : 1109/1276 places, 2522/2878 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s646 1) (LT s1070 1)), p1:(AND (OR (LT s602 1) (LT s909 1)) (OR (LT s646 1) (LT s1070 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1714 reset in 569 ms.
Product exploration explored 100000 steps with 1711 reset in 588 ms.
Computed a total of 293 stabilizing places and 905 stable transitions
Computed a total of 293 stabilizing places and 905 stable transitions
Detected a total of 293/1109 stabilizing places and 905/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 569 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 01:26:47] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:26:47] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 01:26:47] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:26:47] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 01:26:48] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 01:26:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:26:48] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-18 01:26:49] [INFO ] After 778ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-18 01:26:49] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:26:49] [INFO ] After 425ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-18 01:26:50] [INFO ] Deduced a trap composed of 354 places in 443 ms of which 1 ms to minimize.
[2022-05-18 01:26:50] [INFO ] Deduced a trap composed of 74 places in 464 ms of which 1 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 89 places in 462 ms of which 1 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 87 places in 455 ms of which 1 ms to minimize.
[2022-05-18 01:26:52] [INFO ] Deduced a trap composed of 100 places in 431 ms of which 1 ms to minimize.
[2022-05-18 01:26:52] [INFO ] Deduced a trap composed of 87 places in 441 ms of which 1 ms to minimize.
[2022-05-18 01:26:53] [INFO ] Deduced a trap composed of 102 places in 443 ms of which 1 ms to minimize.
[2022-05-18 01:26:53] [INFO ] Deduced a trap composed of 87 places in 443 ms of which 1 ms to minimize.
[2022-05-18 01:26:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4348 ms
[2022-05-18 01:26:54] [INFO ] After 4888ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-18 01:26:54] [INFO ] After 5937ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1109/1109 places, 2522/2522 transitions.
Free-agglomeration rule (complex) applied 120 times.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 1109 transition count 3340
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 240 place count 989 transition count 3340
Applied a total of 240 rules in 160 ms. Remains 989 /1109 variables (removed 120) and now considering 3340/2522 (removed -818) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1109 places, 3340/2522 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81234 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81234 steps, saw 34250 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:26:57] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:26:57] [INFO ] Computed 48 place invariants in 47 ms
[2022-05-18 01:26:57] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:26:57] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-18 01:26:57] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:26:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:26:57] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:26:58] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:26:58] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:26:59] [INFO ] After 503ms SMT Verify possible using 1777 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:26:59] [INFO ] Deduced a trap composed of 187 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:27:00] [INFO ] Deduced a trap composed of 101 places in 491 ms of which 1 ms to minimize.
[2022-05-18 01:27:01] [INFO ] Deduced a trap composed of 100 places in 490 ms of which 0 ms to minimize.
[2022-05-18 01:27:01] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 1 ms to minimize.
[2022-05-18 01:27:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2405 ms
[2022-05-18 01:27:01] [INFO ] After 3101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-05-18 01:27:02] [INFO ] After 4233ms 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 989 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 91 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 80 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2022-05-18 01:27:02] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:02] [INFO ] Computed 48 place invariants in 20 ms
[2022-05-18 01:27:03] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2022-05-18 01:27:03] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:03] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 01:27:04] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:27:18] [INFO ] Implicit Places using invariants and state equation in 15277 ms returned []
Implicit Place search using SMT with State Equation took 16299 ms to find 0 implicit places.
[2022-05-18 01:27:18] [INFO ] Redundant transitions in 128 ms returned []
[2022-05-18 01:27:18] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:18] [INFO ] Computed 48 place invariants in 20 ms
[2022-05-18 01:27:19] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Graph (trivial) has 1050 edges and 989 vertex of which 16 / 989 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 259 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 650 transitions.
Graph (complete) has 3929 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 943 transition count 2593
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 1 with 260 rules applied. Total rules applied 359 place count 848 transition count 2428
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 2 with 218 rules applied. Total rules applied 577 place count 766 transition count 2292
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 54 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 3 with 166 rules applied. Total rules applied 743 place count 707 transition count 2185
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 48 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 4 with 137 rules applied. Total rules applied 880 place count 654 transition count 2101
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 98 rules applied. Total rules applied 978 place count 618 transition count 2039
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 6 with 76 rules applied. Total rules applied 1054 place count 587 transition count 1994
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 47 rules applied. Total rules applied 1101 place count 568 transition count 1966
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 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 8 with 28 rules applied. Total rules applied 1129 place count 554 transition count 1952
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 9 with 14 rules applied. Total rules applied 1143 place count 549 transition count 1943
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1152 place count 540 transition count 1943
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 1152 place count 540 transition count 1935
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1168 place count 532 transition count 1935
Discarding 229 places :
Symmetric choice reduction at 11 with 229 rule applications. Total rules 1397 place count 303 transition count 937
Iterating global reduction 11 with 229 rules applied. Total rules applied 1626 place count 303 transition count 937
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 206 rules applied. Total rules applied 1832 place count 303 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1841 place count 294 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1841 place count 294 transition count 730
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1843 place count 293 transition count 730
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1852 place count 284 transition count 721
Iterating global reduction 13 with 9 rules applied. Total rules applied 1861 place count 284 transition count 721
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 13 with 312 rules applied. Total rules applied 2173 place count 128 transition count 565
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 13 with 152 rules applied. Total rules applied 2325 place count 128 transition count 413
Discarding 46 places :
Symmetric choice reduction at 14 with 46 rule applications. Total rules 2371 place count 82 transition count 167
Iterating global reduction 14 with 46 rules applied. Total rules applied 2417 place count 82 transition count 167
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 14 with 37 rules applied. Total rules applied 2454 place count 82 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2455 place count 81 transition count 126
Iterating global reduction 15 with 1 rules applied. Total rules applied 2456 place count 81 transition count 126
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 15 with 16 rules applied. Total rules applied 2472 place count 81 transition count 110
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 15 with 5 rules applied. Total rules applied 2477 place count 81 transition count 105
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 6 rules applied. Total rules applied 2483 place count 76 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2484 place count 75 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2484 place count 75 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2486 place count 74 transition count 103
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2495 place count 65 transition count 73
Iterating global reduction 18 with 9 rules applied. Total rules applied 2504 place count 65 transition count 73
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 18 with 15 rules applied. Total rules applied 2519 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2521 place count 63 transition count 56
Iterating global reduction 19 with 2 rules applied. Total rules applied 2523 place count 63 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 2525 place count 62 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2526 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2527 place count 61 transition count 61
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 20 with 16 rules applied. Total rules applied 2543 place count 61 transition count 61
Applied a total of 2543 rules in 525 ms. Remains 61 /989 variables (removed 928) and now considering 61/3340 (removed 3279) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 61 cols
[2022-05-18 01:27:20] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 01:27:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:27:20] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:27:20] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:27:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:27:20] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 01:27:20] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:20] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 01:27:20] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:20] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:27:20] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:27:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11451257534111289648.gal : 1 ms
[2022-05-18 01:27:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14242885553167168119.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16992904285872005998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11451257534111289648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14242885553167168119.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14242885553167168119.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 146
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :146 after 352
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :352 after 745
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8408,0.131478,8600,2,5699,12,18837,7,0,294,15372,0
Total reachable state count : 8408
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.132334,8600,2,62,12,18837,7,0,298,15372,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 14 factoid took 630 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1109/1109 places, 2522/2522 transitions.
Applied a total of 0 rules in 46 ms. Remains 1109 /1109 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2022-05-18 01:27:21] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:27:21] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-18 01:27:22] [INFO ] Implicit Places using invariants in 908 ms returned []
[2022-05-18 01:27:22] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:27:22] [INFO ] Computed 48 place invariants in 22 ms
[2022-05-18 01:27:23] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:27:32] [INFO ] Implicit Places using invariants and state equation in 9703 ms returned []
Implicit Place search using SMT with State Equation took 10614 ms to find 0 implicit places.
[2022-05-18 01:27:32] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:27:32] [INFO ] Computed 48 place invariants in 30 ms
[2022-05-18 01:27:33] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1109/1109 places, 2522/2522 transitions.
Computed a total of 293 stabilizing places and 905 stable transitions
Computed a total of 293 stabilizing places and 905 stable transitions
Detected a total of 293/1109 stabilizing places and 905/2522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:27:34] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:27:34] [INFO ] Computed 48 place invariants in 27 ms
[2022-05-18 01:27:34] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:27:34] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 5 ms returned sat
[2022-05-18 01:27:35] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:27:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:27:35] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:27:36] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:36] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:27:36] [INFO ] After 420ms SMT Verify possible using 839 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:37] [INFO ] Deduced a trap composed of 354 places in 432 ms of which 1 ms to minimize.
[2022-05-18 01:27:37] [INFO ] Deduced a trap composed of 74 places in 430 ms of which 1 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 89 places in 469 ms of which 1 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 87 places in 445 ms of which 1 ms to minimize.
[2022-05-18 01:27:39] [INFO ] Deduced a trap composed of 100 places in 463 ms of which 1 ms to minimize.
[2022-05-18 01:27:39] [INFO ] Deduced a trap composed of 87 places in 466 ms of which 1 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 102 places in 460 ms of which 1 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 87 places in 454 ms of which 1 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4357 ms
[2022-05-18 01:27:40] [INFO ] After 4866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-18 01:27:41] [INFO ] After 5943ms 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 1109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1109/1109 places, 2522/2522 transitions.
Free-agglomeration rule (complex) applied 120 times.
Iterating global reduction 0 with 120 rules applied. Total rules applied 120 place count 1109 transition count 3340
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 240 place count 989 transition count 3340
Applied a total of 240 rules in 173 ms. Remains 989 /1109 variables (removed 120) and now considering 3340/2522 (removed -818) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1109 places, 3340/2522 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79595 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79595 steps, saw 33554 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:27:44] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:44] [INFO ] Computed 48 place invariants in 27 ms
[2022-05-18 01:27:44] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:27:44] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:27:44] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:27:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:27:44] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 01:27:45] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:45] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:27:46] [INFO ] After 503ms SMT Verify possible using 1777 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:27:46] [INFO ] Deduced a trap composed of 187 places in 446 ms of which 1 ms to minimize.
[2022-05-18 01:27:47] [INFO ] Deduced a trap composed of 101 places in 494 ms of which 1 ms to minimize.
[2022-05-18 01:27:47] [INFO ] Deduced a trap composed of 100 places in 469 ms of which 0 ms to minimize.
[2022-05-18 01:27:48] [INFO ] Deduced a trap composed of 94 places in 469 ms of which 1 ms to minimize.
[2022-05-18 01:27:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2366 ms
[2022-05-18 01:27:48] [INFO ] After 3066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-05-18 01:27:48] [INFO ] After 4253ms 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 989 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 85 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 989/989 places, 3340/3340 transitions.
Applied a total of 0 rules in 85 ms. Remains 989 /989 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2022-05-18 01:27:48] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:49] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 01:27:50] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2022-05-18 01:27:50] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:27:50] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 01:27:50] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2022-05-18 01:28:04] [INFO ] Implicit Places using invariants and state equation in 14142 ms returned []
Implicit Place search using SMT with State Equation took 15200 ms to find 0 implicit places.
[2022-05-18 01:28:04] [INFO ] Redundant transitions in 131 ms returned []
[2022-05-18 01:28:04] [INFO ] Flow matrix only has 2952 transitions (discarded 388 similar events)
// Phase 1: matrix 2952 rows 989 cols
[2022-05-18 01:28:04] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 01:28:05] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 3340/3340 transitions.
Graph (trivial) has 1050 edges and 989 vertex of which 16 / 989 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 259 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 650 transitions.
Graph (complete) has 3929 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 943 transition count 2593
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 1 with 260 rules applied. Total rules applied 359 place count 848 transition count 2428
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 2 with 218 rules applied. Total rules applied 577 place count 766 transition count 2292
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 54 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 3 with 166 rules applied. Total rules applied 743 place count 707 transition count 2185
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 48 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 4 with 137 rules applied. Total rules applied 880 place count 654 transition count 2101
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 98 rules applied. Total rules applied 978 place count 618 transition count 2039
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 6 with 76 rules applied. Total rules applied 1054 place count 587 transition count 1994
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 47 rules applied. Total rules applied 1101 place count 568 transition count 1966
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 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 8 with 28 rules applied. Total rules applied 1129 place count 554 transition count 1952
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 9 with 14 rules applied. Total rules applied 1143 place count 549 transition count 1943
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1152 place count 540 transition count 1943
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 1152 place count 540 transition count 1935
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1168 place count 532 transition count 1935
Discarding 229 places :
Symmetric choice reduction at 11 with 229 rule applications. Total rules 1397 place count 303 transition count 937
Iterating global reduction 11 with 229 rules applied. Total rules applied 1626 place count 303 transition count 937
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 206 rules applied. Total rules applied 1832 place count 303 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1841 place count 294 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1841 place count 294 transition count 730
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1843 place count 293 transition count 730
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1852 place count 284 transition count 721
Iterating global reduction 13 with 9 rules applied. Total rules applied 1861 place count 284 transition count 721
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 13 with 312 rules applied. Total rules applied 2173 place count 128 transition count 565
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 13 with 152 rules applied. Total rules applied 2325 place count 128 transition count 413
Discarding 46 places :
Symmetric choice reduction at 14 with 46 rule applications. Total rules 2371 place count 82 transition count 167
Iterating global reduction 14 with 46 rules applied. Total rules applied 2417 place count 82 transition count 167
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 14 with 37 rules applied. Total rules applied 2454 place count 82 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2455 place count 81 transition count 126
Iterating global reduction 15 with 1 rules applied. Total rules applied 2456 place count 81 transition count 126
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 15 with 16 rules applied. Total rules applied 2472 place count 81 transition count 110
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 15 with 5 rules applied. Total rules applied 2477 place count 81 transition count 105
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 6 rules applied. Total rules applied 2483 place count 76 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2484 place count 75 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2484 place count 75 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2486 place count 74 transition count 103
Discarding 9 places :
Symmetric choice reduction at 18 with 9 rule applications. Total rules 2495 place count 65 transition count 73
Iterating global reduction 18 with 9 rules applied. Total rules applied 2504 place count 65 transition count 73
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 18 with 15 rules applied. Total rules applied 2519 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2521 place count 63 transition count 56
Iterating global reduction 19 with 2 rules applied. Total rules applied 2523 place count 63 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 2525 place count 62 transition count 62
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2526 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2527 place count 61 transition count 61
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 20 with 16 rules applied. Total rules applied 2543 place count 61 transition count 61
Applied a total of 2543 rules in 564 ms. Remains 61 /989 variables (removed 928) and now considering 61/3340 (removed 3279) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 61 cols
[2022-05-18 01:28:06] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 01:28:06] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 01:28:06] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:28:06] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:28:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:28:06] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 01:28:06] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:28:06] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 01:28:06] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:28:06] [INFO ] Flatten gal took : 4 ms
[2022-05-18 01:28:06] [INFO ] Flatten gal took : 3 ms
[2022-05-18 01:28:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18140923542585532056.gal : 1 ms
[2022-05-18 01:28:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6536556646485014736.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms161777526323809374;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18140923542585532056.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6536556646485014736.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6536556646485014736.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 146
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :146 after 352
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :352 after 745
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8408,0.128162,8604,2,5699,12,18837,7,0,294,15372,0
Total reachable state count : 8408
Verifying 1 reachability properties.
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.128969,8604,2,62,12,18837,7,0,298,15372,0
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 1163 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1713 reset in 515 ms.
Product exploration explored 100000 steps with 1713 reset in 531 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2522/2522 transitions.
Applied a total of 0 rules in 73 ms. Remains 1109 /1109 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2022-05-18 01:28:09] [INFO ] Redundant transitions in 78 ms returned []
[2022-05-18 01:28:09] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:28:09] [INFO ] Computed 48 place invariants in 29 ms
[2022-05-18 01:28:10] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1109/1109 places, 2522/2522 transitions.
Product exploration explored 100000 steps with 1713 reset in 521 ms.
Product exploration explored 100000 steps with 1715 reset in 538 ms.
Built C files in :
/tmp/ltsmin15006395363965008173
[2022-05-18 01:28:11] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15006395363965008173
Running compilation step : cd /tmp/ltsmin15006395363965008173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15006395363965008173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin15006395363965008173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1109/1109 places, 2522/2522 transitions.
Applied a total of 0 rules in 42 ms. Remains 1109 /1109 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
[2022-05-18 01:28:14] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:28:14] [INFO ] Computed 48 place invariants in 30 ms
[2022-05-18 01:28:15] [INFO ] Implicit Places using invariants in 885 ms returned []
[2022-05-18 01:28:15] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:28:15] [INFO ] Computed 48 place invariants in 22 ms
[2022-05-18 01:28:16] [INFO ] State equation strengthened by 839 read => feed constraints.
[2022-05-18 01:28:25] [INFO ] Implicit Places using invariants and state equation in 9919 ms returned []
Implicit Place search using SMT with State Equation took 10804 ms to find 0 implicit places.
[2022-05-18 01:28:25] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1109 cols
[2022-05-18 01:28:25] [INFO ] Computed 48 place invariants in 29 ms
[2022-05-18 01:28:26] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1109/1109 places, 2522/2522 transitions.
Built C files in :
/tmp/ltsmin6214915329068803370
[2022-05-18 01:28:26] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6214915329068803370
Running compilation step : cd /tmp/ltsmin6214915329068803370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6214915329068803370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6214915329068803370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:28:29] [INFO ] Flatten gal took : 86 ms
[2022-05-18 01:28:29] [INFO ] Flatten gal took : 61 ms
[2022-05-18 01:28:29] [INFO ] Time to serialize gal into /tmp/LTL4844279686075396192.gal : 7 ms
[2022-05-18 01:28:29] [INFO ] Time to serialize properties into /tmp/LTL2786137245009715977.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4844279686075396192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2786137245009715977.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4844279...266
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))")))||((F("(((Node11IsTheNodeMaster<1)||(Node15Ha...345
Formula 0 simplified : !G(GX"((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))" | ("((Node12ManageTheCrashOfNode6<1)||(Lx2IsAtTheL...333
Detected timeout of ITS tools.
[2022-05-18 01:28:44] [INFO ] Flatten gal took : 66 ms
[2022-05-18 01:28:44] [INFO ] Applying decomposition
[2022-05-18 01:28:44] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15562977930599517404.txt' '-o' '/tmp/graph15562977930599517404.bin' '-w' '/tmp/graph15562977930599517404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15562977930599517404.bin' '-l' '-1' '-v' '-w' '/tmp/graph15562977930599517404.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:28:45] [INFO ] Decomposing Gal with order
[2022-05-18 01:28:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:28:45] [INFO ] Removed a total of 3275 redundant transitions.
[2022-05-18 01:28:45] [INFO ] Flatten gal took : 161 ms
[2022-05-18 01:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1056 labels/synchronizations in 59 ms.
[2022-05-18 01:28:45] [INFO ] Time to serialize gal into /tmp/LTL11402746222227296269.gal : 12 ms
[2022-05-18 01:28:45] [INFO ] Time to serialize properties into /tmp/LTL11733948583259374843.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11402746222227296269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11733948583259374843.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1140274...247
Read 1 LTL properties
Checking formula 0 : !((G((G(X("((i2.u161.Node12ManageTheCrashOfNode6<1)||(i2.u164.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))")))||((F("(((i18.u11.Node11IsThe...410
Formula 0 simplified : !G(GX"((i2.u161.Node12ManageTheCrashOfNode6<1)||(i2.u164.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))" | ("((i2.u161.Node12ManageTheCrash...398
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13234080360851819703
[2022-05-18 01:29:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13234080360851819703
Running compilation step : cd /tmp/ltsmin13234080360851819703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13234080360851819703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13234080360851819703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 161942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1276/1276 places, 2878/2878 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 0 with 30 rules applied. Total rules applied 30 place count 1276 transition count 2848
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1246 transition count 2848
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 1246 transition count 2825
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 1223 transition count 2825
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 118 place count 1211 transition count 2771
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 1211 transition count 2771
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 130 place count 1211 transition count 2768
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 136 place count 1208 transition count 2768
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 1202 transition count 2720
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 1202 transition count 2720
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 204 place count 1174 transition count 2692
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 211 place count 1167 transition count 2685
Iterating global reduction 2 with 7 rules applied. Total rules applied 218 place count 1167 transition count 2685
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1160 transition count 2629
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1160 transition count 2629
Applied a total of 232 rules in 293 ms. Remains 1160 /1276 variables (removed 116) and now considering 2629/2878 (removed 249) transitions.
[2022-05-18 01:29:04] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1160 cols
[2022-05-18 01:29:04] [INFO ] Computed 62 place invariants in 31 ms
[2022-05-18 01:29:04] [INFO ] Implicit Places using invariants in 914 ms returned [93, 162, 417, 447, 515, 516, 534, 579, 630, 745, 778, 919, 920]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 917 ms to find 13 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1147/1276 places, 2629/2878 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1140 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1140 transition count 2622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1133 transition count 2615
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1133 transition count 2615
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1128 transition count 2575
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1128 transition count 2575
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1122 transition count 2569
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1116 transition count 2563
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1116 transition count 2563
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1110 transition count 2515
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1110 transition count 2515
Applied a total of 74 rules in 279 ms. Remains 1110 /1147 variables (removed 37) and now considering 2515/2629 (removed 114) transitions.
[2022-05-18 01:29:05] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:29:05] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 01:29:06] [INFO ] Implicit Places using invariants in 910 ms returned []
[2022-05-18 01:29:06] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:29:06] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:29:06] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:29:13] [INFO ] Implicit Places using invariants and state equation in 7297 ms returned []
Implicit Place search using SMT with State Equation took 8208 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1110/1276 places, 2515/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1110/1276 places, 2515/2878 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 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 s153 1) (LT s156 1) (LT s556 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1713 reset in 500 ms.
Product exploration explored 100000 steps with 1713 reset in 526 ms.
Computed a total of 294 stabilizing places and 898 stable transitions
Computed a total of 294 stabilizing places and 898 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87951 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87951 steps, saw 37317 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:29:17] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:29:17] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:29:17] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 01:29:17] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:29:18] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:29:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:29:18] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-18 01:29:19] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:19] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:29:20] [INFO ] After 500ms SMT Verify possible using 832 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:20] [INFO ] Deduced a trap composed of 74 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2022-05-18 01:29:20] [INFO ] After 1163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-18 01:29:20] [INFO ] After 2111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2515/2515 transitions.
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 0 with 129 rules applied. Total rules applied 129 place count 1110 transition count 4276
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 258 place count 981 transition count 4276
Applied a total of 258 rules in 229 ms. Remains 981 /1110 variables (removed 129) and now considering 4276/2515 (removed -1761) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1110 places, 4276/2515 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69871 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69871 steps, saw 29439 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:29:24] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:29:24] [INFO ] Computed 49 place invariants in 37 ms
[2022-05-18 01:29:24] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:29:24] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:29:25] [INFO ] After 1204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:29:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 01:29:25] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:29:26] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:26] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:29:28] [INFO ] After 1438ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:28] [INFO ] After 1604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-18 01:29:28] [INFO ] After 2967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 122 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 112 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:29:28] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:29:28] [INFO ] Computed 49 place invariants in 37 ms
[2022-05-18 01:29:29] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2022-05-18 01:29:29] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:29:29] [INFO ] Computed 49 place invariants in 38 ms
[2022-05-18 01:29:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:29:54] [INFO ] Implicit Places using invariants and state equation in 24107 ms returned []
Implicit Place search using SMT with State Equation took 25278 ms to find 0 implicit places.
[2022-05-18 01:29:54] [INFO ] Redundant transitions in 223 ms returned []
[2022-05-18 01:29:54] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:29:54] [INFO ] Computed 49 place invariants in 39 ms
[2022-05-18 01:29:55] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1018 edges and 981 vertex of which 16 / 981 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 275 transitions
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 642 transitions.
Graph (complete) has 4872 edges and 966 vertex of which 952 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 935 transition count 3559
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 192 rules applied. Total rules applied 269 place count 862 transition count 3440
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 159 rules applied. Total rules applied 428 place count 803 transition count 3340
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 121 rules applied. Total rules applied 549 place count 762 transition count 3260
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 103 rules applied. Total rules applied 652 place count 723 transition count 3196
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 73 rules applied. Total rules applied 725 place count 698 transition count 3148
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 59 rules applied. Total rules applied 784 place count 675 transition count 3112
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 37 rules applied. Total rules applied 821 place count 662 transition count 3088
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 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 8 with 27 rules applied. Total rules applied 848 place count 651 transition count 3072
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 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 9 with 13 rules applied. Total rules applied 861 place count 646 transition count 3064
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 7 rules applied. Total rules applied 868 place count 643 transition count 3060
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 872 place count 642 transition count 3057
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 874 place count 640 transition count 3057
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 874 place count 640 transition count 3041
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 906 place count 624 transition count 3041
Discarding 246 places :
Symmetric choice reduction at 13 with 246 rule applications. Total rules 1152 place count 378 transition count 1178
Iterating global reduction 13 with 246 rules applied. Total rules applied 1398 place count 378 transition count 1178
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 13 with 199 rules applied. Total rules applied 1597 place count 378 transition count 979
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 0 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 14 with 508 rules applied. Total rules applied 2105 place count 124 transition count 725
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 14 with 252 rules applied. Total rules applied 2357 place count 124 transition count 473
Discarding 31 places :
Symmetric choice reduction at 15 with 31 rule applications. Total rules 2388 place count 93 transition count 194
Iterating global reduction 15 with 31 rules applied. Total rules applied 2419 place count 93 transition count 194
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2426 place count 86 transition count 159
Iterating global reduction 15 with 7 rules applied. Total rules applied 2433 place count 86 transition count 159
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2440 place count 79 transition count 152
Iterating global reduction 15 with 7 rules applied. Total rules applied 2447 place count 79 transition count 152
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 15 with 17 rules applied. Total rules applied 2464 place count 79 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2464 place count 79 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2466 place count 78 transition count 134
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 2474 place count 70 transition count 70
Iterating global reduction 15 with 8 rules applied. Total rules applied 2482 place count 70 transition count 70
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 2494 place count 70 transition count 58
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 2497 place count 67 transition count 52
Iterating global reduction 16 with 3 rules applied. Total rules applied 2500 place count 67 transition count 52
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2502 place count 65 transition count 50
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 65 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2507 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 64 transition count 46
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2510 place count 63 transition count 45
Iterating global reduction 16 with 1 rules applied. Total rules applied 2511 place count 63 transition count 45
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 16 with 17 rules applied. Total rules applied 2528 place count 63 transition count 28
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 2545 place count 46 transition count 28
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2546 place count 45 transition count 27
Iterating global reduction 17 with 1 rules applied. Total rules applied 2547 place count 45 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2548 place count 45 transition count 27
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2549 place count 44 transition count 26
Iterating global reduction 17 with 1 rules applied. Total rules applied 2550 place count 44 transition count 26
Applied a total of 2550 rules in 639 ms. Remains 44 /981 variables (removed 937) and now considering 26/4276 (removed 4250) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 44 cols
[2022-05-18 01:29:56] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 01:29:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:29:56] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:29:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:29:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 01:29:56] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:29:56] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:56] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:29:56] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:29:56] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:29:56] [INFO ] Flatten gal took : 1 ms
[2022-05-18 01:29:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12077112188644845151.gal : 0 ms
[2022-05-18 01:29:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3610419106498963088.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17614939622191208140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12077112188644845151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3610419106498963088.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3610419106498963088.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.011544,3900,2,68,6,230,6,0,183,70,0
Total reachable state count : 8
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.012159,4340,2,45,6,230,7,0,188,70,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1110/1110 places, 2515/2515 transitions.
Applied a total of 0 rules in 37 ms. Remains 1110 /1110 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-18 01:29:56] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:29:56] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 01:29:57] [INFO ] Implicit Places using invariants in 902 ms returned []
[2022-05-18 01:29:57] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:29:57] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 01:29:58] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:30:05] [INFO ] Implicit Places using invariants and state equation in 7454 ms returned []
Implicit Place search using SMT with State Equation took 8359 ms to find 0 implicit places.
[2022-05-18 01:30:05] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:30:05] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:30:06] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2515/2515 transitions.
Computed a total of 294 stabilizing places and 898 stable transitions
Computed a total of 294 stabilizing places and 898 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 557 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86874 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86874 steps, saw 36864 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:30:10] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:30:10] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 01:30:10] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 01:30:10] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:30:11] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:30:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 01:30:11] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:30:11] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:11] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:30:12] [INFO ] After 478ms SMT Verify possible using 832 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 74 places in 422 ms of which 1 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2022-05-18 01:30:12] [INFO ] After 1100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-18 01:30:13] [INFO ] After 2050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1110/1110 places, 2515/2515 transitions.
Free-agglomeration rule (complex) applied 129 times.
Iterating global reduction 0 with 129 rules applied. Total rules applied 129 place count 1110 transition count 4276
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 258 place count 981 transition count 4276
Applied a total of 258 rules in 204 ms. Remains 981 /1110 variables (removed 129) and now considering 4276/2515 (removed -1761) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1110 places, 4276/2515 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70930 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70930 steps, saw 29881 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:30:16] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:30:16] [INFO ] Computed 49 place invariants in 38 ms
[2022-05-18 01:30:16] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:30:16] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 01:30:17] [INFO ] After 1199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:30:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 01:30:17] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 10 ms returned sat
[2022-05-18 01:30:18] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:30:20] [INFO ] After 1417ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:20] [INFO ] After 1586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-05-18 01:30:20] [INFO ] After 2961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 114 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4276/4276 transitions.
Applied a total of 0 rules in 111 ms. Remains 981 /981 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2022-05-18 01:30:20] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:30:20] [INFO ] Computed 49 place invariants in 49 ms
[2022-05-18 01:30:22] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2022-05-18 01:30:22] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:30:22] [INFO ] Computed 49 place invariants in 32 ms
[2022-05-18 01:30:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 01:30:43] [INFO ] Implicit Places using invariants and state equation in 21852 ms returned []
Implicit Place search using SMT with State Equation took 23058 ms to find 0 implicit places.
[2022-05-18 01:30:44] [INFO ] Redundant transitions in 229 ms returned []
[2022-05-18 01:30:44] [INFO ] Flow matrix only has 3880 transitions (discarded 396 similar events)
// Phase 1: matrix 3880 rows 981 cols
[2022-05-18 01:30:44] [INFO ] Computed 49 place invariants in 57 ms
[2022-05-18 01:30:45] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4276/4276 transitions.
Graph (trivial) has 1018 edges and 981 vertex of which 16 / 981 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 275 transitions
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 642 transitions.
Graph (complete) has 4872 edges and 966 vertex of which 952 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1235.t1463 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 935 transition count 3559
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 192 rules applied. Total rules applied 269 place count 862 transition count 3440
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 159 rules applied. Total rules applied 428 place count 803 transition count 3340
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 121 rules applied. Total rules applied 549 place count 762 transition count 3260
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 103 rules applied. Total rules applied 652 place count 723 transition count 3196
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 5 with 73 rules applied. Total rules applied 725 place count 698 transition count 3148
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 59 rules applied. Total rules applied 784 place count 675 transition count 3112
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 37 rules applied. Total rules applied 821 place count 662 transition count 3088
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 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 8 with 27 rules applied. Total rules applied 848 place count 651 transition count 3072
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 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 9 with 13 rules applied. Total rules applied 861 place count 646 transition count 3064
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 7 rules applied. Total rules applied 868 place count 643 transition count 3060
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 872 place count 642 transition count 3057
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 874 place count 640 transition count 3057
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 874 place count 640 transition count 3041
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 906 place count 624 transition count 3041
Discarding 246 places :
Symmetric choice reduction at 13 with 246 rule applications. Total rules 1152 place count 378 transition count 1178
Iterating global reduction 13 with 246 rules applied. Total rules applied 1398 place count 378 transition count 1178
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 13 with 199 rules applied. Total rules applied 1597 place count 378 transition count 979
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 254
Deduced a syphon composed of 254 places in 1 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 14 with 508 rules applied. Total rules applied 2105 place count 124 transition count 725
Drop transitions removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 14 with 252 rules applied. Total rules applied 2357 place count 124 transition count 473
Discarding 31 places :
Symmetric choice reduction at 15 with 31 rule applications. Total rules 2388 place count 93 transition count 194
Iterating global reduction 15 with 31 rules applied. Total rules applied 2419 place count 93 transition count 194
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2426 place count 86 transition count 159
Iterating global reduction 15 with 7 rules applied. Total rules applied 2433 place count 86 transition count 159
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2440 place count 79 transition count 152
Iterating global reduction 15 with 7 rules applied. Total rules applied 2447 place count 79 transition count 152
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 15 with 17 rules applied. Total rules applied 2464 place count 79 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2464 place count 79 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2466 place count 78 transition count 134
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 2474 place count 70 transition count 70
Iterating global reduction 15 with 8 rules applied. Total rules applied 2482 place count 70 transition count 70
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 2494 place count 70 transition count 58
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 2497 place count 67 transition count 52
Iterating global reduction 16 with 3 rules applied. Total rules applied 2500 place count 67 transition count 52
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2502 place count 65 transition count 50
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 65 transition count 50
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2507 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 64 transition count 46
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2510 place count 63 transition count 45
Iterating global reduction 16 with 1 rules applied. Total rules applied 2511 place count 63 transition count 45
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 16 with 17 rules applied. Total rules applied 2528 place count 63 transition count 28
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 2545 place count 46 transition count 28
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2546 place count 45 transition count 27
Iterating global reduction 17 with 1 rules applied. Total rules applied 2547 place count 45 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2548 place count 45 transition count 27
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2549 place count 44 transition count 26
Iterating global reduction 17 with 1 rules applied. Total rules applied 2550 place count 44 transition count 26
Applied a total of 2550 rules in 626 ms. Remains 44 /981 variables (removed 937) and now considering 26/4276 (removed 4250) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 44 cols
[2022-05-18 01:30:46] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 01:30:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:30:46] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:30:46] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:30:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 01:30:46] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 01:30:46] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:46] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-18 01:30:46] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:30:46] [INFO ] Flatten gal took : 2 ms
[2022-05-18 01:30:46] [INFO ] Flatten gal took : 1 ms
[2022-05-18 01:30:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2187456060766020172.gal : 0 ms
[2022-05-18 01:30:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12149292287868341248.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8113640565115572905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2187456060766020172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12149292287868341248.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12149292287868341248.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.012683,3896,2,68,6,230,6,0,183,70,0
Total reachable state count : 8
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.013432,4336,2,45,6,230,7,0,188,70,0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 550 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1713 reset in 515 ms.
Product exploration explored 100000 steps with 1713 reset in 535 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1110/1110 places, 2515/2515 transitions.
Applied a total of 0 rules in 74 ms. Remains 1110 /1110 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-18 01:30:48] [INFO ] Redundant transitions in 74 ms returned []
[2022-05-18 01:30:48] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:30:48] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-18 01:30:49] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2515/2515 transitions.
Product exploration explored 100000 steps with 1714 reset in 786 ms.
Product exploration explored 100000 steps with 1714 reset in 810 ms.
Built C files in :
/tmp/ltsmin9816809080491550510
[2022-05-18 01:30:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9816809080491550510
Running compilation step : cd /tmp/ltsmin9816809080491550510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9816809080491550510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9816809080491550510;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1110/1110 places, 2515/2515 transitions.
Applied a total of 0 rules in 42 ms. Remains 1110 /1110 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2022-05-18 01:30:54] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:30:54] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-18 01:30:55] [INFO ] Implicit Places using invariants in 888 ms returned []
[2022-05-18 01:30:55] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:30:55] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 01:30:56] [INFO ] State equation strengthened by 832 read => feed constraints.
[2022-05-18 01:31:02] [INFO ] Implicit Places using invariants and state equation in 6981 ms returned []
Implicit Place search using SMT with State Equation took 7872 ms to find 0 implicit places.
[2022-05-18 01:31:02] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1110 cols
[2022-05-18 01:31:02] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-18 01:31:03] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2515/2515 transitions.
Built C files in :
/tmp/ltsmin16723361779637742363
[2022-05-18 01:31:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16723361779637742363
Running compilation step : cd /tmp/ltsmin16723361779637742363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16723361779637742363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16723361779637742363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:31:06] [INFO ] Flatten gal took : 63 ms
[2022-05-18 01:31:06] [INFO ] Flatten gal took : 63 ms
[2022-05-18 01:31:06] [INFO ] Time to serialize gal into /tmp/LTL11950682561238142459.gal : 7 ms
[2022-05-18 01:31:06] [INFO ] Time to serialize properties into /tmp/LTL2037289698941590532.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11950682561238142459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2037289698941590532.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1195068...267
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((Node1IsActive<1)||(Node1IsTheNodeMaster<1))||(Node9AsksIsThereANodeMaster<1))")))))
Formula 0 simplified : !XXG"(((Node1IsActive<1)||(Node1IsTheNodeMaster<1))||(Node9AsksIsThereANodeMaster<1))"
Detected timeout of ITS tools.
[2022-05-18 01:31:21] [INFO ] Flatten gal took : 63 ms
[2022-05-18 01:31:21] [INFO ] Applying decomposition
[2022-05-18 01:31:21] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10076906630990855519.txt' '-o' '/tmp/graph10076906630990855519.bin' '-w' '/tmp/graph10076906630990855519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10076906630990855519.bin' '-l' '-1' '-v' '-w' '/tmp/graph10076906630990855519.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:31:21] [INFO ] Decomposing Gal with order
[2022-05-18 01:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:31:22] [INFO ] Removed a total of 2214 redundant transitions.
[2022-05-18 01:31:22] [INFO ] Flatten gal took : 238 ms
[2022-05-18 01:31:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1253 labels/synchronizations in 44 ms.
[2022-05-18 01:31:22] [INFO ] Time to serialize gal into /tmp/LTL5858597911398171213.gal : 10 ms
[2022-05-18 01:31:22] [INFO ] Time to serialize properties into /tmp/LTL4690970424117676908.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5858597911398171213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4690970424117676908.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5858597...245
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(((u0.Node1IsActive<1)||(u0.Node1IsTheNodeMaster<1))||(u0.Node9AsksIsThereANodeMaster<1))")))))
Formula 0 simplified : !XXG"(((u0.Node1IsActive<1)||(u0.Node1IsTheNodeMaster<1))||(u0.Node9AsksIsThereANodeMaster<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1964853379972531144
[2022-05-18 01:31:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1964853379972531144
Running compilation step : cd /tmp/ltsmin1964853379972531144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1964853379972531144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1964853379972531144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 156880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(X(F(X((F(G(p0))&&F(p1))))))))))'
Found a CL insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1276/1276 places, 2878/2878 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 0 with 30 rules applied. Total rules applied 30 place count 1276 transition count 2848
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1246 transition count 2848
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 60 place count 1246 transition count 2826
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 1224 transition count 2826
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 1214 transition count 2781
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 1214 transition count 2781
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 124 place count 1214 transition count 2779
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 1212 transition count 2779
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 1207 transition count 2739
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 1207 transition count 2739
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 198 place count 1177 transition count 2709
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 205 place count 1170 transition count 2702
Iterating global reduction 2 with 7 rules applied. Total rules applied 212 place count 1170 transition count 2702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 219 place count 1163 transition count 2646
Iterating global reduction 2 with 7 rules applied. Total rules applied 226 place count 1163 transition count 2646
Applied a total of 226 rules in 295 ms. Remains 1163 /1276 variables (removed 113) and now considering 2646/2878 (removed 232) transitions.
[2022-05-18 01:31:41] [INFO ] Flow matrix only has 2374 transitions (discarded 272 similar events)
// Phase 1: matrix 2374 rows 1163 cols
[2022-05-18 01:31:41] [INFO ] Computed 62 place invariants in 30 ms
[2022-05-18 01:31:42] [INFO ] Implicit Places using invariants in 897 ms returned [93, 162, 417, 447, 516, 537, 582, 633, 749, 782, 923, 924]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 899 ms to find 12 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1151/1276 places, 2646/2878 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1145 transition count 2640
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1145 transition count 2640
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1139 transition count 2634
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1139 transition count 2634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1134 transition count 2594
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1134 transition count 2594
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 46 place count 1128 transition count 2588
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 1122 transition count 2582
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 1122 transition count 2582
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1117 transition count 2542
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1117 transition count 2542
Applied a total of 68 rules in 297 ms. Remains 1117 /1151 variables (removed 34) and now considering 2542/2646 (removed 104) transitions.
[2022-05-18 01:31:42] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:31:42] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-18 01:31:43] [INFO ] Implicit Places using invariants in 905 ms returned []
[2022-05-18 01:31:43] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:31:43] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:31:44] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:31:52] [INFO ] Implicit Places using invariants and state equation in 9174 ms returned []
Implicit Place search using SMT with State Equation took 10085 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1117/1276 places, 2542/2878 transitions.
Finished structural reductions, in 2 iterations. Remains : 1117/1276 places, 2542/2878 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s511 1) (LT s514 1)), p0:(OR (LT s662 1) (LT s1101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1710 reset in 533 ms.
Product exploration explored 100000 steps with 1710 reset in 555 ms.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Finished Best-First random walk after 3380 steps, including 12 resets, run visited all 1 properties in 8 ms. (steps per millisecond=422 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 39 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2022-05-18 01:31:55] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:31:55] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 01:31:56] [INFO ] Implicit Places using invariants in 915 ms returned []
[2022-05-18 01:31:56] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:31:56] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:31:56] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:32:04] [INFO ] Implicit Places using invariants and state equation in 8808 ms returned []
Implicit Place search using SMT with State Equation took 9725 ms to find 0 implicit places.
[2022-05-18 01:32:04] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:04] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 01:32:05] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1117/1117 places, 2542/2542 transitions.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 01:32:06] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:06] [INFO ] Computed 50 place invariants in 38 ms
[2022-05-18 01:32:06] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-18 01:32:06] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2022-05-18 01:32:07] [INFO ] After 783ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 01:32:07] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:32:07] [INFO ] After 162ms SMT Verify possible using 853 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:32:07] [INFO ] After 1146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 01:32:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-18 01:32:07] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2022-05-18 01:32:08] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 01:32:08] [INFO ] After 158ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 01:32:09] [INFO ] Deduced a trap composed of 89 places in 452 ms of which 1 ms to minimize.
[2022-05-18 01:32:10] [INFO ] Deduced a trap composed of 84 places in 467 ms of which 1 ms to minimize.
[2022-05-18 01:32:10] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 1 ms to minimize.
[2022-05-18 01:32:11] [INFO ] Deduced a trap composed of 66 places in 459 ms of which 1 ms to minimize.
[2022-05-18 01:32:11] [INFO ] Deduced a trap composed of 85 places in 499 ms of which 1 ms to minimize.
[2022-05-18 01:32:12] [INFO ] Deduced a trap composed of 91 places in 463 ms of which 1 ms to minimize.
[2022-05-18 01:32:12] [INFO ] Deduced a trap composed of 90 places in 434 ms of which 0 ms to minimize.
[2022-05-18 01:32:13] [INFO ] Deduced a trap composed of 68 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:32:13] [INFO ] Deduced a trap composed of 89 places in 423 ms of which 1 ms to minimize.
[2022-05-18 01:32:14] [INFO ] Deduced a trap composed of 100 places in 446 ms of which 1 ms to minimize.
[2022-05-18 01:32:15] [INFO ] Deduced a trap composed of 96 places in 439 ms of which 1 ms to minimize.
[2022-05-18 01:32:15] [INFO ] Deduced a trap composed of 78 places in 464 ms of which 1 ms to minimize.
[2022-05-18 01:32:16] [INFO ] Deduced a trap composed of 66 places in 465 ms of which 1 ms to minimize.
[2022-05-18 01:32:16] [INFO ] Deduced a trap composed of 103 places in 441 ms of which 1 ms to minimize.
[2022-05-18 01:32:17] [INFO ] Deduced a trap composed of 85 places in 450 ms of which 1 ms to minimize.
[2022-05-18 01:32:17] [INFO ] Deduced a trap composed of 79 places in 460 ms of which 1 ms to minimize.
[2022-05-18 01:32:18] [INFO ] Deduced a trap composed of 90 places in 452 ms of which 1 ms to minimize.
[2022-05-18 01:32:18] [INFO ] Deduced a trap composed of 90 places in 448 ms of which 1 ms to minimize.
[2022-05-18 01:32:19] [INFO ] Deduced a trap composed of 77 places in 450 ms of which 1 ms to minimize.
[2022-05-18 01:32:20] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 1 ms to minimize.
[2022-05-18 01:32:20] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 1 ms to minimize.
[2022-05-18 01:32:21] [INFO ] Deduced a trap composed of 87 places in 447 ms of which 0 ms to minimize.
[2022-05-18 01:32:21] [INFO ] Deduced a trap composed of 68 places in 447 ms of which 1 ms to minimize.
[2022-05-18 01:32:22] [INFO ] Deduced a trap composed of 74 places in 483 ms of which 1 ms to minimize.
[2022-05-18 01:32:23] [INFO ] Deduced a trap composed of 66 places in 477 ms of which 1 ms to minimize.
[2022-05-18 01:32:23] [INFO ] Deduced a trap composed of 75 places in 442 ms of which 1 ms to minimize.
[2022-05-18 01:32:24] [INFO ] Deduced a trap composed of 66 places in 496 ms of which 1 ms to minimize.
[2022-05-18 01:32:25] [INFO ] Deduced a trap composed of 79 places in 467 ms of which 1 ms to minimize.
[2022-05-18 01:32:25] [INFO ] Deduced a trap composed of 76 places in 440 ms of which 1 ms to minimize.
[2022-05-18 01:32:26] [INFO ] Deduced a trap composed of 79 places in 438 ms of which 1 ms to minimize.
[2022-05-18 01:32:26] [INFO ] Deduced a trap composed of 219 places in 468 ms of which 1 ms to minimize.
[2022-05-18 01:32:27] [INFO ] Deduced a trap composed of 84 places in 452 ms of which 1 ms to minimize.
[2022-05-18 01:32:27] [INFO ] Deduced a trap composed of 87 places in 468 ms of which 1 ms to minimize.
[2022-05-18 01:32:28] [INFO ] Deduced a trap composed of 66 places in 430 ms of which 1 ms to minimize.
[2022-05-18 01:32:29] [INFO ] Deduced a trap composed of 88 places in 441 ms of which 0 ms to minimize.
[2022-05-18 01:32:29] [INFO ] Deduced a trap composed of 74 places in 441 ms of which 1 ms to minimize.
[2022-05-18 01:32:30] [INFO ] Deduced a trap composed of 66 places in 440 ms of which 1 ms to minimize.
[2022-05-18 01:32:31] [INFO ] Deduced a trap composed of 114 places in 598 ms of which 1 ms to minimize.
[2022-05-18 01:32:31] [INFO ] Deduced a trap composed of 94 places in 440 ms of which 1 ms to minimize.
[2022-05-18 01:32:32] [INFO ] Deduced a trap composed of 226 places in 459 ms of which 0 ms to minimize.
[2022-05-18 01:32:32] [INFO ] Deduced a trap composed of 95 places in 462 ms of which 1 ms to minimize.
[2022-05-18 01:32:32] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 23835 ms
[2022-05-18 01:32:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 01:32:32] [INFO ] After 25016ms 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 1117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1116 transition count 2534
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1116 transition count 2534
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 135 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 268 place count 983 transition count 4277
Applied a total of 268 rules in 283 ms. Remains 983 /1117 variables (removed 134) and now considering 4277/2542 (removed -1735) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/1117 places, 4277/2542 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished probabilistic random walk after 52915 steps, run visited all 1 properties in 2253 ms. (steps per millisecond=23 )
Probabilistic random walk after 52915 steps, saw 22326 distinct states, run finished after 2253 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 366 ms. Reduced automaton from 8 states, 10 edges and 2 AP to 8 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 1130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1712 reset in 505 ms.
Product exploration explored 100000 steps with 1711 reset in 530 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 84 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2022-05-18 01:32:39] [INFO ] Redundant transitions in 82 ms returned []
[2022-05-18 01:32:39] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:39] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 01:32:40] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1117/1117 places, 2542/2542 transitions.
Product exploration explored 100000 steps with 1711 reset in 790 ms.
Product exploration explored 100000 steps with 1711 reset in 782 ms.
Built C files in :
/tmp/ltsmin129270586672874214
[2022-05-18 01:32:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin129270586672874214
Running compilation step : cd /tmp/ltsmin129270586672874214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin129270586672874214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin129270586672874214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 46 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2022-05-18 01:32:45] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:45] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:32:47] [INFO ] Implicit Places using invariants in 1809 ms returned []
[2022-05-18 01:32:47] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:47] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:32:48] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 01:32:57] [INFO ] Implicit Places using invariants and state equation in 9414 ms returned []
Implicit Place search using SMT with State Equation took 11239 ms to find 0 implicit places.
[2022-05-18 01:32:57] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2022-05-18 01:32:57] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 01:32:58] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1117/1117 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin3066536862345144626
[2022-05-18 01:32:58] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3066536862345144626
Running compilation step : cd /tmp/ltsmin3066536862345144626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3066536862345144626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3066536862345144626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:33:01] [INFO ] Flatten gal took : 61 ms
[2022-05-18 01:33:01] [INFO ] Flatten gal took : 62 ms
[2022-05-18 01:33:01] [INFO ] Time to serialize gal into /tmp/LTL15914684059631042864.gal : 7 ms
[2022-05-18 01:33:01] [INFO ] Time to serialize properties into /tmp/LTL1131989190695720205.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15914684059631042864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1131989190695720205.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1591468...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(X(F(X((F(G("((Node12ManageTheCrashOfNode8<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))")))&&(F("((Node6HasAskedItsLeafSetT...221
Formula 0 simplified : !XXFXXFX(FG"((Node12ManageTheCrashOfNode8<1)||(Rx3IsAtTheRightExtremityOfTheLeafSet<1))" & F"((Node6HasAskedItsLeafSetToRx2ToReplace...198
Detected timeout of ITS tools.
[2022-05-18 01:33:16] [INFO ] Flatten gal took : 66 ms
[2022-05-18 01:33:16] [INFO ] Applying decomposition
[2022-05-18 01:33:16] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph334158214579483391.txt' '-o' '/tmp/graph334158214579483391.bin' '-w' '/tmp/graph334158214579483391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph334158214579483391.bin' '-l' '-1' '-v' '-w' '/tmp/graph334158214579483391.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:33:16] [INFO ] Decomposing Gal with order
[2022-05-18 01:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:33:17] [INFO ] Removed a total of 2282 redundant transitions.
[2022-05-18 01:33:17] [INFO ] Flatten gal took : 278 ms
[2022-05-18 01:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1469 labels/synchronizations in 53 ms.
[2022-05-18 01:33:17] [INFO ] Time to serialize gal into /tmp/LTL4425528631817991113.gal : 11 ms
[2022-05-18 01:33:17] [INFO ] Time to serialize properties into /tmp/LTL12896025333259961945.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4425528631817991113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12896025333259961945.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4425528...246
Read 1 LTL properties
Checking formula 0 : !((X(X(F(X(X(F(X((F(G("((i15.i0.u165.Node12ManageTheCrashOfNode8<1)||(i15.i0.u167.Rx3IsAtTheRightExtremityOfTheLeafSet<1))")))&&(F("((...267
Formula 0 simplified : !XXFXXFX(FG"((i15.i0.u165.Node12ManageTheCrashOfNode8<1)||(i15.i0.u167.Rx3IsAtTheRightExtremityOfTheLeafSet<1))" & F"((i15.i1.u79.No...244
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11581205794244457381
[2022-05-18 01:33:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11581205794244457381
Running compilation step : cd /tmp/ltsmin11581205794244457381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11581205794244457381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11581205794244457381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 114764 ms.
[2022-05-18 01:33:35] [INFO ] Flatten gal took : 84 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17412701533427773822
[2022-05-18 01:33:35] [INFO ] Too many transitions (2878) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:33:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17412701533427773822
Running compilation step : cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 01:33:35] [INFO ] Applying decomposition
[2022-05-18 01:33:35] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4637821127714907671.txt' '-o' '/tmp/graph4637821127714907671.bin' '-w' '/tmp/graph4637821127714907671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4637821127714907671.bin' '-l' '-1' '-v' '-w' '/tmp/graph4637821127714907671.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:33:35] [INFO ] Decomposing Gal with order
[2022-05-18 01:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:33:35] [INFO ] Removed a total of 2396 redundant transitions.
[2022-05-18 01:33:35] [INFO ] Flatten gal took : 197 ms
[2022-05-18 01:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1572 labels/synchronizations in 53 ms.
[2022-05-18 01:33:35] [INFO ] Time to serialize gal into /tmp/LTLFireability8081865932498753831.gal : 13 ms
[2022-05-18 01:33:35] [INFO ] Time to serialize properties into /tmp/LTLFireability9885648820325648117.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8081865932498753831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9885648820325648117.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 6 LTL properties
Checking formula 0 : !((G(F((!("((i1.i3.u128.Node11ManageTheCrashOfNode15>=1)&&(i1.i3.u206.Rx0IsAtTheRightExtremityOfTheLeafSet>=1))"))U((G(!("((i1.i3.u128...480
Formula 0 simplified : !GF(!"((i1.i3.u128.Node11ManageTheCrashOfNode15>=1)&&(i1.i3.u206.Rx0IsAtTheRightExtremityOfTheLeafSet>=1))" U ("((!((i1.i3.u128.Node...467
Compilation finished in 7323 ms.
Running link step : cd /tmp/ltsmin17412701533427773822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X((LTLAPp2==true)))&&<>(!(<>(X(!(LTLAPp2==true))) U (LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X((LTLAPp2==true)))&&<>(!(<>(X(!(LTLAPp2==true))) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp4==true)))||(<>((LTLAPp5==true))&&(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 02:02:02] [INFO ] Flatten gal took : 387 ms
[2022-05-18 02:02:03] [INFO ] Time to serialize gal into /tmp/LTLFireability14304189912994736276.gal : 91 ms
[2022-05-18 02:02:03] [INFO ] Time to serialize properties into /tmp/LTLFireability15137133071691847576.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14304189912994736276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15137133071691847576.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 6 LTL properties
Checking formula 0 : !((G(F((!("((Node11ManageTheCrashOfNode15>=1)&&(Rx0IsAtTheRightExtremityOfTheLeafSet>=1))"))U((G(!("((Node11ManageTheCrashOfNode15>=1)...392
Formula 0 simplified : !GF(!"((Node11ManageTheCrashOfNode15>=1)&&(Rx0IsAtTheRightExtremityOfTheLeafSet>=1))" U ("((!((Node11ManageTheCrashOfNode15>=1)&&(Rx...379
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](X((LTLAPp4==true)))||(<>((LTLAPp5==true))&&(LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17412701533427773822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp6==true))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S16C08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r132-tall-165271821200700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 ;