About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5725.336 | 3600000.00 | 6630762.00 | 9239.50 | TT??TFFFF?TFFFF? | 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.r078-tall-165260110000203.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 DoubleExponent-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 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 DoubleExponent-PT-020-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652644990161
Running Version 202205111006
[2022-05-15 20:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-15 20:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:03:11] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-05-15 20:03:11] [INFO ] Transformed 1064 places.
[2022-05-15 20:03:11] [INFO ] Transformed 998 transitions.
[2022-05-15 20:03:11] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 117 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2022-05-15 20:03:12] [INFO ] Invariants computation overflowed in 140 ms
[2022-05-15 20:03:12] [INFO ] Implicit Places using invariants in 626 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2022-05-15 20:03:12] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 20:03:26] [INFO ] Implicit Places using invariants and state equation in 14102 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14763 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 203 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:03:26] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 20:03:27] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:03:27] [INFO ] Invariants computation overflowed in 153 ms
[2022-05-15 20:03:41] [INFO ] Implicit Places using invariants and state equation in 14380 ms returned []
Implicit Place search using SMT with State Equation took 14832 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions, in 2 iterations. Remains : 1057/1064 places, 997/998 transitions.
Support contains 43 out of 1057 places after structural reductions.
[2022-05-15 20:03:41] [INFO ] Flatten gal took : 113 ms
[2022-05-15 20:03:42] [INFO ] Flatten gal took : 60 ms
[2022-05-15 20:03:42] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 42 out of 1057 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 135474 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{4=1, 7=1, 10=1}
Probabilistic random walk after 135474 steps, saw 67753 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :3
Running SMT prover for 23 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:03:46] [INFO ] Invariants computation overflowed in 98 ms
[2022-05-15 20:03:47] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-15 20:03:54] [INFO ] After 5962ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :14
[2022-05-15 20:03:54] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 4 ms to minimize.
[2022-05-15 20:03:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2022-05-15 20:03:55] [INFO ] Deduced a trap composed of 197 places in 188 ms of which 1 ms to minimize.
[2022-05-15 20:03:56] [INFO ] Deduced a trap composed of 235 places in 152 ms of which 1 ms to minimize.
[2022-05-15 20:03:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
[2022-05-15 20:03:56] [INFO ] Deduced a trap composed of 223 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:03:56] [INFO ] Deduced a trap composed of 221 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:03:57] [INFO ] Deduced a trap composed of 211 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:03:57] [INFO ] Deduced a trap composed of 241 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:03:57] [INFO ] Deduced a trap composed of 209 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:03:57] [INFO ] Deduced a trap composed of 199 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:03:58] [INFO ] Deduced a trap composed of 185 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:03:58] [INFO ] Deduced a trap composed of 187 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:03:58] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:03:59] [INFO ] Deduced a trap composed of 199 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:03:59] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:04:00] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:04:00] [INFO ] Deduced a trap composed of 161 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:04:01] [INFO ] Deduced a trap composed of 183 places in 200 ms of which 5 ms to minimize.
[2022-05-15 20:04:01] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 1 ms to minimize.
[2022-05-15 20:04:01] [INFO ] Deduced a trap composed of 198 places in 190 ms of which 0 ms to minimize.
[2022-05-15 20:04:02] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 1 ms to minimize.
[2022-05-15 20:04:02] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 1 ms to minimize.
[2022-05-15 20:04:03] [INFO ] Deduced a trap composed of 259 places in 185 ms of which 1 ms to minimize.
[2022-05-15 20:04:03] [INFO ] Deduced a trap composed of 261 places in 184 ms of which 0 ms to minimize.
[2022-05-15 20:04:03] [INFO ] Deduced a trap composed of 281 places in 175 ms of which 1 ms to minimize.
[2022-05-15 20:04:04] [INFO ] Deduced a trap composed of 320 places in 182 ms of which 0 ms to minimize.
[2022-05-15 20:04:04] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 0 ms to minimize.
[2022-05-15 20:04:05] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 0 ms to minimize.
[2022-05-15 20:04:05] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 1 ms to minimize.
[2022-05-15 20:04:05] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2022-05-15 20:04:05] [INFO ] Deduced a trap composed of 115 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:04:06] [INFO ] Deduced a trap composed of 101 places in 207 ms of which 1 ms to minimize.
[2022-05-15 20:04:06] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 1 ms to minimize.
[2022-05-15 20:04:06] [INFO ] Deduced a trap composed of 103 places in 208 ms of which 0 ms to minimize.
[2022-05-15 20:04:07] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 1 ms to minimize.
[2022-05-15 20:04:07] [INFO ] Deduced a trap composed of 79 places in 252 ms of which 5 ms to minimize.
[2022-05-15 20:04:07] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 0 ms to minimize.
[2022-05-15 20:04:07] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 1 ms to minimize.
[2022-05-15 20:04:09] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 1 ms to minimize.
[2022-05-15 20:04:09] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 1 ms to minimize.
[2022-05-15 20:04:09] [INFO ] Deduced a trap composed of 189 places in 236 ms of which 0 ms to minimize.
[2022-05-15 20:04:10] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 1 ms to minimize.
[2022-05-15 20:04:10] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2022-05-15 20:04:10] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2022-05-15 20:04:10] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14380 ms
[2022-05-15 20:04:12] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2022-05-15 20:04:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 20:04:12] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 26228 ms.
Support contains 25 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1055 transition count 779
Reduce places removed 216 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 225 rules applied. Total rules applied 443 place count 839 transition count 770
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 452 place count 830 transition count 770
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 452 place count 830 transition count 729
Deduced a syphon composed of 41 places in 8 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 534 place count 789 transition count 729
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 4 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 874 place count 619 transition count 559
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 944 place count 584 transition count 559
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 945 place count 584 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 946 place count 583 transition count 558
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 4 with 81 rules applied. Total rules applied 1027 place count 583 transition count 477
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 1108 place count 502 transition count 477
Partial Free-agglomeration rule applied 74 times.
Drop transitions removed 74 transitions
Iterating global reduction 5 with 74 rules applied. Total rules applied 1182 place count 502 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1183 place count 501 transition count 476
Applied a total of 1183 rules in 271 ms. Remains 501 /1057 variables (removed 556) and now considering 476/997 (removed 521) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/1057 places, 476/997 transitions.
Incomplete random walk after 10000 steps, including 1048 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 738 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 716 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 738 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 716 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 720 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 733 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 726 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 725 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 718 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 732 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 686 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 695 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 722 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 743 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 361542 steps, run timeout after 6001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 361542 steps, saw 180853 distinct states, run finished after 6001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 476 rows 501 cols
[2022-05-15 20:04:46] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:04:47] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-15 20:04:49] [INFO ] After 1749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-15 20:04:49] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 20:04:51] [INFO ] After 2078ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-15 20:04:51] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-15 20:04:51] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:04:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:04:52] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:04:53] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:04:54] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:04:55] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:04:55] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:04:55] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:04:55] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:04:56] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2022-05-15 20:04:56] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:04:56] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:04:57] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:04:58] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:04:59] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:04:59] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2022-05-15 20:04:59] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 7152 ms
[2022-05-15 20:05:00] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-15 20:05:01] [INFO ] After 12170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2000 ms.
[2022-05-15 20:05:03] [INFO ] After 16181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 28000 ms.
Support contains 25 out of 501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 501/501 places, 476/476 transitions.
Applied a total of 0 rules in 20 ms. Remains 501 /501 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 476/476 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 501/501 places, 476/476 transitions.
Applied a total of 0 rules in 21 ms. Remains 501 /501 variables (removed 0) and now considering 476/476 (removed 0) transitions.
// Phase 1: matrix 476 rows 501 cols
[2022-05-15 20:05:31] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:05:31] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 476 rows 501 cols
[2022-05-15 20:05:31] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:05:31] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-05-15 20:05:52] [INFO ] Implicit Places using invariants and state equation in 20401 ms returned [218, 232, 238, 268, 323, 330, 352, 381, 387, 409, 411, 415, 437, 444, 467, 472, 493, 499]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 20702 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 483/501 places, 476/476 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 483 transition count 473
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 480 transition count 473
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 15 place count 480 transition count 473
Applied a total of 15 rules in 50 ms. Remains 480 /483 variables (removed 3) and now considering 473/476 (removed 3) transitions.
// Phase 1: matrix 473 rows 480 cols
[2022-05-15 20:05:52] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-15 20:05:52] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 473 rows 480 cols
[2022-05-15 20:05:52] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:05:52] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 20:06:01] [INFO ] Implicit Places using invariants and state equation in 9191 ms returned [69, 75, 96, 101, 122, 130, 152, 158, 159, 179, 184, 205, 211, 457]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 9448 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 466/501 places, 473/476 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 466 transition count 465
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 458 transition count 465
Applied a total of 16 rules in 23 ms. Remains 458 /466 variables (removed 8) and now considering 465/473 (removed 8) transitions.
// Phase 1: matrix 465 rows 458 cols
[2022-05-15 20:06:01] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-15 20:06:01] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 465 rows 458 cols
[2022-05-15 20:06:01] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:06:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 20:06:21] [INFO ] Implicit Places using invariants and state equation in 19936 ms returned []
Implicit Place search using SMT with State Equation took 20169 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 458/501 places, 465/476 transitions.
Finished structural reductions, in 3 iterations. Remains : 458/501 places, 465/476 transitions.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 483 place count 814 transition count 713
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 565 place count 773 transition count 713
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 100 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:06:22] [INFO ] Computed 99 place invariants in 59 ms
[2022-05-15 20:06:22] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:06:22] [INFO ] Computed 99 place invariants in 85 ms
[2022-05-15 20:06:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:06:32] [INFO ] Implicit Places using invariants and state equation in 10200 ms returned []
Implicit Place search using SMT with State Equation took 10514 ms to find 0 implicit places.
[2022-05-15 20:06:32] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:06:32] [INFO ] Computed 99 place invariants in 55 ms
[2022-05-15 20:06:32] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s351 s376)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13845 reset in 239 ms.
Product exploration explored 100000 steps with 13846 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472088 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472088 steps, saw 236116 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:06:36] [INFO ] Computed 99 place invariants in 74 ms
[2022-05-15 20:06:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:06:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 20:06:36] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 38 ms returned sat
[2022-05-15 20:06:37] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:06:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:06:37] [INFO ] After 626ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:06:37] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 20:06:38] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 460 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1661 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 234 place count 476 transition count 454
Applied a total of 234 rules in 46 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 506704 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 506704 steps, saw 253502 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:06:41] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:06:41] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:06:41] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:06:41] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:06:42] [INFO ] After 822ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:06:43] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-15 20:06:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1695 ms
[2022-05-15 20:06:44] [INFO ] After 2725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-05-15 20:06:44] [INFO ] After 3210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 528 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:06:45] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 20:06:45] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:06:45] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:06:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:07:05] [INFO ] Implicit Places using invariants and state equation in 19182 ms returned [198, 211, 225, 230, 259, 281, 286, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 19694 ms to find 23 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 453/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 453 transition count 445
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 444 transition count 445
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 444 transition count 445
Applied a total of 21 rules in 29 ms. Remains 444 /453 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 444 cols
[2022-05-15 20:07:05] [INFO ] Computed 76 place invariants in 53 ms
[2022-05-15 20:07:05] [INFO ] Implicit Places using invariants in 787 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 203, 248]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 791 ms to find 15 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 429/476 places, 445/454 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 27 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:05] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:07:06] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:06] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:07:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:07:25] [INFO ] Implicit Places using invariants and state equation in 19113 ms returned []
Implicit Place search using SMT with State Equation took 19385 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 420/476 places, 436/454 transitions.
Finished structural reductions, in 3 iterations. Remains : 420/476 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529265 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529265 steps, saw 264687 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:28] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:07:28] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:07:28] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:07:28] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:07:29] [INFO ] After 409ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:07:29] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 20:07:29] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 295 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 420/420 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 420 /420 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 420/420 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 420 /420 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:29] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:07:29] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:29] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:07:30] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:07:44] [INFO ] Implicit Places using invariants and state equation in 14863 ms returned []
Implicit Place search using SMT with State Equation took 15154 ms to find 0 implicit places.
[2022-05-15 20:07:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2022-05-15 20:07:44] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:07:45] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 436/436 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 420 transition count 398
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 382 transition count 398
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 364 transition count 380
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 364 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 363 transition count 379
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 363 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 361 transition count 377
Applied a total of 118 rules in 37 ms. Remains 361 /420 variables (removed 59) and now considering 377/436 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 377 rows 361 cols
[2022-05-15 20:07:45] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:07:45] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:07:45] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:07:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:07:45] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:07:45] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:07:45] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:07:46] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:07:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2022-05-15 20:07:46] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-15 20:07:46] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:07:46] [INFO ] Flatten gal took : 39 ms
[2022-05-15 20:07:46] [INFO ] Flatten gal took : 39 ms
[2022-05-15 20:07:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13542284371062242302.gal : 12 ms
[2022-05-15 20:07:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1695982575090048283.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17263744789203739334;'/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/ReachabilityCardinality13542284371062242302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1695982575090048283.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/ReachabilityCardinality1695982575090048283.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 326
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326 after 1146
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1146 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 12558
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12558 after 30030
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30030 after 70535
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70535 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 443915
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :443915 after 1.04192e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04192e+06 after 2.40926e+06
Detected timeout of ITS tools.
[2022-05-15 20:08:01] [INFO ] Flatten gal took : 40 ms
[2022-05-15 20:08:01] [INFO ] Applying decomposition
[2022-05-15 20:08:01] [INFO ] Flatten gal took : 30 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/graph3583837020644611491.txt' '-o' '/tmp/graph3583837020644611491.bin' '-w' '/tmp/graph3583837020644611491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3583837020644611491.bin' '-l' '-1' '-v' '-w' '/tmp/graph3583837020644611491.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:08:01] [INFO ] Decomposing Gal with order
[2022-05-15 20:08:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:08:01] [INFO ] Removed a total of 214 redundant transitions.
[2022-05-15 20:08:01] [INFO ] Flatten gal took : 111 ms
[2022-05-15 20:08:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 19 ms.
[2022-05-15 20:08:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17842531103354194264.gal : 7 ms
[2022-05-15 20:08:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3037049787087813851.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17263744789203739334;'/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/ReachabilityCardinality17842531103354194264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3037049787087813851.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/ReachabilityCardinality3037049787087813851.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 1043
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1043 after 2927
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2927 after 9649
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9649 after 22066
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :22066 after 55897
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :55897 after 128148
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :128148 after 306588
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :306588 after 717746
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :717746 after 1.64309e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17145364674678915584
[2022-05-15 20:08:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17145364674678915584
Running compilation step : cd /tmp/ltsmin17145364674678915584;'/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'
Compilation finished in 899 ms.
Running link step : cd /tmp/ltsmin17145364674678915584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17145364674678915584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 16 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:08:32] [INFO ] Computed 99 place invariants in 52 ms
[2022-05-15 20:08:32] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:08:32] [INFO ] Computed 99 place invariants in 49 ms
[2022-05-15 20:08:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:09:02] [INFO ] Performed 263/554 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 20:09:12] [INFO ] Implicit Places using invariants and state equation in 40368 ms returned []
Implicit Place search using SMT with State Equation took 40719 ms to find 0 implicit places.
[2022-05-15 20:09:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:09:12] [INFO ] Computed 99 place invariants in 57 ms
[2022-05-15 20:09:13] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1378 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 368546 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 368546 steps, saw 184326 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:09:16] [INFO ] Computed 99 place invariants in 67 ms
[2022-05-15 20:09:16] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:09:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:09:16] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 39 ms returned sat
[2022-05-15 20:09:16] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:09:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:09:17] [INFO ] After 680ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:09:17] [INFO ] After 752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-15 20:09:17] [INFO ] After 1223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 419 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1661 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 234 place count 476 transition count 454
Applied a total of 234 rules in 36 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 408260 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408260 steps, saw 204259 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:09:21] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:09:21] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:09:21] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:09:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:09:22] [INFO ] After 808ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:09:22] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:09:22] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:09:23] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2022-05-15 20:09:24] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-15 20:09:24] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-05-15 20:09:24] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:09:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1671 ms
[2022-05-15 20:09:24] [INFO ] After 2693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-05-15 20:09:24] [INFO ] After 3170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 458 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:09:25] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:09:25] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:09:25] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:09:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:09:40] [INFO ] Implicit Places using invariants and state equation in 14844 ms returned [73, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15344 ms to find 33 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 443/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 443 transition count 439
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 30 place count 428 transition count 439
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 428 transition count 439
Applied a total of 31 rules in 32 ms. Remains 428 /443 variables (removed 15) and now considering 439/454 (removed 15) transitions.
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:09:40] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:09:40] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:09:40] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:09:40] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:10:02] [INFO ] Implicit Places using invariants and state equation in 21833 ms returned []
Implicit Place search using SMT with State Equation took 22136 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 428/476 places, 439/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 428/476 places, 439/454 transitions.
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426678 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426678 steps, saw 213417 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:10:05] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:10:05] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:10:06] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:10:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:10:06] [INFO ] After 136ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:10:06] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 20:10:06] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 258 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 439/439 transitions.
Applied a total of 0 rules in 8 ms. Remains 428 /428 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 439/439 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 439/439 transitions.
Applied a total of 0 rules in 8 ms. Remains 428 /428 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:10:06] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:10:06] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:10:06] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:10:07] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:10:30] [INFO ] Implicit Places using invariants and state equation in 23607 ms returned []
Implicit Place search using SMT with State Equation took 23898 ms to find 0 implicit places.
[2022-05-15 20:10:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2022-05-15 20:10:30] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:10:30] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 439/439 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 428 transition count 401
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 390 transition count 401
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 91 place count 375 transition count 386
Iterating global reduction 0 with 15 rules applied. Total rules applied 106 place count 375 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 374 transition count 385
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 374 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 112 place count 372 transition count 383
Applied a total of 112 rules in 28 ms. Remains 372 /428 variables (removed 56) and now considering 383/439 (removed 56) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 372 cols
[2022-05-15 20:10:30] [INFO ] Computed 66 place invariants in 51 ms
[2022-05-15 20:10:30] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:10:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 20:10:30] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 26 ms returned sat
[2022-05-15 20:10:31] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:10:31] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:10:31] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-15 20:10:31] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:10:31] [INFO ] Flatten gal took : 35 ms
[2022-05-15 20:10:31] [INFO ] Flatten gal took : 33 ms
[2022-05-15 20:10:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13819613109134187953.gal : 10 ms
[2022-05-15 20:10:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9587380556131752174.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17719330960707929709;'/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/ReachabilityCardinality13819613109134187953.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9587380556131752174.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/ReachabilityCardinality9587380556131752174.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 328
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :328 after 1156
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1156 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 12863
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12863 after 30971
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30971 after 74275
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :74275 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 453623
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :453623 after 1.05538e+06
Detected timeout of ITS tools.
[2022-05-15 20:10:46] [INFO ] Flatten gal took : 28 ms
[2022-05-15 20:10:46] [INFO ] Applying decomposition
[2022-05-15 20:10:46] [INFO ] Flatten gal took : 28 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/graph1354670207478365557.txt' '-o' '/tmp/graph1354670207478365557.bin' '-w' '/tmp/graph1354670207478365557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1354670207478365557.bin' '-l' '-1' '-v' '-w' '/tmp/graph1354670207478365557.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:10:46] [INFO ] Decomposing Gal with order
[2022-05-15 20:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:10:46] [INFO ] Removed a total of 223 redundant transitions.
[2022-05-15 20:10:46] [INFO ] Flatten gal took : 72 ms
[2022-05-15 20:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 12 ms.
[2022-05-15 20:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7683798826121584055.gal : 6 ms
[2022-05-15 20:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11417246291210443274.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17719330960707929709;'/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/ReachabilityCardinality7683798826121584055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11417246291210443274.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/ReachabilityCardinality11417246291210443274.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 178
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :178 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 1099
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1099 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 14295
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14295 after 35657
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35657 after 93887
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93887 after 246752
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246752 after 670738
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :670738 after 1.82882e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16196346457929427919
[2022-05-15 20:11:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16196346457929427919
Running compilation step : cd /tmp/ltsmin16196346457929427919;'/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'
Compilation finished in 842 ms.
Running link step : cd /tmp/ltsmin16196346457929427919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16196346457929427919;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13800 reset in 141 ms.
Product exploration explored 100000 steps with 13856 reset in 125 ms.
Built C files in :
/tmp/ltsmin12002288069227940948
[2022-05-15 20:11:17] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:11:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:17] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:11:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:17] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:11:17] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:17] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12002288069227940948
Running compilation step : cd /tmp/ltsmin12002288069227940948;'/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'
Compilation finished in 1179 ms.
Running link step : cd /tmp/ltsmin12002288069227940948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12002288069227940948;'/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' '--hoa' '/tmp/stateBased4509708868240981316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:11:32] [INFO ] Computed 99 place invariants in 56 ms
[2022-05-15 20:11:32] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:11:32] [INFO ] Computed 99 place invariants in 54 ms
[2022-05-15 20:11:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:11:45] [INFO ] Implicit Places using invariants and state equation in 12710 ms returned []
Implicit Place search using SMT with State Equation took 13052 ms to find 0 implicit places.
[2022-05-15 20:11:45] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:11:45] [INFO ] Computed 99 place invariants in 54 ms
[2022-05-15 20:11:45] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Built C files in :
/tmp/ltsmin11600694565345705224
[2022-05-15 20:11:45] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2022-05-15 20:11:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:45] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2022-05-15 20:11:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:45] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2022-05-15 20:11:45] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:11:45] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11600694565345705224
Running compilation step : cd /tmp/ltsmin11600694565345705224;'/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'
Compilation finished in 1171 ms.
Running link step : cd /tmp/ltsmin11600694565345705224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11600694565345705224;'/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' '--hoa' '/tmp/stateBased2332427094943282940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:12:01] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:12:01] [INFO ] Flatten gal took : 17 ms
[2022-05-15 20:12:01] [INFO ] Time to serialize gal into /tmp/LTL7058035215018156722.gal : 3 ms
[2022-05-15 20:12:01] [INFO ] Time to serialize properties into /tmp/LTL13787901440856930075.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/LTL7058035215018156722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13787901440856930075.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/LTL7058035...267
Read 1 LTL properties
Checking formula 0 : !((F(G("(p649<=p693)"))))
Formula 0 simplified : !FG"(p649<=p693)"
Detected timeout of ITS tools.
[2022-05-15 20:12:16] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:12:16] [INFO ] Applying decomposition
[2022-05-15 20:12:16] [INFO ] Flatten gal took : 16 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/graph5903913431951015521.txt' '-o' '/tmp/graph5903913431951015521.bin' '-w' '/tmp/graph5903913431951015521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5903913431951015521.bin' '-l' '-1' '-v' '-w' '/tmp/graph5903913431951015521.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:12:16] [INFO ] Decomposing Gal with order
[2022-05-15 20:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:12:16] [INFO ] Removed a total of 425 redundant transitions.
[2022-05-15 20:12:16] [INFO ] Flatten gal took : 42 ms
[2022-05-15 20:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 20 ms.
[2022-05-15 20:12:16] [INFO ] Time to serialize gal into /tmp/LTL17572733531518837164.gal : 7 ms
[2022-05-15 20:12:16] [INFO ] Time to serialize properties into /tmp/LTL12353271497159198786.ltl : 94 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/LTL17572733531518837164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12353271497159198786.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/LTL1757273...268
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu129.p649<=gu129.p693)"))))
Formula 0 simplified : !FG"(gu129.p649<=gu129.p693)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4741126471195858769
[2022-05-15 20:12:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4741126471195858769
Running compilation step : cd /tmp/ltsmin4741126471195858769;'/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'
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin4741126471195858769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4741126471195858769;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-02 finished in 384663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 45 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:12:46] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 20:12:47] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:12:47] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:13:03] [INFO ] Implicit Places using invariants and state equation in 16227 ms returned []
Implicit Place search using SMT with State Equation took 16634 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:13:03] [INFO ] Invariants computation overflowed in 128 ms
[2022-05-15 20:13:03] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s60 s310)], 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][false, false, false]]
Product exploration explored 100000 steps with 3314 reset in 141 ms.
Product exploration explored 100000 steps with 3287 reset in 153 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244281 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244281 steps, saw 122155 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:13:07] [INFO ] Invariants computation overflowed in 131 ms
[2022-05-15 20:13:07] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:13:09] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:09] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2022-05-15 20:13:09] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 0 ms to minimize.
[2022-05-15 20:13:10] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:13:10] [INFO ] Deduced a trap composed of 187 places in 205 ms of which 1 ms to minimize.
[2022-05-15 20:13:10] [INFO ] Deduced a trap composed of 247 places in 215 ms of which 1 ms to minimize.
[2022-05-15 20:13:10] [INFO ] Deduced a trap composed of 185 places in 208 ms of which 1 ms to minimize.
[2022-05-15 20:13:11] [INFO ] Deduced a trap composed of 113 places in 231 ms of which 3 ms to minimize.
[2022-05-15 20:13:11] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 1 ms to minimize.
[2022-05-15 20:13:11] [INFO ] Deduced a trap composed of 211 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:13:11] [INFO ] Deduced a trap composed of 217 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:13:11] [INFO ] Deduced a trap composed of 197 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:13:12] [INFO ] Deduced a trap composed of 199 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:13:12] [INFO ] Deduced a trap composed of 235 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:13:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3135 ms
[2022-05-15 20:13:12] [INFO ] After 4630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2290 ms.
[2022-05-15 20:13:14] [INFO ] After 7041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 816 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1082 place count 554 transition count 454
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1240 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1241 place count 475 transition count 453
Applied a total of 1241 rules in 89 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 419258 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 419258 steps, saw 209755 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:13:20] [INFO ] Computed 99 place invariants in 66 ms
[2022-05-15 20:13:20] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:13:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:13:20] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 38 ms returned sat
[2022-05-15 20:13:20] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:13:21] [INFO ] After 1428ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:13:22] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:13:23] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:13:24] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:13:25] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2022-05-15 20:13:25] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
[2022-05-15 20:13:25] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3113 ms
[2022-05-15 20:13:25] [INFO ] After 4792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 206 ms.
[2022-05-15 20:13:25] [INFO ] After 5366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 22 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:13:27] [INFO ] Computed 99 place invariants in 58 ms
[2022-05-15 20:13:29] [INFO ] Implicit Places using invariants in 1540 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 147, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1543 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 19 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:13:29] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:13:29] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:13:29] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:13:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:13:47] [INFO ] Implicit Places using invariants and state equation in 18370 ms returned []
Implicit Place search using SMT with State Equation took 18642 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 441873 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 441873 steps, saw 220985 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:13:50] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:13:50] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:13:51] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:13:52] [INFO ] After 758ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 0 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2022-05-15 20:13:52] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:13:53] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:13:54] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:13:55] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3527 ms
[2022-05-15 20:13:55] [INFO ] After 4537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 220 ms.
[2022-05-15 20:13:56] [INFO ] After 5216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:13:58] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:13:58] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:13:58] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:13:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:14:17] [INFO ] Implicit Places using invariants and state equation in 19049 ms returned []
Implicit Place search using SMT with State Equation took 19323 ms to find 0 implicit places.
[2022-05-15 20:14:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:14:17] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:14:17] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 418 transition count 396
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 380 transition count 396
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 362 transition count 378
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 27 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2022-05-15 20:14:17] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:14:17] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:14:17] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:14:18] [INFO ] After 189ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:14:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 519 ms
[2022-05-15 20:14:18] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 20:14:18] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:14:18] [INFO ] Flatten gal took : 23 ms
[2022-05-15 20:14:18] [INFO ] Flatten gal took : 23 ms
[2022-05-15 20:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3672422386467941707.gal : 4 ms
[2022-05-15 20:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17918351452386114575.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16903334951177359728;'/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/ReachabilityCardinality3672422386467941707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17918351452386114575.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/ReachabilityCardinality17918351452386114575.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 314
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :314 after 1176
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1176 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 12725
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12725 after 30049
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30049 after 70959
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70959 after 185667
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185667 after 444185
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :444185 after 1.04165e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04165e+06 after 2.4089e+06
Detected timeout of ITS tools.
[2022-05-15 20:14:33] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:14:33] [INFO ] Applying decomposition
[2022-05-15 20:14:33] [INFO ] Flatten gal took : 21 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/graph15145065886159194105.txt' '-o' '/tmp/graph15145065886159194105.bin' '-w' '/tmp/graph15145065886159194105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15145065886159194105.bin' '-l' '-1' '-v' '-w' '/tmp/graph15145065886159194105.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:14:33] [INFO ] Decomposing Gal with order
[2022-05-15 20:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:14:34] [INFO ] Removed a total of 212 redundant transitions.
[2022-05-15 20:14:34] [INFO ] Flatten gal took : 46 ms
[2022-05-15 20:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 8 ms.
[2022-05-15 20:14:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12471863495884903987.gal : 6 ms
[2022-05-15 20:14:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8997117706928789335.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16903334951177359728;'/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/ReachabilityCardinality12471863495884903987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8997117706928789335.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/ReachabilityCardinality8997117706928789335.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :63 after 192
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :192 after 1483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1483 after 3582
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3582 after 16093
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16093 after 38137
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :38137 after 113159
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :113159 after 319616
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :319616 after 911255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16022866283088510390
[2022-05-15 20:14:49] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16022866283088510390
Running compilation step : cd /tmp/ltsmin16022866283088510390;'/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'
Compilation finished in 757 ms.
Running link step : cd /tmp/ltsmin16022866283088510390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16022866283088510390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 45 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:15:04] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 20:15:05] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:15:05] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 20:15:21] [INFO ] Implicit Places using invariants and state equation in 16248 ms returned []
Implicit Place search using SMT with State Equation took 16649 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:15:21] [INFO ] Invariants computation overflowed in 119 ms
[2022-05-15 20:15:21] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245578 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245578 steps, saw 122806 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:15:25] [INFO ] Invariants computation overflowed in 129 ms
[2022-05-15 20:15:25] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:15:26] [INFO ] After 1433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:15:27] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 1 ms to minimize.
[2022-05-15 20:15:27] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 1 ms to minimize.
[2022-05-15 20:15:27] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:15:27] [INFO ] Deduced a trap composed of 187 places in 204 ms of which 1 ms to minimize.
[2022-05-15 20:15:28] [INFO ] Deduced a trap composed of 247 places in 211 ms of which 1 ms to minimize.
[2022-05-15 20:15:28] [INFO ] Deduced a trap composed of 185 places in 200 ms of which 1 ms to minimize.
[2022-05-15 20:15:28] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 1 ms to minimize.
[2022-05-15 20:15:28] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 1 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Deduced a trap composed of 211 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Deduced a trap composed of 217 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Deduced a trap composed of 199 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Deduced a trap composed of 235 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:15:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2996 ms
[2022-05-15 20:15:29] [INFO ] After 4491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2286 ms.
[2022-05-15 20:15:32] [INFO ] After 6894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 816 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 11 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1082 place count 554 transition count 454
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1240 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1241 place count 475 transition count 453
Applied a total of 1241 rules in 89 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426496 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426496 steps, saw 213386 distinct states, run finished after 3002 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:15:37] [INFO ] Computed 99 place invariants in 58 ms
[2022-05-15 20:15:37] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:15:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:15:37] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 39 ms returned sat
[2022-05-15 20:15:37] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:15:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:15:39] [INFO ] After 1377ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 0 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2022-05-15 20:15:39] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:15:40] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:15:41] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2022-05-15 20:15:42] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3079 ms
[2022-05-15 20:15:42] [INFO ] After 4710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-05-15 20:15:42] [INFO ] After 5274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2004 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 17 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:15:44] [INFO ] Computed 99 place invariants in 56 ms
[2022-05-15 20:15:46] [INFO ] Implicit Places using invariants in 1392 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 147, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1399 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 22 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:15:46] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:15:46] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:15:46] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-15 20:15:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:16:11] [INFO ] Implicit Places using invariants and state equation in 24766 ms returned []
Implicit Place search using SMT with State Equation took 25037 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 442914 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 442914 steps, saw 221505 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:16:14] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:16:14] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:16:14] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:16:15] [INFO ] After 740ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:15] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2022-05-15 20:16:15] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2022-05-15 20:16:16] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:16:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2022-05-15 20:16:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:16:19] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:16:19] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:16:19] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3434 ms
[2022-05-15 20:16:19] [INFO ] After 4422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 211 ms.
[2022-05-15 20:16:19] [INFO ] After 5092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:16:21] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:16:21] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:16:21] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:16:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:16:31] [INFO ] Implicit Places using invariants and state equation in 9385 ms returned []
Implicit Place search using SMT with State Equation took 9652 ms to find 0 implicit places.
[2022-05-15 20:16:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:16:31] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:16:31] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 418 transition count 396
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 380 transition count 396
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 362 transition count 378
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 24 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2022-05-15 20:16:31] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:16:31] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:16:31] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:16:31] [INFO ] After 191ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:16:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2022-05-15 20:16:32] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 20:16:32] [INFO ] After 1113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:16:32] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:16:32] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:16:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3679660525067217546.gal : 4 ms
[2022-05-15 20:16:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8766166882559043999.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15275973992729934647;'/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/ReachabilityCardinality3679660525067217546.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8766166882559043999.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...319
Loading property file /tmp/ReachabilityCardinality8766166882559043999.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 314
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :314 after 1176
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1176 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 12725
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12725 after 30049
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30049 after 70959
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70959 after 185667
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185667 after 444185
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :444185 after 1.04165e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04165e+06 after 2.4089e+06
Detected timeout of ITS tools.
[2022-05-15 20:16:47] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:16:47] [INFO ] Applying decomposition
[2022-05-15 20:16:47] [INFO ] Flatten gal took : 25 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/graph14929677599168652402.txt' '-o' '/tmp/graph14929677599168652402.bin' '-w' '/tmp/graph14929677599168652402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14929677599168652402.bin' '-l' '-1' '-v' '-w' '/tmp/graph14929677599168652402.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:16:47] [INFO ] Decomposing Gal with order
[2022-05-15 20:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:16:47] [INFO ] Removed a total of 212 redundant transitions.
[2022-05-15 20:16:47] [INFO ] Flatten gal took : 45 ms
[2022-05-15 20:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 7 ms.
[2022-05-15 20:16:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17791603605906870651.gal : 4 ms
[2022-05-15 20:16:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8940763744516665335.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15275973992729934647;'/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/ReachabilityCardinality17791603605906870651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8940763744516665335.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/ReachabilityCardinality8940763744516665335.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 39
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :39 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 277
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :277 after 1455
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1455 after 3545
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3545 after 14391
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14391 after 35533
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35533 after 93791
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93791 after 247319
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :247319 after 677753
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3424517224313747341
[2022-05-15 20:17:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3424517224313747341
Running compilation step : cd /tmp/ltsmin3424517224313747341;'/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'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin3424517224313747341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3424517224313747341;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3316 reset in 108 ms.
Product exploration explored 100000 steps with 3321 reset in 146 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 239 place count 1056 transition count 1035
Deduced a syphon composed of 280 places in 8 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 281 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 285 place count 1052 transition count 1031
Deduced a syphon composed of 276 places in 8 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 289 place count 1052 transition count 1031
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 457 places in 5 ms
Iterating global reduction 1 with 181 rules applied. Total rules applied 470 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 471 place count 1051 transition count 1070
Deduced a syphon composed of 456 places in 5 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 472 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -252
Deduced a syphon composed of 496 places in 5 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 512 place count 1051 transition count 1322
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 553 place count 1010 transition count 1240
Deduced a syphon composed of 455 places in 5 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 594 place count 1010 transition count 1240
Deduced a syphon composed of 455 places in 4 ms
Applied a total of 594 rules in 363 ms. Remains 1010 /1057 variables (removed 47) and now considering 1240/997 (removed -243) transitions.
[2022-05-15 20:17:19] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1240 rows 1010 cols
[2022-05-15 20:17:19] [INFO ] Invariants computation overflowed in 151 ms
[2022-05-15 20:17:19] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1240/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1057 places, 1240/997 transitions.
Product exploration explored 100000 steps with 10780 reset in 780 ms.
Product exploration explored 100000 steps with 10855 reset in 757 ms.
Built C files in :
/tmp/ltsmin11793529085331587254
[2022-05-15 20:17:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11793529085331587254
Running compilation step : cd /tmp/ltsmin11793529085331587254;'/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'
Compilation finished in 1571 ms.
Running link step : cd /tmp/ltsmin11793529085331587254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11793529085331587254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9382983474907681655.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 31 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:17:36] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 20:17:36] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:17:37] [INFO ] Invariants computation overflowed in 119 ms
[2022-05-15 20:17:53] [INFO ] Implicit Places using invariants and state equation in 16654 ms returned []
Implicit Place search using SMT with State Equation took 17039 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:17:53] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:17:54] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin11320234338305987197
[2022-05-15 20:17:54] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11320234338305987197
Running compilation step : cd /tmp/ltsmin11320234338305987197;'/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'
Compilation finished in 1722 ms.
Running link step : cd /tmp/ltsmin11320234338305987197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11320234338305987197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5100992061887402943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:18:09] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:18:09] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:18:09] [INFO ] Time to serialize gal into /tmp/LTL11132000079896525593.gal : 3 ms
[2022-05-15 20:18:09] [INFO ] Time to serialize properties into /tmp/LTL4258003988351260998.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/LTL11132000079896525593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4258003988351260998.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/LTL1113200...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(p1055<=p325)"))))
Formula 0 simplified : !XG"(p1055<=p325)"
Detected timeout of ITS tools.
[2022-05-15 20:18:24] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:18:24] [INFO ] Applying decomposition
[2022-05-15 20:18:24] [INFO ] Flatten gal took : 24 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/graph15236632016924148118.txt' '-o' '/tmp/graph15236632016924148118.bin' '-w' '/tmp/graph15236632016924148118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15236632016924148118.bin' '-l' '-1' '-v' '-w' '/tmp/graph15236632016924148118.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:18:24] [INFO ] Decomposing Gal with order
[2022-05-15 20:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:18:24] [INFO ] Removed a total of 282 redundant transitions.
[2022-05-15 20:18:24] [INFO ] Flatten gal took : 51 ms
[2022-05-15 20:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2022-05-15 20:18:24] [INFO ] Time to serialize gal into /tmp/LTL3196533653286063855.gal : 7 ms
[2022-05-15 20:18:24] [INFO ] Time to serialize properties into /tmp/LTL6537299761977056896.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/LTL3196533653286063855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6537299761977056896.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/LTL3196533...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu137.p1055<=gu137.p325)"))))
Formula 0 simplified : !XG"(gu137.p1055<=gu137.p325)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14592946604948809603
[2022-05-15 20:18:39] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14592946604948809603
Running compilation step : cd /tmp/ltsmin14592946604948809603;'/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'
Compilation finished in 1600 ms.
Running link step : cd /tmp/ltsmin14592946604948809603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14592946604948809603;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-03 finished in 368253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 36 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:18:55] [INFO ] Invariants computation overflowed in 128 ms
[2022-05-15 20:18:55] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:18:55] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 20:19:12] [INFO ] Implicit Places using invariants and state equation in 17306 ms returned []
Implicit Place search using SMT with State Equation took 17700 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:12] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 20:19:13] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s92 s644) (GT s321 s434))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 754 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-020-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-04 finished in 19956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:14] [INFO ] Invariants computation overflowed in 135 ms
[2022-05-15 20:19:15] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:15] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:19:31] [INFO ] Implicit Places using invariants and state equation in 16261 ms returned []
Implicit Place search using SMT with State Equation took 16660 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:31] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:19:31] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1033 s762)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-05 finished in 17278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(F(p0))) U G(p1)))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:32] [INFO ] Invariants computation overflowed in 135 ms
[2022-05-15 20:19:32] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:32] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 20:19:48] [INFO ] Implicit Places using invariants and state equation in 15729 ms returned []
Implicit Place search using SMT with State Equation took 16129 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:48] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 20:19:48] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s69), p0:(LEQ s251 s589)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20060 reset in 359 ms.
Product exploration explored 100000 steps with 20051 reset in 411 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 342 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:19:50] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 20:19:50] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:19:53] [INFO ] After 2595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:19:54] [INFO ] Deduced a trap composed of 79 places in 241 ms of which 0 ms to minimize.
[2022-05-15 20:19:54] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 1 ms to minimize.
[2022-05-15 20:19:55] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 0 ms to minimize.
[2022-05-15 20:19:55] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 1 ms to minimize.
[2022-05-15 20:19:55] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 1 ms to minimize.
[2022-05-15 20:19:56] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2022-05-15 20:19:56] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 1 ms to minimize.
[2022-05-15 20:19:56] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 0 ms to minimize.
[2022-05-15 20:19:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2372 ms
[2022-05-15 20:19:56] [INFO ] After 5976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1229 ms.
[2022-05-15 20:19:57] [INFO ] After 7323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 14 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1238 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 476 transition count 454
Applied a total of 1239 rules in 143 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426739 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426739 steps, saw 213495 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:20:01] [INFO ] Computed 99 place invariants in 45 ms
[2022-05-15 20:20:01] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:20:01] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 37 ms returned sat
[2022-05-15 20:20:01] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:01] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:20:01] [INFO ] After 232ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:01] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-15 20:20:01] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:20:02] [INFO ] Computed 99 place invariants in 43 ms
[2022-05-15 20:20:03] [INFO ] Implicit Places using invariants in 1403 ms returned [42, 48, 68, 73, 94, 99, 120, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1405 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 438/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 438 transition count 435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 419 transition count 435
Applied a total of 38 rules in 18 ms. Remains 419 /438 variables (removed 19) and now considering 435/454 (removed 19) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:03] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:20:03] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:03] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:20:03] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:20:19] [INFO ] Implicit Places using invariants and state equation in 16109 ms returned []
Implicit Place search using SMT with State Equation took 16376 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/476 places, 435/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449671 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449671 steps, saw 224879 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:22] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:20:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:23] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:20:24] [INFO ] After 295ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:24] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:20:24] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-15 20:20:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2022-05-15 20:20:24] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 581 ms.
[2022-05-15 20:20:25] [INFO ] After 2545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:25] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:20:25] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:25] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:20:26] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:20:49] [INFO ] Implicit Places using invariants and state equation in 23680 ms returned []
Implicit Place search using SMT with State Equation took 23964 ms to find 0 implicit places.
[2022-05-15 20:20:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:20:49] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:20:49] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 24 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2022-05-15 20:20:49] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:20:49] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:50] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:20:50] [INFO ] After 174ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:50] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 20:20:50] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:50] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:20:50] [INFO ] Flatten gal took : 21 ms
[2022-05-15 20:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13069914053526536801.gal : 2 ms
[2022-05-15 20:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15261850558012952012.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10728353688031339152;'/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/ReachabilityCardinality13069914053526536801.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15261850558012952012.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/ReachabilityCardinality15261850558012952012.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 314
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :314 after 1176
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1176 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 12725
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12725 after 30049
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30049 after 70959
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70959 after 185667
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185667 after 444185
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :444185 after 1.04165e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04165e+06 after 2.4089e+06
Detected timeout of ITS tools.
[2022-05-15 20:21:05] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:21:05] [INFO ] Applying decomposition
[2022-05-15 20:21:05] [INFO ] Flatten gal took : 20 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/graph8249842242042176681.txt' '-o' '/tmp/graph8249842242042176681.bin' '-w' '/tmp/graph8249842242042176681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8249842242042176681.bin' '-l' '-1' '-v' '-w' '/tmp/graph8249842242042176681.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:21:05] [INFO ] Decomposing Gal with order
[2022-05-15 20:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:21:05] [INFO ] Removed a total of 217 redundant transitions.
[2022-05-15 20:21:05] [INFO ] Flatten gal took : 41 ms
[2022-05-15 20:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 11 ms.
[2022-05-15 20:21:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6929148568771853233.gal : 7 ms
[2022-05-15 20:21:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12692322689666876302.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10728353688031339152;'/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/ReachabilityCardinality6929148568771853233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12692322689666876302.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/ReachabilityCardinality12692322689666876302.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :63 after 192
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :192 after 951
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :951 after 3398
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3398 after 10679
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10679 after 31343
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :31343 after 74592
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :74592 after 191131
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :191131 after 517658
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3968116334411390996
[2022-05-15 20:21:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3968116334411390996
Running compilation step : cd /tmp/ltsmin3968116334411390996;'/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'
Compilation finished in 753 ms.
Running link step : cd /tmp/ltsmin3968116334411390996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3968116334411390996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:21:36] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 20:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:21:48] [INFO ] [Real]Absence check using state equation in 10742 ms returned sat
[2022-05-15 20:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:21:58] [INFO ] [Nat]Absence check using state equation in 9275 ms returned sat
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 0 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2022-05-15 20:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2022-05-15 20:21:58] [INFO ] Computed and/alt/rep : 996/1928/996 causal constraints (skipped 0 transitions) in 48 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 20:22:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 30 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:22:03] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 20:22:03] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:22:03] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:22:18] [INFO ] Implicit Places using invariants and state equation in 15193 ms returned []
Implicit Place search using SMT with State Equation took 15603 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:22:18] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 20:22:19] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 248918 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{0=1}
Probabilistic random walk after 248918 steps, saw 124477 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:22:23] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 20:22:23] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:25] [INFO ] After 2573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:27] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 1 ms to minimize.
[2022-05-15 20:22:27] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 1 ms to minimize.
[2022-05-15 20:22:27] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 1 ms to minimize.
[2022-05-15 20:22:27] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 1 ms to minimize.
[2022-05-15 20:22:28] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 1 ms to minimize.
[2022-05-15 20:22:28] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 1 ms to minimize.
[2022-05-15 20:22:28] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 1 ms to minimize.
[2022-05-15 20:22:29] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2022-05-15 20:22:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2312 ms
[2022-05-15 20:22:29] [INFO ] After 5906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1209 ms.
[2022-05-15 20:22:30] [INFO ] After 7240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1238 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 476 transition count 454
Applied a total of 1239 rules in 92 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427737 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427737 steps, saw 214000 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:22:33] [INFO ] Computed 99 place invariants in 44 ms
[2022-05-15 20:22:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 20:22:33] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 34 ms returned sat
[2022-05-15 20:22:33] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:22:34] [INFO ] After 216ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:34] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-15 20:22:34] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2022-05-15 20:22:34] [INFO ] Computed 99 place invariants in 43 ms
[2022-05-15 20:22:35] [INFO ] Implicit Places using invariants in 1393 ms returned [42, 48, 68, 73, 94, 99, 120, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1394 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 438/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 438 transition count 435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 419 transition count 435
Applied a total of 38 rules in 16 ms. Remains 419 /438 variables (removed 19) and now considering 435/454 (removed 19) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:22:35] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:22:35] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:22:36] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:22:36] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:22:54] [INFO ] Implicit Places using invariants and state equation in 18697 ms returned []
Implicit Place search using SMT with State Equation took 18957 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/476 places, 435/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 439583 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439583 steps, saw 219835 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:22:57] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:22:57] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:58] [INFO ] After 966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:22:59] [INFO ] After 301ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:59] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2022-05-15 20:22:59] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:22:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2022-05-15 20:22:59] [INFO ] After 949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 591 ms.
[2022-05-15 20:23:00] [INFO ] After 2570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 63 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:23:00] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:23:00] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:23:00] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:23:00] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:23:23] [INFO ] Implicit Places using invariants and state equation in 22394 ms returned []
Implicit Place search using SMT with State Equation took 22670 ms to find 0 implicit places.
[2022-05-15 20:23:23] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:23:23] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:23:23] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 32 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2022-05-15 20:23:23] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:23:23] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:23:24] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:23:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:23:24] [INFO ] After 173ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:23:24] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 20:23:24] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:23:24] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:23:24] [INFO ] Flatten gal took : 21 ms
[2022-05-15 20:23:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9475428361163908031.gal : 2 ms
[2022-05-15 20:23:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2340378462781532210.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7304998808020088006;'/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/ReachabilityCardinality9475428361163908031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2340378462781532210.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...319
Loading property file /tmp/ReachabilityCardinality2340378462781532210.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 314
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :314 after 1176
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1176 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 12725
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12725 after 30049
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30049 after 70959
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70959 after 185667
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185667 after 444185
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :444185 after 1.04165e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04165e+06 after 2.4089e+06
Detected timeout of ITS tools.
[2022-05-15 20:23:39] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:23:39] [INFO ] Applying decomposition
[2022-05-15 20:23:39] [INFO ] Flatten gal took : 22 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/graph5709236513978886520.txt' '-o' '/tmp/graph5709236513978886520.bin' '-w' '/tmp/graph5709236513978886520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5709236513978886520.bin' '-l' '-1' '-v' '-w' '/tmp/graph5709236513978886520.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:23:39] [INFO ] Decomposing Gal with order
[2022-05-15 20:23:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:23:39] [INFO ] Removed a total of 221 redundant transitions.
[2022-05-15 20:23:39] [INFO ] Flatten gal took : 40 ms
[2022-05-15 20:23:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 4 ms.
[2022-05-15 20:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5385482870904706445.gal : 4 ms
[2022-05-15 20:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13798787943928704674.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7304998808020088006;'/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/ReachabilityCardinality5385482870904706445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13798787943928704674.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/ReachabilityCardinality13798787943928704674.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 274
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :274 after 1058
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1058 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 12151
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12151 after 30024
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30024 after 69633
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :69633 after 188058
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :188058 after 508252
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :508252 after 1.41753e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin364588305225242014
[2022-05-15 20:23:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin364588305225242014
Running compilation step : cd /tmp/ltsmin364588305225242014;'/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'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin364588305225242014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin364588305225242014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:24:10] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 20:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:22] [INFO ] [Real]Absence check using state equation in 11123 ms returned sat
[2022-05-15 20:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:24:32] [INFO ] [Nat]Absence check using state equation in 9637 ms returned sat
[2022-05-15 20:24:32] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 1 ms to minimize.
[2022-05-15 20:24:32] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2022-05-15 20:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
[2022-05-15 20:24:32] [INFO ] Computed and/alt/rep : 996/1928/996 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-15 20:24:37] [INFO ] Added : 65 causal constraints over 13 iterations in 4235 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 20017 reset in 386 ms.
Product exploration explored 100000 steps with 20044 reset in 369 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1056 transition count 996
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 237 place count 1056 transition count 1035
Deduced a syphon composed of 279 places in 8 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 280 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 284 place count 1052 transition count 1031
Deduced a syphon composed of 275 places in 8 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 288 place count 1052 transition count 1031
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 455 places in 5 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 468 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 469 place count 1051 transition count 1070
Deduced a syphon composed of 454 places in 11 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 470 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -250
Deduced a syphon composed of 494 places in 5 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 510 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 551 place count 1010 transition count 1238
Deduced a syphon composed of 453 places in 4 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 592 place count 1010 transition count 1238
Deduced a syphon composed of 453 places in 5 ms
Applied a total of 592 rules in 205 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2022-05-15 20:24:38] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2022-05-15 20:24:38] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 20:24:39] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1057 places, 1238/997 transitions.
Product exploration explored 100000 steps with 20047 reset in 1635 ms.
Product exploration explored 100000 steps with 20069 reset in 1629 ms.
Built C files in :
/tmp/ltsmin5600494113181532473
[2022-05-15 20:24:42] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5600494113181532473
Running compilation step : cd /tmp/ltsmin5600494113181532473;'/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'
Compilation finished in 1539 ms.
Running link step : cd /tmp/ltsmin5600494113181532473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5600494113181532473;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10806714977610117628.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-020-LTLCardinality-08 finished in 312030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 36 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:24:44] [INFO ] Invariants computation overflowed in 129 ms
[2022-05-15 20:24:44] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:24:44] [INFO ] Invariants computation overflowed in 135 ms
[2022-05-15 20:25:00] [INFO ] Implicit Places using invariants and state equation in 15636 ms returned []
Implicit Place search using SMT with State Equation took 16031 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:25:00] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 20:25:00] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 522 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s934 s727) (LEQ 2 s779)), p1:(LEQ s934 s727)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33266 reset in 575 ms.
Product exploration explored 100000 steps with 33297 reset in 559 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 323 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 155709 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155709 steps, saw 77868 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:25:06] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:25:09] [INFO ] After 3096ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 20:25:12] [INFO ] After 3012ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 20:25:13] [INFO ] Deduced a trap composed of 79 places in 211 ms of which 1 ms to minimize.
[2022-05-15 20:25:13] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 1 ms to minimize.
[2022-05-15 20:25:13] [INFO ] Deduced a trap composed of 201 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:25:13] [INFO ] Deduced a trap composed of 191 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:25:13] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 0 ms to minimize.
[2022-05-15 20:25:14] [INFO ] Deduced a trap composed of 149 places in 171 ms of which 1 ms to minimize.
[2022-05-15 20:25:14] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 0 ms to minimize.
[2022-05-15 20:25:14] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 0 ms to minimize.
[2022-05-15 20:25:14] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 0 ms to minimize.
[2022-05-15 20:25:15] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 0 ms to minimize.
[2022-05-15 20:25:15] [INFO ] Deduced a trap composed of 127 places in 188 ms of which 1 ms to minimize.
[2022-05-15 20:25:15] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 0 ms to minimize.
[2022-05-15 20:25:16] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 1 ms to minimize.
[2022-05-15 20:25:16] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 0 ms to minimize.
[2022-05-15 20:25:16] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 1 ms to minimize.
[2022-05-15 20:25:16] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:25:17] [INFO ] Deduced a trap composed of 91 places in 201 ms of which 1 ms to minimize.
[2022-05-15 20:25:17] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 0 ms to minimize.
[2022-05-15 20:25:17] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 1 ms to minimize.
[2022-05-15 20:25:18] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 1 ms to minimize.
[2022-05-15 20:25:18] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 1 ms to minimize.
[2022-05-15 20:25:18] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 0 ms to minimize.
[2022-05-15 20:25:19] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 0 ms to minimize.
[2022-05-15 20:25:19] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 0 ms to minimize.
[2022-05-15 20:25:20] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7442 ms
[2022-05-15 20:25:20] [INFO ] Deduced a trap composed of 186 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-05-15 20:25:21] [INFO ] After 11388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 3127 ms.
[2022-05-15 20:25:24] [INFO ] After 14702ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1002 place count 555 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 3 with 79 rules applied. Total rules applied 1081 place count 555 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1240 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1241 place count 475 transition count 453
Applied a total of 1241 rules in 96 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 243214 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243214 steps, saw 121666 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:25:31] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:25:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 20:25:32] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 20:25:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:25:33] [INFO ] After 950ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 20:25:33] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:25:33] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:25:33] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:25:33] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:25:33] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:25:34] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-05-15 20:25:35] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:25:36] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:25:36] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2724 ms
[2022-05-15 20:25:36] [INFO ] After 3837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 224 ms.
[2022-05-15 20:25:36] [INFO ] After 4651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:25:40] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:25:41] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:25:41] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:25:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:25:55] [INFO ] Implicit Places using invariants and state equation in 14796 ms returned [68, 146, 151, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 333, 338, 359, 365, 386, 388, 392, 412, 419, 441, 446, 450, 467, 473]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 15265 ms to find 30 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 445/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 445 transition count 440
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 432 transition count 440
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 432 transition count 440
Applied a total of 29 rules in 28 ms. Remains 432 /445 variables (removed 13) and now considering 440/453 (removed 13) transitions.
// Phase 1: matrix 440 rows 432 cols
[2022-05-15 20:25:55] [INFO ] Computed 69 place invariants in 67 ms
[2022-05-15 20:25:56] [INFO ] Implicit Places using invariants in 729 ms returned [42, 48, 72, 93, 98, 118, 124, 149]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 732 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 424/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 424 transition count 435
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 419 transition count 435
Applied a total of 10 rules in 16 ms. Remains 419 /424 variables (removed 5) and now considering 435/440 (removed 5) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:25:56] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:25:56] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:25:56] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:25:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:26:20] [INFO ] Implicit Places using invariants and state equation in 24053 ms returned []
Implicit Place search using SMT with State Equation took 24337 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 419/475 places, 435/453 transitions.
Finished structural reductions, in 3 iterations. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 246039 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 246039 steps, saw 123037 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:26:24] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:26:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 20:26:24] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 20:26:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:26:25] [INFO ] After 391ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 20:26:25] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:26:25] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:26:26] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:26:26] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 1 ms to minimize.
[2022-05-15 20:26:26] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:26:26] [INFO ] Deduced a trap composed of 115 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:27] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:26:27] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 1 ms to minimize.
[2022-05-15 20:26:27] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:26:27] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:26:27] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:26:28] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:28] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:26:28] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:26:28] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:26:28] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:26:29] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:26:29] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:29] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:30] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:26:30] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:26:30] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:26:31] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:26:31] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:26:31] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:26:32] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:26:32] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:32] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 0 ms to minimize.
[2022-05-15 20:26:32] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:26:33] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:33] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:33] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 0 ms to minimize.
[2022-05-15 20:26:33] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:26:33] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:34] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:26:34] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:34] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:26:34] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:26:35] [INFO ] Deduced a trap composed of 123 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:35] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:26:35] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:26:36] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:26:36] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:26:37] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2022-05-15 20:26:37] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:26:37] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:26:38] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 1 ms to minimize.
[2022-05-15 20:26:38] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:38] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:26:39] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 1 ms to minimize.
[2022-05-15 20:26:39] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2022-05-15 20:26:39] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:39] [INFO ] Deduced a trap composed of 126 places in 163 ms of which 0 ms to minimize.
[2022-05-15 20:26:40] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:26:40] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:26:41] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 0 ms to minimize.
[2022-05-15 20:26:41] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:26:42] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 1 ms to minimize.
[2022-05-15 20:26:42] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 1 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:26:43] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:26:44] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:26:45] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:26:46] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:26:46] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:26:47] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:26:48] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2022-05-15 20:26:48] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:26:48] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:26:48] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:26:49] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:26:49] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:26:49] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 23999 ms
[2022-05-15 20:26:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 20:26:49] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4001 ms.
Support contains 3 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:26:53] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:26:53] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:26:53] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:26:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:27:23] [INFO ] Implicit Places using invariants and state equation in 29541 ms returned []
Implicit Place search using SMT with State Equation took 29824 ms to find 0 implicit places.
[2022-05-15 20:27:23] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:27:23] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:27:23] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 379 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:27:24] [INFO ] Invariants computation overflowed in 112 ms
[2022-05-15 20:27:24] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:27:24] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 20:27:40] [INFO ] Implicit Places using invariants and state equation in 16278 ms returned []
Implicit Place search using SMT with State Equation took 16648 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:27:40] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:27:41] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 200783 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200783 steps, saw 100405 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:27:44] [INFO ] Invariants computation overflowed in 130 ms
[2022-05-15 20:27:48] [INFO ] After 3077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:27:51] [INFO ] After 2971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:27:51] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 0 ms to minimize.
[2022-05-15 20:27:51] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2022-05-15 20:27:52] [INFO ] Deduced a trap composed of 201 places in 172 ms of which 0 ms to minimize.
[2022-05-15 20:27:52] [INFO ] Deduced a trap composed of 191 places in 181 ms of which 18 ms to minimize.
[2022-05-15 20:27:52] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:27:52] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 0 ms to minimize.
[2022-05-15 20:27:52] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 1 ms to minimize.
[2022-05-15 20:27:53] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 1 ms to minimize.
[2022-05-15 20:27:53] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 0 ms to minimize.
[2022-05-15 20:27:53] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 0 ms to minimize.
[2022-05-15 20:27:53] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2022-05-15 20:27:54] [INFO ] Deduced a trap composed of 113 places in 191 ms of which 0 ms to minimize.
[2022-05-15 20:27:54] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 1 ms to minimize.
[2022-05-15 20:27:54] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 1 ms to minimize.
[2022-05-15 20:27:55] [INFO ] Deduced a trap composed of 103 places in 206 ms of which 1 ms to minimize.
[2022-05-15 20:27:55] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 0 ms to minimize.
[2022-05-15 20:27:55] [INFO ] Deduced a trap composed of 91 places in 205 ms of which 1 ms to minimize.
[2022-05-15 20:27:55] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 1 ms to minimize.
[2022-05-15 20:27:56] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 0 ms to minimize.
[2022-05-15 20:27:56] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 1 ms to minimize.
[2022-05-15 20:27:56] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 0 ms to minimize.
[2022-05-15 20:27:57] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 1 ms to minimize.
[2022-05-15 20:27:57] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 0 ms to minimize.
[2022-05-15 20:27:57] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 4 ms to minimize.
[2022-05-15 20:27:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7961 ms
[2022-05-15 20:27:59] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 0 ms to minimize.
[2022-05-15 20:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2022-05-15 20:27:59] [INFO ] After 11669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 293 ms.
[2022-05-15 20:28:00] [INFO ] After 12110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 479 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1002 place count 555 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 3 with 79 rules applied. Total rules applied 1081 place count 555 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1240 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1241 place count 475 transition count 453
Applied a total of 1241 rules in 88 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313004 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313004 steps, saw 156587 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:28:07] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:28:07] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:28:08] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:28:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:28:08] [INFO ] After 697ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:28:08] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:28:08] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-15 20:28:09] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:28:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2124 ms
[2022-05-15 20:28:11] [INFO ] After 2986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-15 20:28:11] [INFO ] After 3650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:28:15] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:28:15] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:28:15] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:28:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:28:30] [INFO ] Implicit Places using invariants and state equation in 14373 ms returned [68, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 333, 338, 359, 365, 386, 388, 392, 412, 419, 441, 446, 450, 467, 473]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 14842 ms to find 32 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 443/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 443 transition count 439
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 429 transition count 439
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 429 transition count 439
Applied a total of 31 rules in 27 ms. Remains 429 /443 variables (removed 14) and now considering 439/453 (removed 14) transitions.
// Phase 1: matrix 439 rows 429 cols
[2022-05-15 20:28:30] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:28:30] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2022-05-15 20:28:30] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:28:30] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:28:48] [INFO ] Implicit Places using invariants and state equation in 18508 ms returned []
Implicit Place search using SMT with State Equation took 18812 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 429/475 places, 439/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 429/475 places, 439/453 transitions.
Incomplete random walk after 10000 steps, including 1488 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 314938 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314938 steps, saw 157529 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 439 rows 429 cols
[2022-05-15 20:28:52] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 20:28:53] [INFO ] After 1283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:28:55] [INFO ] After 1871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:28:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:28:55] [INFO ] After 668ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:28:56] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:28:57] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:28:57] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:28:57] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2022-05-15 20:28:57] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:28:57] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:28:58] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:28:58] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:28:58] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2022-05-15 20:28:58] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:28:59] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:28:59] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:28:59] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:28:59] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3362 ms
[2022-05-15 20:28:59] [INFO ] After 4251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 163 ms.
[2022-05-15 20:28:59] [INFO ] After 6356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4001 ms.
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 429/429 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 429 /429 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 439/439 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 429/429 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 429 /429 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 429 cols
[2022-05-15 20:29:03] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:29:04] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2022-05-15 20:29:04] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:29:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:29:22] [INFO ] Implicit Places using invariants and state equation in 18387 ms returned [42, 93]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18702 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 427/429 places, 439/439 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 427 transition count 439
Applied a total of 2 rules in 20 ms. Remains 427 /427 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 427 cols
[2022-05-15 20:29:22] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 20:29:22] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 439 rows 427 cols
[2022-05-15 20:29:22] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:29:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:29:35] [INFO ] Implicit Places using invariants and state equation in 12597 ms returned []
Implicit Place search using SMT with State Equation took 12905 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 427/429 places, 439/439 transitions.
Finished structural reductions, in 2 iterations. Remains : 427/429 places, 439/439 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33426 reset in 582 ms.
Product exploration explored 100000 steps with 33342 reset in 594 ms.
Built C files in :
/tmp/ltsmin8333851337620231375
[2022-05-15 20:29:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8333851337620231375
Running compilation step : cd /tmp/ltsmin8333851337620231375;'/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'
Compilation finished in 1606 ms.
Running link step : cd /tmp/ltsmin8333851337620231375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8333851337620231375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2366191536527794378.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 36 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:29:52] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 20:29:52] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:29:52] [INFO ] Invariants computation overflowed in 133 ms
[2022-05-15 20:30:09] [INFO ] Implicit Places using invariants and state equation in 16575 ms returned []
Implicit Place search using SMT with State Equation took 16980 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:30:09] [INFO ] Invariants computation overflowed in 135 ms
[2022-05-15 20:30:09] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin3114582343349146058
[2022-05-15 20:30:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3114582343349146058
Running compilation step : cd /tmp/ltsmin3114582343349146058;'/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'
Compilation finished in 1589 ms.
Running link step : cd /tmp/ltsmin3114582343349146058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3114582343349146058;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13004029295565063681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:30:24] [INFO ] Flatten gal took : 25 ms
[2022-05-15 20:30:25] [INFO ] Flatten gal took : 25 ms
[2022-05-15 20:30:25] [INFO ] Time to serialize gal into /tmp/LTL16275173923422785811.gal : 3 ms
[2022-05-15 20:30:25] [INFO ] Time to serialize properties into /tmp/LTL1821821218554774475.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/LTL16275173923422785811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1821821218554774475.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/LTL1627517...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p888<=p700)&&(p748>=2))")U(X("(p888<=p700)"))))))
Formula 0 simplified : !FG("((p888<=p700)&&(p748>=2))" U X"(p888<=p700)")
Detected timeout of ITS tools.
[2022-05-15 20:30:40] [INFO ] Flatten gal took : 27 ms
[2022-05-15 20:30:40] [INFO ] Applying decomposition
[2022-05-15 20:30:40] [INFO ] Flatten gal took : 24 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/graph13206921068960244487.txt' '-o' '/tmp/graph13206921068960244487.bin' '-w' '/tmp/graph13206921068960244487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13206921068960244487.bin' '-l' '-1' '-v' '-w' '/tmp/graph13206921068960244487.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:30:40] [INFO ] Decomposing Gal with order
[2022-05-15 20:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:30:40] [INFO ] Removed a total of 271 redundant transitions.
[2022-05-15 20:30:40] [INFO ] Flatten gal took : 49 ms
[2022-05-15 20:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 15 ms.
[2022-05-15 20:30:40] [INFO ] Time to serialize gal into /tmp/LTL1504439280696570212.gal : 7 ms
[2022-05-15 20:30:40] [INFO ] Time to serialize properties into /tmp/LTL16094666237799317963.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/LTL1504439280696570212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16094666237799317963.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/LTL1504439...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((gu401.p888<=gu401.p700)&&(gi1.gi1.gi3.gi5.gu334.p748>=2))")U(X("(gu401.p888<=gu401.p700)"))))))
Formula 0 simplified : !FG("((gu401.p888<=gu401.p700)&&(gi1.gi1.gi3.gi5.gu334.p748>=2))" U X"(gu401.p888<=gu401.p700)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10020316238799644590
[2022-05-15 20:30:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10020316238799644590
Running compilation step : cd /tmp/ltsmin10020316238799644590;'/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'
Compilation finished in 1580 ms.
Running link step : cd /tmp/ltsmin10020316238799644590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10020316238799644590;'/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' '<>([](((LTLAPp0==true) U X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 386475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:10] [INFO ] Invariants computation overflowed in 114 ms
[2022-05-15 20:31:11] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:11] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:31:26] [INFO ] Implicit Places using invariants and state equation in 15913 ms returned []
Implicit Place search using SMT with State Equation took 16313 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:27] [INFO ] Invariants computation overflowed in 126 ms
[2022-05-15 20:31:27] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s883 s353)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-13 finished in 16969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 753
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 485 place count 813 transition count 714
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 929 place count 591 transition count 531
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1003 place count 554 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1004 place count 553 transition count 530
Applied a total of 1004 rules in 70 ms. Remains 553 /1057 variables (removed 504) and now considering 530/997 (removed 467) transitions.
// Phase 1: matrix 530 rows 553 cols
[2022-05-15 20:31:27] [INFO ] Computed 99 place invariants in 59 ms
[2022-05-15 20:31:27] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 530 rows 553 cols
[2022-05-15 20:31:28] [INFO ] Computed 99 place invariants in 57 ms
[2022-05-15 20:31:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:31:41] [INFO ] Implicit Places using invariants and state equation in 13407 ms returned []
Implicit Place search using SMT with State Equation took 13720 ms to find 0 implicit places.
[2022-05-15 20:31:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 530 rows 553 cols
[2022-05-15 20:31:41] [INFO ] Computed 99 place invariants in 50 ms
[2022-05-15 20:31:41] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 530/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 553/1057 places, 530/997 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s359)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-14 finished in 14158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(p1)||p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 29 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:41] [INFO ] Invariants computation overflowed in 121 ms
[2022-05-15 20:31:42] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:42] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 20:31:56] [INFO ] Implicit Places using invariants and state equation in 14397 ms returned []
Implicit Place search using SMT with State Equation took 14784 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:31:56] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:31:56] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s757 s8), p2:(LEQ 1 s1013), p1:(LEQ s514 s686)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33418 reset in 610 ms.
Product exploration explored 100000 steps with 33275 reset in 604 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 821 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 331 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 131454 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131454 steps, saw 65742 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:32:04] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 20:32:04] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 20:32:08] [INFO ] After 3761ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-15 20:32:08] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 1 ms to minimize.
[2022-05-15 20:32:09] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 1 ms to minimize.
[2022-05-15 20:32:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 0 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 1 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 101 places in 201 ms of which 0 ms to minimize.
[2022-05-15 20:32:10] [INFO ] Deduced a trap composed of 103 places in 205 ms of which 0 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 91 places in 221 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 1 ms to minimize.
[2022-05-15 20:32:11] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 1 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Deduced a trap composed of 127 places in 194 ms of which 1 ms to minimize.
[2022-05-15 20:32:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2298 ms
[2022-05-15 20:32:14] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 1 ms to minimize.
[2022-05-15 20:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2022-05-15 20:32:14] [INFO ] After 9371ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 2316 ms.
[2022-05-15 20:32:16] [INFO ] After 12061ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8002 ms.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1055 transition count 760
Reduce places removed 235 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 820 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 818 transition count 758
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 476 place count 818 transition count 717
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 558 place count 777 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 920 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 994 place count 559 transition count 536
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 3 with 81 rules applied. Total rules applied 1075 place count 559 transition count 455
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 1156 place count 478 transition count 455
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 4 with 78 rules applied. Total rules applied 1234 place count 478 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1235 place count 477 transition count 454
Applied a total of 1235 rules in 89 ms. Remains 477 /1057 variables (removed 580) and now considering 454/997 (removed 543) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1322 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 187255 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187255 steps, saw 93649 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:32:28] [INFO ] Computed 99 place invariants in 44 ms
[2022-05-15 20:32:28] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:32:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:32:28] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 51 ms returned sat
[2022-05-15 20:32:29] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 20:32:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:32:30] [INFO ] After 1596ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 20:32:31] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-15 20:32:31] [INFO ] After 2267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 375 ms.
[2022-05-15 20:32:31] [INFO ] After 3239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6004 ms.
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:32:37] [INFO ] Computed 99 place invariants in 51 ms
[2022-05-15 20:32:39] [INFO ] Implicit Places using invariants in 1438 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 232, 255, 261, 283, 288, 309, 314, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1440 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 24 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:32:39] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:32:39] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:32:39] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:32:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:33:00] [INFO ] Implicit Places using invariants and state equation in 21072 ms returned []
Implicit Place search using SMT with State Equation took 21336 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 421/477 places, 436/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 421/477 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 193078 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193078 steps, saw 96557 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:33:04] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:33:04] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:33:05] [INFO ] After 1005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 20:33:05] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:33:07] [INFO ] After 1138ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 20:33:07] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2022-05-15 20:33:07] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:33:07] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:33:07] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:33:07] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 0 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 139 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:33:08] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:33:09] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:33:10] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:33:11] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-05-15 20:33:11] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:33:11] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 1 ms to minimize.
[2022-05-15 20:33:11] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4754 ms
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:33:12] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2022-05-15 20:33:13] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2022-05-15 20:33:13] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2022-05-15 20:33:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 885 ms
[2022-05-15 20:33:13] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-15 20:33:14] [INFO ] After 8484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 578 ms.
[2022-05-15 20:33:14] [INFO ] After 10191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 12000 ms.
Support contains 5 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:33:27] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:33:27] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:33:27] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:33:27] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:33:48] [INFO ] Implicit Places using invariants and state equation in 20967 ms returned []
Implicit Place search using SMT with State Equation took 21229 ms to find 0 implicit places.
[2022-05-15 20:33:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:33:48] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:33:48] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 905 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 45 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:33:49] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 20:33:50] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:33:50] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 20:34:05] [INFO ] Implicit Places using invariants and state equation in 14891 ms returned []
Implicit Place search using SMT with State Equation took 15289 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:34:05] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 20:34:05] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 576 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 153882 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153882 steps, saw 76958 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:34:10] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 20:34:10] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:34:16] [INFO ] After 5912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:34:16] [INFO ] Deduced a trap composed of 79 places in 217 ms of which 0 ms to minimize.
[2022-05-15 20:34:17] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 0 ms to minimize.
[2022-05-15 20:34:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
[2022-05-15 20:34:17] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 1 ms to minimize.
[2022-05-15 20:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2022-05-15 20:34:18] [INFO ] After 7865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1293 ms.
[2022-05-15 20:34:19] [INFO ] After 9437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7980 ms.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1055 transition count 760
Reduce places removed 235 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 820 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 818 transition count 758
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 476 place count 818 transition count 717
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 558 place count 777 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 920 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 994 place count 559 transition count 536
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 3 with 81 rules applied. Total rules applied 1075 place count 559 transition count 455
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 1156 place count 478 transition count 455
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 4 with 78 rules applied. Total rules applied 1234 place count 478 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1235 place count 477 transition count 454
Applied a total of 1235 rules in 89 ms. Remains 477 /1057 variables (removed 580) and now considering 454/997 (removed 543) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 191509 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191509 steps, saw 95812 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:34:31] [INFO ] Computed 99 place invariants in 45 ms
[2022-05-15 20:34:31] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:34:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:34:31] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 51 ms returned sat
[2022-05-15 20:34:32] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:34:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:34:33] [INFO ] After 940ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:34:33] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-15 20:34:34] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:34:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2287 ms
[2022-05-15 20:34:36] [INFO ] After 4642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 563 ms.
[2022-05-15 20:34:37] [INFO ] After 5854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10001 ms.
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:34:47] [INFO ] Computed 99 place invariants in 50 ms
[2022-05-15 20:34:48] [INFO ] Implicit Places using invariants in 1367 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 232, 255, 261, 283, 288, 309, 314, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1370 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 23 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:34:48] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:34:49] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:34:49] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:34:49] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:35:05] [INFO ] Implicit Places using invariants and state equation in 15834 ms returned []
Implicit Place search using SMT with State Equation took 16097 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 421/477 places, 436/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 421/477 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 194476 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194476 steps, saw 97256 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:35:08] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:35:08] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:35:09] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:35:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:35:11] [INFO ] After 1146ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 1 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 0 ms to minimize.
[2022-05-15 20:35:11] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 1 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1172 ms
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2022-05-15 20:35:12] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2022-05-15 20:35:13] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 0 ms to minimize.
[2022-05-15 20:35:13] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 1 ms to minimize.
[2022-05-15 20:35:13] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 1 ms to minimize.
[2022-05-15 20:35:13] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:35:13] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:35:14] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:35:14] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 0 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 151 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 1 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:35:15] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 0 ms to minimize.
[2022-05-15 20:35:16] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:35:16] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-15 20:35:16] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:35:16] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:35:17] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 1 ms to minimize.
[2022-05-15 20:35:18] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 1 ms to minimize.
[2022-05-15 20:35:18] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:35:18] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2022-05-15 20:35:19] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:35:19] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:35:19] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:35:20] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:35:20] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 1 ms to minimize.
[2022-05-15 20:35:20] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-15 20:35:20] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2022-05-15 20:35:21] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2022-05-15 20:35:21] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 1 ms to minimize.
[2022-05-15 20:35:21] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:35:21] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:35:21] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9242 ms
[2022-05-15 20:35:22] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:35:22] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:35:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2022-05-15 20:35:23] [INFO ] After 13744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1500 ms.
[2022-05-15 20:35:25] [INFO ] After 16243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10000 ms.
Support contains 5 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:35:35] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:35:35] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:35:35] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:35:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:35:55] [INFO ] Implicit Places using invariants and state equation in 20275 ms returned []
Implicit Place search using SMT with State Equation took 20568 ms to find 0 implicit places.
[2022-05-15 20:35:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:35:55] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:35:55] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 624 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 33401 reset in 606 ms.
Product exploration explored 100000 steps with 33304 reset in 601 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 234 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 235 place count 1056 transition count 1034
Deduced a syphon composed of 276 places in 9 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 277 place count 1056 transition count 1034
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 281 place count 1052 transition count 1030
Deduced a syphon composed of 272 places in 9 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 285 place count 1052 transition count 1030
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 453 places in 5 ms
Iterating global reduction 1 with 181 rules applied. Total rules applied 466 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 467 place count 1051 transition count 1070
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 468 place count 1051 transition count 1070
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -246
Deduced a syphon composed of 491 places in 6 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 507 place count 1051 transition count 1316
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 547 place count 1011 transition count 1236
Deduced a syphon composed of 451 places in 5 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 587 place count 1011 transition count 1236
Deduced a syphon composed of 451 places in 5 ms
Applied a total of 587 rules in 186 ms. Remains 1011 /1057 variables (removed 46) and now considering 1236/997 (removed -239) transitions.
[2022-05-15 20:35:58] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1236 rows 1011 cols
[2022-05-15 20:35:58] [INFO ] Invariants computation overflowed in 127 ms
[2022-05-15 20:35:59] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/1057 places, 1236/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1057 places, 1236/997 transitions.
Product exploration explored 100000 steps with 33407 reset in 618 ms.
Product exploration explored 100000 steps with 33287 reset in 601 ms.
Built C files in :
/tmp/ltsmin11820471390874149448
[2022-05-15 20:36:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820471390874149448
Running compilation step : cd /tmp/ltsmin11820471390874149448;'/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'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin11820471390874149448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11820471390874149448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17192225549105106819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:36:15] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 20:36:15] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:36:16] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 20:36:31] [INFO ] Implicit Places using invariants and state equation in 15963 ms returned []
Implicit Place search using SMT with State Equation took 16349 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2022-05-15 20:36:32] [INFO ] Invariants computation overflowed in 122 ms
[2022-05-15 20:36:32] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin11015633887150044648
[2022-05-15 20:36:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11015633887150044648
Running compilation step : cd /tmp/ltsmin11015633887150044648;'/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'
Compilation finished in 1622 ms.
Running link step : cd /tmp/ltsmin11015633887150044648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11015633887150044648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15389214208557840417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:36:47] [INFO ] Flatten gal took : 25 ms
[2022-05-15 20:36:47] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:36:47] [INFO ] Time to serialize gal into /tmp/LTL9579352452823898474.gal : 3 ms
[2022-05-15 20:36:47] [INFO ] Time to serialize properties into /tmp/LTL886199760268454553.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/LTL9579352452823898474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL886199760268454553.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/LTL9579352...265
Read 1 LTL properties
Checking formula 0 : !((("(p728<=p1005)")U(G((X("(p509<=p664)"))||("(p959>=1)")))))
Formula 0 simplified : !("(p728<=p1005)" U G("(p959>=1)" | X"(p509<=p664)"))
Detected timeout of ITS tools.
[2022-05-15 20:37:02] [INFO ] Flatten gal took : 24 ms
[2022-05-15 20:37:02] [INFO ] Applying decomposition
[2022-05-15 20:37:02] [INFO ] Flatten gal took : 24 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/graph4093880552346573243.txt' '-o' '/tmp/graph4093880552346573243.bin' '-w' '/tmp/graph4093880552346573243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4093880552346573243.bin' '-l' '-1' '-v' '-w' '/tmp/graph4093880552346573243.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:37:02] [INFO ] Decomposing Gal with order
[2022-05-15 20:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:37:02] [INFO ] Removed a total of 285 redundant transitions.
[2022-05-15 20:37:02] [INFO ] Flatten gal took : 48 ms
[2022-05-15 20:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 24 ms.
[2022-05-15 20:37:03] [INFO ] Time to serialize gal into /tmp/LTL17080732881010354878.gal : 7 ms
[2022-05-15 20:37:03] [INFO ] Time to serialize properties into /tmp/LTL10007207014705721402.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/LTL17080732881010354878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10007207014705721402.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/LTL1708073...268
Read 1 LTL properties
Checking formula 0 : !((("(gu4.p728<=gu4.p1005)")U(G((X("(gu300.p509<=gu300.p664)"))||("(gi3.gi1.gi3.gi2.gu443.p959>=1)")))))
Formula 0 simplified : !("(gu4.p728<=gu4.p1005)" U G("(gi3.gi1.gi3.gi2.gu443.p959>=1)" | X"(gu300.p509<=gu300.p664)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin961492390558389523
[2022-05-15 20:37:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin961492390558389523
Running compilation step : cd /tmp/ltsmin961492390558389523;'/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'
Compilation finished in 1596 ms.
Running link step : cd /tmp/ltsmin961492390558389523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin961492390558389523;'/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' '((LTLAPp0==true) U []((X((LTLAPp1==true))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-15 finished in 351472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : DoubleExponent-PT-020-LTLCardinality-03
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 816 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 483 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 483 place count 814 transition count 714
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 80 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:37:33] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:37:33] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:37:33] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 20:37:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:37:45] [INFO ] Implicit Places using invariants and state equation in 11402 ms returned []
Implicit Place search using SMT with State Equation took 11661 ms to find 0 implicit places.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:37:45] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 20:37:45] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/1057 places, 532/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s27 s160)], 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][false, false, false]]
Product exploration explored 100000 steps with 13847 reset in 100 ms.
Product exploration explored 100000 steps with 13819 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1365 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 378065 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 378065 steps, saw 189091 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:37:49] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:37:49] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:37:50] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:37:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:37:52] [INFO ] After 2369ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:37:52] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:37:52] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-15 20:37:52] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:37:52] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:37:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1335 ms
[2022-05-15 20:37:53] [INFO ] After 3758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-15 20:37:53] [INFO ] After 4783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1664 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 237 place count 475 transition count 453
Applied a total of 237 rules in 35 ms. Remains 475 /554 variables (removed 79) and now considering 453/532 (removed 79) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/554 places, 453/532 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423037 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 423037 steps, saw 211639 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:37:59] [INFO ] Computed 99 place invariants in 59 ms
[2022-05-15 20:37:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:37:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:37:59] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 39 ms returned sat
[2022-05-15 20:37:59] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:37:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:38:00] [INFO ] After 1503ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
[2022-05-15 20:38:01] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2022-05-15 20:38:02] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:38:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2512 ms
[2022-05-15 20:38:03] [INFO ] After 4498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 416 ms.
[2022-05-15 20:38:04] [INFO ] After 5288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:38:06] [INFO ] Computed 99 place invariants in 60 ms
[2022-05-15 20:38:07] [INFO ] Implicit Places using invariants in 1444 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 147, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1445 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 16 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:07] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:38:08] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:08] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:38:08] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:38:19] [INFO ] Implicit Places using invariants and state equation in 11432 ms returned []
Implicit Place search using SMT with State Equation took 11713 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437843 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437843 steps, saw 218971 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:22] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:38:22] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:38:23] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:38:23] [INFO ] After 766ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:24] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-15 20:38:24] [INFO ] After 1655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:26] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:38:26] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:26] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:38:26] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:38:45] [INFO ] Implicit Places using invariants and state equation in 18498 ms returned []
Implicit Place search using SMT with State Equation took 18770 ms to find 0 implicit places.
[2022-05-15 20:38:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:38:45] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:38:45] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 418 transition count 396
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 380 transition count 396
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 362 transition count 378
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 25 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2022-05-15 20:38:45] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:38:45] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:38:45] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:38:45] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:46] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:38:46] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:38:46] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:38:46] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:38:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:38:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 512 ms
[2022-05-15 20:38:46] [INFO ] After 790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-15 20:38:46] [INFO ] After 1204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:38:46] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:38:46] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:38:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17346745156617749411.gal : 4 ms
[2022-05-15 20:38:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6597876783517031197.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18203963565508807875;'/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/ReachabilityCardinality17346745156617749411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6597876783517031197.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/ReachabilityCardinality6597876783517031197.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 315
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :315 after 1112
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1112 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 12558
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12558 after 30030
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30030 after 70339
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70339 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 443235
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :443235 after 1.04192e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04192e+06 after 2.40926e+06
Detected timeout of ITS tools.
[2022-05-15 20:39:01] [INFO ] Flatten gal took : 21 ms
[2022-05-15 20:39:01] [INFO ] Applying decomposition
[2022-05-15 20:39:01] [INFO ] Flatten gal took : 21 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/graph2088612726793036445.txt' '-o' '/tmp/graph2088612726793036445.bin' '-w' '/tmp/graph2088612726793036445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2088612726793036445.bin' '-l' '-1' '-v' '-w' '/tmp/graph2088612726793036445.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:39:01] [INFO ] Decomposing Gal with order
[2022-05-15 20:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:39:01] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-15 20:39:01] [INFO ] Flatten gal took : 38 ms
[2022-05-15 20:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 3 ms.
[2022-05-15 20:39:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17634958180788440497.gal : 3 ms
[2022-05-15 20:39:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10802815110628126067.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms18203963565508807875;'/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/ReachabilityCardinality17634958180788440497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10802815110628126067.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/ReachabilityCardinality10802815110628126067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 178
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :178 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 1061
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1061 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 14313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14313 after 35657
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35657 after 94151
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :94151 after 262624
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :262624 after 739447
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :739447 after 2.12793e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1647354326429462831
[2022-05-15 20:39:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1647354326429462831
Running compilation step : cd /tmp/ltsmin1647354326429462831;'/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'
Compilation finished in 816 ms.
Running link step : cd /tmp/ltsmin1647354326429462831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1647354326429462831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 10 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:39:32] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 20:39:32] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:39:32] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:39:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:39:49] [INFO ] Implicit Places using invariants and state equation in 17174 ms returned []
Implicit Place search using SMT with State Equation took 17451 ms to find 0 implicit places.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:39:49] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:39:50] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1381 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384104 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 384104 steps, saw 192103 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:39:53] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:39:53] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:39:54] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:39:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:39:56] [INFO ] After 2374ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:39:56] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:39:57] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:39:58] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2022-05-15 20:39:58] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 0 ms to minimize.
[2022-05-15 20:39:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1413 ms
[2022-05-15 20:39:58] [INFO ] After 3854ms 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-15 20:39:58] [INFO ] After 4881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1664 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 237 place count 475 transition count 453
Applied a total of 237 rules in 30 ms. Remains 475 /554 variables (removed 79) and now considering 453/532 (removed 79) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/554 places, 453/532 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 421332 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 421332 steps, saw 210791 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:40:03] [INFO ] Computed 99 place invariants in 62 ms
[2022-05-15 20:40:03] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:40:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 20:40:03] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 41 ms returned sat
[2022-05-15 20:40:03] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:03] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:40:05] [INFO ] After 1511ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:05] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:40:06] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:40:07] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:40:08] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:40:08] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:40:08] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-15 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2499 ms
[2022-05-15 20:40:08] [INFO ] After 4485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 428 ms.
[2022-05-15 20:40:08] [INFO ] After 5294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 16 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:40:10] [INFO ] Computed 99 place invariants in 58 ms
[2022-05-15 20:40:12] [INFO ] Implicit Places using invariants in 1451 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 147, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1452 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 434
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 434
Applied a total of 38 rules in 16 ms. Remains 418 /437 variables (removed 19) and now considering 434/453 (removed 19) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:12] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:40:12] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:12] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:40:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:40:24] [INFO ] Implicit Places using invariants and state equation in 11556 ms returned []
Implicit Place search using SMT with State Equation took 11919 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/475 places, 434/453 transitions.
Finished structural reductions, in 2 iterations. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 441709 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 441709 steps, saw 220903 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:27] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:40:27] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:40:27] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:27] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:40:28] [INFO ] After 734ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:28] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2022-05-15 20:40:28] [INFO ] After 1575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:30] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-15 20:40:31] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:31] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:40:31] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:40:40] [INFO ] Implicit Places using invariants and state equation in 9277 ms returned []
Implicit Place search using SMT with State Equation took 9548 ms to find 0 implicit places.
[2022-05-15 20:40:40] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2022-05-15 20:40:40] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-15 20:40:40] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 434/434 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 418 transition count 396
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 380 transition count 396
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 362 transition count 378
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 362 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 361 transition count 377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 361 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 375
Applied a total of 118 rules in 32 ms. Remains 359 /418 variables (removed 59) and now considering 375/434 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 359 cols
[2022-05-15 20:40:40] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:40:40] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:40:41] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 20:40:41] [INFO ] After 173ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-05-15 20:40:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 509 ms
[2022-05-15 20:40:41] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-15 20:40:41] [INFO ] After 1193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:40:42] [INFO ] Flatten gal took : 23 ms
[2022-05-15 20:40:42] [INFO ] Flatten gal took : 21 ms
[2022-05-15 20:40:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14839359749956624498.gal : 2 ms
[2022-05-15 20:40:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15587666608696028268.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8914845415655761334;'/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/ReachabilityCardinality14839359749956624498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15587666608696028268.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/ReachabilityCardinality15587666608696028268.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 315
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :315 after 1112
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1112 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 12558
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12558 after 30030
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30030 after 70339
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70339 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 443235
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :443235 after 1.04192e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04192e+06 after 2.40926e+06
Detected timeout of ITS tools.
[2022-05-15 20:40:57] [INFO ] Flatten gal took : 22 ms
[2022-05-15 20:40:57] [INFO ] Applying decomposition
[2022-05-15 20:40:57] [INFO ] Flatten gal took : 22 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/graph11881807884312231598.txt' '-o' '/tmp/graph11881807884312231598.bin' '-w' '/tmp/graph11881807884312231598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11881807884312231598.bin' '-l' '-1' '-v' '-w' '/tmp/graph11881807884312231598.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:40:57] [INFO ] Decomposing Gal with order
[2022-05-15 20:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:40:57] [INFO ] Removed a total of 228 redundant transitions.
[2022-05-15 20:40:57] [INFO ] Flatten gal took : 36 ms
[2022-05-15 20:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 4 ms.
[2022-05-15 20:40:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3102784763751575437.gal : 3 ms
[2022-05-15 20:40:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12167119349067818155.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8914845415655761334;'/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/ReachabilityCardinality3102784763751575437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12167119349067818155.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/ReachabilityCardinality12167119349067818155.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 882
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :882 after 2978
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2978 after 10807
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10807 after 29713
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29713 after 75811
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :75811 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 500993
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :500993 after 1.3824e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2261740607922043343
[2022-05-15 20:41:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2261740607922043343
Running compilation step : cd /tmp/ltsmin2261740607922043343;'/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'
Compilation finished in 772 ms.
Running link step : cd /tmp/ltsmin2261740607922043343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2261740607922043343;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13824 reset in 110 ms.
Product exploration explored 100000 steps with 13923 reset in 118 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 10 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2022-05-15 20:41:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:41:28] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 20:41:28] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Product exploration explored 100000 steps with 13943 reset in 566 ms.
Product exploration explored 100000 steps with 13786 reset in 569 ms.
Built C files in :
/tmp/ltsmin11582022767726166114
[2022-05-15 20:41:29] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11582022767726166114
Running compilation step : cd /tmp/ltsmin11582022767726166114;'/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'
Compilation finished in 841 ms.
Running link step : cd /tmp/ltsmin11582022767726166114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11582022767726166114;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7445567738996732318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 14 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:41:44] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 20:41:45] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:41:45] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:41:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:42:00] [INFO ] Implicit Places using invariants and state equation in 15359 ms returned []
Implicit Place search using SMT with State Equation took 15633 ms to find 0 implicit places.
// Phase 1: matrix 532 rows 554 cols
[2022-05-15 20:42:00] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 20:42:00] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 532/532 transitions.
Built C files in :
/tmp/ltsmin14602953191964325086
[2022-05-15 20:42:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14602953191964325086
Running compilation step : cd /tmp/ltsmin14602953191964325086;'/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'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin14602953191964325086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14602953191964325086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1621038006911810115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:42:15] [INFO ] Flatten gal took : 17 ms
[2022-05-15 20:42:15] [INFO ] Flatten gal took : 17 ms
[2022-05-15 20:42:15] [INFO ] Time to serialize gal into /tmp/LTL17139742620726511710.gal : 2 ms
[2022-05-15 20:42:15] [INFO ] Time to serialize properties into /tmp/LTL1913457694246375591.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/LTL17139742620726511710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1913457694246375591.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/LTL1713974...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(p1055<=p325)"))))
Formula 0 simplified : !XG"(p1055<=p325)"
Detected timeout of ITS tools.
[2022-05-15 20:42:30] [INFO ] Flatten gal took : 19 ms
[2022-05-15 20:42:30] [INFO ] Applying decomposition
[2022-05-15 20:42:30] [INFO ] Flatten gal took : 16 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/graph6703000609786505736.txt' '-o' '/tmp/graph6703000609786505736.bin' '-w' '/tmp/graph6703000609786505736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6703000609786505736.bin' '-l' '-1' '-v' '-w' '/tmp/graph6703000609786505736.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:42:30] [INFO ] Decomposing Gal with order
[2022-05-15 20:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:42:30] [INFO ] Removed a total of 404 redundant transitions.
[2022-05-15 20:42:30] [INFO ] Flatten gal took : 31 ms
[2022-05-15 20:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2022-05-15 20:42:31] [INFO ] Time to serialize gal into /tmp/LTL2763435303446184918.gal : 4 ms
[2022-05-15 20:42:31] [INFO ] Time to serialize properties into /tmp/LTL8084549567697364318.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/LTL2763435303446184918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8084549567697364318.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/LTL2763435...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu53.p1055<=gu53.p325)"))))
Formula 0 simplified : !XG"(gu53.p1055<=gu53.p325)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6457212661029015868
[2022-05-15 20:42:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6457212661029015868
Running compilation step : cd /tmp/ltsmin6457212661029015868;'/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'
Compilation finished in 851 ms.
Running link step : cd /tmp/ltsmin6457212661029015868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6457212661029015868;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-03 finished in 327908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Found a SL insensitive property : DoubleExponent-PT-020-LTLCardinality-09
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 757
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 817 transition count 756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 479 place count 816 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 559 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 999 place count 556 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 555 transition count 533
Applied a total of 1000 rules in 75 ms. Remains 555 /1057 variables (removed 502) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:43:01] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:43:01] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:43:01] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:43:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:43:13] [INFO ] Implicit Places using invariants and state equation in 12065 ms returned []
Implicit Place search using SMT with State Equation took 12318 ms to find 0 implicit places.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:43:13] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:43:13] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 555/1057 places, 533/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 555/1057 places, 533/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s487 s379) (LEQ 2 s405)), p1:(LEQ s487 s379)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34094 reset in 348 ms.
Product exploration explored 100000 steps with 34042 reset in 364 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1735 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 807 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 195256 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195256 steps, saw 97661 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:43:18] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:43:19] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 20:43:20] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 20:43:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:43:21] [INFO ] After 1817ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:43:22] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:43:23] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:43:24] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 0 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 1 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:43:25] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3864 ms
[2022-05-15 20:43:26] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:43:26] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:43:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2022-05-15 20:43:26] [INFO ] After 6506ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 690 ms.
[2022-05-15 20:43:27] [INFO ] After 8045ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 3 out of 555 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1655 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 554 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 554 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 33 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 243121 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243121 steps, saw 121622 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:43:36] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:43:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 20:43:37] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 20:43:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:43:38] [INFO ] After 1525ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 20:43:38] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:43:38] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:43:39] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:43:40] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:43:40] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:43:40] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:43:40] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:43:40] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2022-05-15 20:43:41] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2022-05-15 20:43:41] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:43:41] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:43:41] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:43:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3022 ms
[2022-05-15 20:43:41] [INFO ] After 4745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 217 ms.
[2022-05-15 20:43:42] [INFO ] After 5472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6001 ms.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:43:48] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:43:48] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:43:48] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:43:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:44:09] [INFO ] Implicit Places using invariants and state equation in 20484 ms returned [68, 94, 225, 230, 259, 281, 286, 306, 311, 333, 338, 359, 365, 386, 388, 392, 412, 419, 441, 446, 450, 467, 473]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 20963 ms to find 23 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 452/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 452 transition count 444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 443 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 443 transition count 444
Applied a total of 22 rules in 26 ms. Remains 443 /452 variables (removed 9) and now considering 444/453 (removed 9) transitions.
// Phase 1: matrix 444 rows 443 cols
[2022-05-15 20:44:09] [INFO ] Computed 76 place invariants in 62 ms
[2022-05-15 20:44:10] [INFO ] Implicit Places using invariants in 931 ms returned [42, 48, 72, 97, 117, 123, 144, 149, 150, 170, 175, 196, 202, 209, 248]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 933 ms to find 15 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 428/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 435
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 435
Applied a total of 18 rules in 18 ms. Remains 419 /428 variables (removed 9) and now considering 435/444 (removed 9) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:44:10] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:44:10] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:44:10] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:44:10] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:44:28] [INFO ] Implicit Places using invariants and state equation in 18393 ms returned []
Implicit Place search using SMT with State Equation took 18678 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 419/475 places, 435/453 transitions.
Finished structural reductions, in 3 iterations. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 245809 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245809 steps, saw 122921 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:44:32] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-15 20:44:32] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 20:44:32] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 20:44:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:44:33] [INFO ] After 390ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:44:33] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1434 ms
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-05-15 20:44:34] [INFO ] After 2245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-15 20:44:35] [INFO ] After 2890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 3 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 20 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:44:41] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:44:41] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:44:41] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:44:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:45:09] [INFO ] Implicit Places using invariants and state equation in 28097 ms returned []
Implicit Place search using SMT with State Equation took 28367 ms to find 0 implicit places.
[2022-05-15 20:45:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:45:09] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 20:45:09] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 338 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 5 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:45:10] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:45:10] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:45:10] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 20:45:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:45:29] [INFO ] Implicit Places using invariants and state equation in 18973 ms returned []
Implicit Place search using SMT with State Equation took 19243 ms to find 0 implicit places.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:45:29] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:45:29] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 555/555 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1735 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249558 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249558 steps, saw 124808 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:45:33] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 20:45:33] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:45:34] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:45:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:45:36] [INFO ] After 1609ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2022-05-15 20:45:36] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:45:37] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:45:38] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3173 ms
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-15 20:45:39] [INFO ] After 5164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 431 ms.
[2022-05-15 20:45:40] [INFO ] After 6390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4001 ms.
Support contains 3 out of 555 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1655 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 554 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 554 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 30 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 301797 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301797 steps, saw 150987 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:45:47] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 20:45:47] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:45:47] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:45:47] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:45:49] [INFO ] After 1329ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:45:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2022-05-15 20:45:49] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:45:50] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:45:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 540 ms
[2022-05-15 20:45:50] [INFO ] After 2276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-15 20:45:50] [INFO ] After 2844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:45:54] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 20:45:54] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2022-05-15 20:45:54] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:45:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:46:21] [INFO ] Implicit Places using invariants and state equation in 27025 ms returned [68, 119, 172, 225, 333, 338, 365, 386, 388, 392, 412, 419, 441, 446, 450, 467, 473]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 27523 ms to find 17 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 458/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 458 transition count 448
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 453 transition count 448
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 453 transition count 448
Applied a total of 16 rules in 26 ms. Remains 453 /458 variables (removed 5) and now considering 448/453 (removed 5) transitions.
// Phase 1: matrix 448 rows 453 cols
[2022-05-15 20:46:21] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 20:46:22] [INFO ] Implicit Places using invariants in 417 ms returned []
// Phase 1: matrix 448 rows 453 cols
[2022-05-15 20:46:22] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 20:46:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:46:39] [INFO ] Implicit Places using invariants and state equation in 17619 ms returned [249, 255, 277, 282, 302, 307, 352]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 18037 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 446/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 446 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 442 transition count 444
Applied a total of 8 rules in 17 ms. Remains 442 /446 variables (removed 4) and now considering 444/448 (removed 4) transitions.
// Phase 1: matrix 444 rows 442 cols
[2022-05-15 20:46:40] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-15 20:46:40] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 444 rows 442 cols
[2022-05-15 20:46:40] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 20:46:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:46:53] [INFO ] Implicit Places using invariants and state equation in 13484 ms returned [123, 144, 149, 150, 174, 195, 201, 208, 226]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 13880 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 433/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 433 transition count 438
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 427 transition count 438
Applied a total of 12 rules in 16 ms. Remains 427 /433 variables (removed 6) and now considering 438/444 (removed 6) transitions.
// Phase 1: matrix 438 rows 427 cols
[2022-05-15 20:46:53] [INFO ] Computed 66 place invariants in 66 ms
[2022-05-15 20:46:54] [INFO ] Implicit Places using invariants in 573 ms returned [42, 48, 72, 93, 98]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 577 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 4 : 422/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 422 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 419 transition count 435
Applied a total of 6 rules in 18 ms. Remains 419 /422 variables (removed 3) and now considering 435/438 (removed 3) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:46:54] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:46:54] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:46:54] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-15 20:46:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:47:09] [INFO ] Implicit Places using invariants and state equation in 14957 ms returned []
Implicit Place search using SMT with State Equation took 15226 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 5 : 419/475 places, 435/453 transitions.
Finished structural reductions, in 5 iterations. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 272664 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272664 steps, saw 136358 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:47:12] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-15 20:47:12] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:47:13] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:47:13] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:47:13] [INFO ] After 463ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:47:13] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2022-05-15 20:47:14] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 3 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:47:15] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:47:16] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2022-05-15 20:47:17] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2022-05-15 20:47:17] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:47:17] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:47:17] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:47:18] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 4726 ms
[2022-05-15 20:47:18] [INFO ] After 5497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2022-05-15 20:47:19] [INFO ] After 6125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 19 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:47:23] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:47:23] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:47:23] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 20:47:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 20:47:46] [INFO ] Implicit Places using invariants and state equation in 23540 ms returned []
Implicit Place search using SMT with State Equation took 23809 ms to find 0 implicit places.
[2022-05-15 20:47:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2022-05-15 20:47:47] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-15 20:47:47] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 34025 reset in 371 ms.
Product exploration explored 100000 steps with 34058 reset in 374 ms.
Built C files in :
/tmp/ltsmin9231199728490531424
[2022-05-15 20:47:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9231199728490531424
Running compilation step : cd /tmp/ltsmin9231199728490531424;'/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'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin9231199728490531424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9231199728490531424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10980947990401221808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 555 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 7 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:48:03] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:48:03] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:48:03] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:48:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:48:17] [INFO ] Implicit Places using invariants and state equation in 13586 ms returned []
Implicit Place search using SMT with State Equation took 13859 ms to find 0 implicit places.
// Phase 1: matrix 533 rows 555 cols
[2022-05-15 20:48:17] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 20:48:17] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 555/555 places, 533/533 transitions.
Built C files in :
/tmp/ltsmin1370414779880373160
[2022-05-15 20:48:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1370414779880373160
Running compilation step : cd /tmp/ltsmin1370414779880373160;'/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'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin1370414779880373160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1370414779880373160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased909657282467995081.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:48:32] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:48:32] [INFO ] Flatten gal took : 15 ms
[2022-05-15 20:48:32] [INFO ] Time to serialize gal into /tmp/LTL15972813916824961128.gal : 2 ms
[2022-05-15 20:48:32] [INFO ] Time to serialize properties into /tmp/LTL2204042288488342897.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/LTL15972813916824961128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2204042288488342897.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/LTL1597281...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p888<=p700)&&(p748>=2))")U(X("(p888<=p700)"))))))
Formula 0 simplified : !FG("((p888<=p700)&&(p748>=2))" U X"(p888<=p700)")
Detected timeout of ITS tools.
[2022-05-15 20:48:47] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:48:47] [INFO ] Applying decomposition
[2022-05-15 20:48:47] [INFO ] Flatten gal took : 22 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/graph14415185920596425187.txt' '-o' '/tmp/graph14415185920596425187.bin' '-w' '/tmp/graph14415185920596425187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14415185920596425187.bin' '-l' '-1' '-v' '-w' '/tmp/graph14415185920596425187.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:48:48] [INFO ] Decomposing Gal with order
[2022-05-15 20:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:48:48] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-15 20:48:48] [INFO ] Flatten gal took : 30 ms
[2022-05-15 20:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2022-05-15 20:48:48] [INFO ] Time to serialize gal into /tmp/LTL2158749076645255773.gal : 4 ms
[2022-05-15 20:48:48] [INFO ] Time to serialize properties into /tmp/LTL15485999134859009272.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/LTL2158749076645255773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15485999134859009272.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/LTL2158749...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("((gu194.p888<=gu194.p700)&&(gi0.gi1.gi1.gi0.gu160.p748>=2))")U(X("(gu194.p888<=gu194.p700)"))))))
Formula 0 simplified : !FG("((gu194.p888<=gu194.p700)&&(gi0.gi1.gi1.gi0.gu160.p748>=2))" U X"(gu194.p888<=gu194.p700)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16989590979532294410
[2022-05-15 20:49:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16989590979532294410
Running compilation step : cd /tmp/ltsmin16989590979532294410;'/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'
Compilation finished in 854 ms.
Running link step : cd /tmp/ltsmin16989590979532294410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16989590979532294410;'/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' '<>([](((LTLAPp0==true) U X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 377141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(p1)||p2))))'
Found a SL insensitive property : DoubleExponent-PT-020-LTLCardinality-15
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 1055 transition count 760
Reduce places removed 235 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 237 rules applied. Total rules applied 473 place count 820 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 475 place count 818 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 475 place count 818 transition count 718
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 555 place count 778 transition count 718
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 917 place count 597 transition count 537
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 991 place count 560 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 992 place count 559 transition count 536
Applied a total of 992 rules in 72 ms. Remains 559 /1057 variables (removed 498) and now considering 536/997 (removed 461) transitions.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:49:18] [INFO ] Computed 99 place invariants in 54 ms
[2022-05-15 20:49:19] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:49:19] [INFO ] Computed 99 place invariants in 47 ms
[2022-05-15 20:49:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:49:34] [INFO ] Implicit Places using invariants and state equation in 15183 ms returned []
Implicit Place search using SMT with State Equation took 15513 ms to find 0 implicit places.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:49:34] [INFO ] Computed 99 place invariants in 46 ms
[2022-05-15 20:49:34] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 559/1057 places, 536/997 transitions.
Finished structural reductions, in 1 iterations. Remains : 559/1057 places, 536/997 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s397 s4), p2:(LEQ 1 s535), p1:(LEQ s267 s361)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 34034 reset in 417 ms.
Product exploration explored 100000 steps with 34027 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 875 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 810 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 807 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 807 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 784 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 171242 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171242 steps, saw 85652 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:49:40] [INFO ] Computed 99 place invariants in 65 ms
[2022-05-15 20:49:40] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 20:49:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:49:40] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 31 ms returned sat
[2022-05-15 20:49:42] [INFO ] After 1573ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-15 20:49:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:49:48] [INFO ] After 5920ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2022-05-15 20:49:49] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2022-05-15 20:49:49] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 0 ms to minimize.
[2022-05-15 20:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2022-05-15 20:49:49] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-15 20:49:50] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:49:50] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 0 ms to minimize.
[2022-05-15 20:49:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-15 20:49:50] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2022-05-15 20:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-15 20:49:50] [INFO ] After 8307ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 597 ms.
[2022-05-15 20:49:51] [INFO ] After 10737ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 5 out of 559 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 559/559 places, 536/536 transitions.
Graph (complete) has 1663 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 558 transition count 535
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 1 with 81 rules applied. Total rules applied 83 place count 558 transition count 454
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 477 transition count 454
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 2 with 77 rules applied. Total rules applied 241 place count 477 transition count 454
Applied a total of 241 rules in 39 ms. Remains 477 /559 variables (removed 82) and now considering 454/536 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/559 places, 454/536 transitions.
Incomplete random walk after 10000 steps, including 1315 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 200853 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200853 steps, saw 100487 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:50:03] [INFO ] Computed 99 place invariants in 42 ms
[2022-05-15 20:50:03] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:50:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:50:03] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 49 ms returned sat
[2022-05-15 20:50:04] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 20:50:04] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:50:05] [INFO ] After 1189ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 20:50:05] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-15 20:50:05] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-15 20:50:05] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:50:05] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:50:06] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:50:07] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:50:08] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3416 ms
[2022-05-15 20:50:09] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-15 20:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-15 20:50:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2022-05-15 20:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-15 20:50:09] [INFO ] After 5545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 497 ms.
[2022-05-15 20:50:10] [INFO ] After 6754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10000 ms.
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:50:20] [INFO ] Computed 99 place invariants in 48 ms
[2022-05-15 20:50:21] [INFO ] Implicit Places using invariants in 1350 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 232, 255, 261, 283, 288, 309, 314, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1352 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 23 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:50:21] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-15 20:50:22] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:50:22] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-15 20:50:22] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:50:51] [INFO ] Implicit Places using invariants and state equation in 29713 ms returned []
Implicit Place search using SMT with State Equation took 29994 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 421/477 places, 436/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 421/477 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 210127 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210127 steps, saw 105083 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:50:55] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:50:55] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:50:56] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 20:50:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:50:57] [INFO ] After 1360ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:50:58] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:50:59] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:51:00] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2022-05-15 20:51:01] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-15 20:51:01] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:51:01] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-15 20:51:01] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:51:02] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:51:03] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2022-05-15 20:51:03] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:51:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2022-05-15 20:51:03] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-15 20:51:04] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2022-05-15 20:51:05] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2022-05-15 20:51:05] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 7175 ms
[2022-05-15 20:51:05] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:51:05] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 0 ms to minimize.
[2022-05-15 20:51:05] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-15 20:51:06] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:51:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 584 ms
[2022-05-15 20:51:06] [INFO ] After 10341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1032 ms.
[2022-05-15 20:51:07] [INFO ] After 12147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 14000 ms.
Support contains 5 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:51:21] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 20:51:22] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:51:22] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:51:22] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:51:38] [INFO ] Implicit Places using invariants and state equation in 16112 ms returned []
Implicit Place search using SMT with State Equation took 16405 ms to find 0 implicit places.
[2022-05-15 20:51:38] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:51:38] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:51:38] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 988 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 536/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 559 /559 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:51:39] [INFO ] Computed 99 place invariants in 49 ms
[2022-05-15 20:51:40] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:51:40] [INFO ] Computed 99 place invariants in 51 ms
[2022-05-15 20:51:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:51:51] [INFO ] Implicit Places using invariants and state equation in 11443 ms returned []
Implicit Place search using SMT with State Equation took 11746 ms to find 0 implicit places.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:51:51] [INFO ] Computed 99 place invariants in 60 ms
[2022-05-15 20:51:51] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 559/559 places, 536/536 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 527 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 1364 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 799 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 802 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 179412 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179412 steps, saw 89738 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:51:56] [INFO ] Computed 99 place invariants in 46 ms
[2022-05-15 20:51:56] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:51:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:51:56] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 30 ms returned sat
[2022-05-15 20:51:57] [INFO ] After 852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:51:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:51:59] [INFO ] After 1586ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 0 ms to minimize.
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2022-05-15 20:51:59] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 0 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 0 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 0 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2022-05-15 20:52:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1494 ms
[2022-05-15 20:52:01] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:52:01] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2022-05-15 20:52:01] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:52:01] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2022-05-15 20:52:02] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 0 ms to minimize.
[2022-05-15 20:52:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1373 ms
[2022-05-15 20:52:02] [INFO ] After 5326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 542 ms.
[2022-05-15 20:52:03] [INFO ] After 6908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 5 out of 559 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 559/559 places, 536/536 transitions.
Graph (complete) has 1663 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 558 transition count 535
Free-agglomeration rule (complex) applied 81 times.
Iterating global reduction 1 with 81 rules applied. Total rules applied 83 place count 558 transition count 454
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 477 transition count 454
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 2 with 77 rules applied. Total rules applied 241 place count 477 transition count 454
Applied a total of 241 rules in 31 ms. Remains 477 /559 variables (removed 82) and now considering 454/536 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/559 places, 454/536 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 146964 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146964 steps, saw 73515 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:52:13] [INFO ] Computed 99 place invariants in 42 ms
[2022-05-15 20:52:13] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:52:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 20:52:13] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 56 ms returned sat
[2022-05-15 20:52:14] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:52:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:52:15] [INFO ] After 1173ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:52:15] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:52:16] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2022-05-15 20:52:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2551 ms
[2022-05-15 20:52:18] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-15 20:52:18] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-15 20:52:18] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2022-05-15 20:52:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2022-05-15 20:52:18] [INFO ] After 4659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 305 ms.
[2022-05-15 20:52:19] [INFO ] After 5663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 477/477 places, 454/454 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 477/477 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 477 /477 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 477 cols
[2022-05-15 20:52:27] [INFO ] Computed 99 place invariants in 50 ms
[2022-05-15 20:52:28] [INFO ] Implicit Places using invariants in 1345 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 226, 232, 255, 261, 283, 288, 309, 314, 335, 341, 362, 368, 389, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1346 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 439/477 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 23 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:52:28] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:52:28] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:52:28] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:52:28] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:52:55] [INFO ] Implicit Places using invariants and state equation in 26314 ms returned []
Implicit Place search using SMT with State Equation took 26589 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 421/477 places, 436/454 transitions.
Finished structural reductions, in 2 iterations. Remains : 421/477 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 171416 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171416 steps, saw 85718 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:52:58] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-15 20:52:58] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 20:52:59] [INFO ] After 860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 20:52:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:53:00] [INFO ] After 1116ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-15 20:53:01] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:53:01] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:53:01] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:53:01] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 0 ms to minimize.
[2022-05-15 20:53:01] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 1 ms to minimize.
[2022-05-15 20:53:02] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:53:03] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 0 ms to minimize.
[2022-05-15 20:53:03] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 1 ms to minimize.
[2022-05-15 20:53:03] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 1 ms to minimize.
[2022-05-15 20:53:03] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:53:04] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 0 ms to minimize.
[2022-05-15 20:53:05] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:53:05] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2022-05-15 20:53:05] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:53:05] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:53:06] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:53:06] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 0 ms to minimize.
[2022-05-15 20:53:06] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:53:06] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2022-05-15 20:53:07] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2022-05-15 20:53:07] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2022-05-15 20:53:07] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2022-05-15 20:53:08] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-15 20:53:08] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2022-05-15 20:53:08] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2022-05-15 20:53:08] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2022-05-15 20:53:08] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2022-05-15 20:53:09] [INFO ] Deduced a trap composed of 151 places in 147 ms of which 1 ms to minimize.
[2022-05-15 20:53:09] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-05-15 20:53:09] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 0 ms to minimize.
[2022-05-15 20:53:09] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 8533 ms
[2022-05-15 20:53:09] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2022-05-15 20:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-15 20:53:10] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-05-15 20:53:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1832 ms
[2022-05-15 20:53:12] [INFO ] After 12381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 438 ms.
[2022-05-15 20:53:12] [INFO ] After 13813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 5 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:53:18] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-15 20:53:18] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:53:18] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 20:53:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 20:53:36] [INFO ] Implicit Places using invariants and state equation in 17447 ms returned []
Implicit Place search using SMT with State Equation took 17714 ms to find 0 implicit places.
[2022-05-15 20:53:36] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2022-05-15 20:53:36] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 20:53:36] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 436/436 transitions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 631 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 33946 reset in 366 ms.
Product exploration explored 100000 steps with 34181 reset in 372 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 559/559 places, 536/536 transitions.
Applied a total of 0 rules in 17 ms. Remains 559 /559 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2022-05-15 20:53:38] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:53:38] [INFO ] Computed 99 place invariants in 50 ms
[2022-05-15 20:53:39] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 559/559 places, 536/536 transitions.
Product exploration explored 100000 steps with 34098 reset in 349 ms.
Product exploration explored 100000 steps with 33982 reset in 376 ms.
Built C files in :
/tmp/ltsmin17779714716568042628
[2022-05-15 20:53:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17779714716568042628
Running compilation step : cd /tmp/ltsmin17779714716568042628;'/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'
Compilation finished in 870 ms.
Running link step : cd /tmp/ltsmin17779714716568042628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17779714716568042628;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8265956828892717558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 536/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 559 /559 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:53:54] [INFO ] Computed 99 place invariants in 55 ms
[2022-05-15 20:53:55] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:53:55] [INFO ] Computed 99 place invariants in 58 ms
[2022-05-15 20:53:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 20:54:17] [INFO ] Implicit Places using invariants and state equation in 22087 ms returned []
Implicit Place search using SMT with State Equation took 22395 ms to find 0 implicit places.
// Phase 1: matrix 536 rows 559 cols
[2022-05-15 20:54:17] [INFO ] Computed 99 place invariants in 54 ms
[2022-05-15 20:54:17] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 559/559 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin13728405793548294178
[2022-05-15 20:54:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13728405793548294178
Running compilation step : cd /tmp/ltsmin13728405793548294178;'/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'
Compilation finished in 838 ms.
Running link step : cd /tmp/ltsmin13728405793548294178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13728405793548294178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7195202474023160706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 20:54:32] [INFO ] Flatten gal took : 15 ms
[2022-05-15 20:54:32] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:54:32] [INFO ] Time to serialize gal into /tmp/LTL10395923459386909791.gal : 1 ms
[2022-05-15 20:54:32] [INFO ] Time to serialize properties into /tmp/LTL1089269763876977925.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/LTL10395923459386909791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1089269763876977925.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/LTL1039592...267
Read 1 LTL properties
Checking formula 0 : !((("(p728<=p1005)")U(G((X("(p509<=p664)"))||("(p959>=1)")))))
Formula 0 simplified : !("(p728<=p1005)" U G("(p959>=1)" | X"(p509<=p664)"))
Detected timeout of ITS tools.
[2022-05-15 20:54:47] [INFO ] Flatten gal took : 16 ms
[2022-05-15 20:54:47] [INFO ] Applying decomposition
[2022-05-15 20:54:47] [INFO ] Flatten gal took : 16 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/graph4109719959724034677.txt' '-o' '/tmp/graph4109719959724034677.bin' '-w' '/tmp/graph4109719959724034677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4109719959724034677.bin' '-l' '-1' '-v' '-w' '/tmp/graph4109719959724034677.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:54:47] [INFO ] Decomposing Gal with order
[2022-05-15 20:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:54:47] [INFO ] Removed a total of 416 redundant transitions.
[2022-05-15 20:54:47] [INFO ] Flatten gal took : 29 ms
[2022-05-15 20:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 10 ms.
[2022-05-15 20:54:47] [INFO ] Time to serialize gal into /tmp/LTL5734910162449444452.gal : 5 ms
[2022-05-15 20:54:47] [INFO ] Time to serialize properties into /tmp/LTL2680422078468158231.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/LTL5734910162449444452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2680422078468158231.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/LTL5734910...266
Read 1 LTL properties
Checking formula 0 : !((("(gu151.p728<=gu151.p1005)")U(G((X("(gu101.p509<=gu101.p664)"))||("(gi2.gi2.gi0.gi1.gu6.p959>=1)")))))
Formula 0 simplified : !("(gu151.p728<=gu151.p1005)" U G("(gi2.gi2.gi0.gi1.gu6.p959>=1)" | X"(gu101.p509<=gu101.p664)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5937744183676276372
[2022-05-15 20:55:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5937744183676276372
Running compilation step : cd /tmp/ltsmin5937744183676276372;'/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'
Compilation finished in 848 ms.
Running link step : cd /tmp/ltsmin5937744183676276372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5937744183676276372;'/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' '((LTLAPp0==true) U []((X((LTLAPp1==true))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLCardinality-15 finished in 359791 ms.
[2022-05-15 20:55:18] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18180233548131942662
[2022-05-15 20:55:18] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2022-05-15 20:55:18] [INFO ] Applying decomposition
[2022-05-15 20:55:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:55:18] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2022-05-15 20:55:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:55:18] [INFO ] Flatten gal took : 25 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/graph13346324951328142531.txt' '-o' '/tmp/graph13346324951328142531.bin' '-w' '/tmp/graph13346324951328142531.weights'
[2022-05-15 20:55:18] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13346324951328142531.bin' '-l' '-1' '-v' '-w' '/tmp/graph13346324951328142531.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:55:18] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:55:18] [INFO ] Decomposing Gal with order
[2022-05-15 20:55:18] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18180233548131942662
Running compilation step : cd /tmp/ltsmin18180233548131942662;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-15 20:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:55:18] [INFO ] Removed a total of 290 redundant transitions.
[2022-05-15 20:55:18] [INFO ] Flatten gal took : 47 ms
[2022-05-15 20:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2022-05-15 20:55:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality2002291127858122999.gal : 7 ms
[2022-05-15 20:55:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality4525793991222062547.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/LTLCardinality2002291127858122999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4525793991222062547.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/LTLCardina...288
Read 4 LTL properties
Checking formula 0 : !((F(G("(gu311.p649<=gu311.p693)"))))
Formula 0 simplified : !FG"(gu311.p649<=gu311.p693)"
Compilation finished in 2841 ms.
Running link step : cd /tmp/ltsmin18180233548131942662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin18180233548131942662;'/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)))' '--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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLCardinality"
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 DoubleExponent-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;