About the Execution of ITS-Tools for DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10756.672 | 3600000.00 | 9117304.00 | 6711.50 | FFF?FFFFFTFTFTFF | 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.r042-smll-165252095800507.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 DES-PT-40b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095800507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 7.7K Apr 29 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 29 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 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 115K 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 DES-PT-40b-LTLCardinality-00
FORMULA_NAME DES-PT-40b-LTLCardinality-01
FORMULA_NAME DES-PT-40b-LTLCardinality-02
FORMULA_NAME DES-PT-40b-LTLCardinality-03
FORMULA_NAME DES-PT-40b-LTLCardinality-04
FORMULA_NAME DES-PT-40b-LTLCardinality-05
FORMULA_NAME DES-PT-40b-LTLCardinality-06
FORMULA_NAME DES-PT-40b-LTLCardinality-07
FORMULA_NAME DES-PT-40b-LTLCardinality-08
FORMULA_NAME DES-PT-40b-LTLCardinality-09
FORMULA_NAME DES-PT-40b-LTLCardinality-10
FORMULA_NAME DES-PT-40b-LTLCardinality-11
FORMULA_NAME DES-PT-40b-LTLCardinality-12
FORMULA_NAME DES-PT-40b-LTLCardinality-13
FORMULA_NAME DES-PT-40b-LTLCardinality-14
FORMULA_NAME DES-PT-40b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652767224417
Running Version 202205111006
[2022-05-17 06:00:26] [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-17 06:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 06:00:27] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2022-05-17 06:00:27] [INFO ] Transformed 439 places.
[2022-05-17 06:00:27] [INFO ] Transformed 390 transitions.
[2022-05-17 06:00:27] [INFO ] Found NUPN structural information;
[2022-05-17 06:00:27] [INFO ] Parsed PT model containing 439 places and 390 transitions in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DES-PT-40b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 415 transition count 369
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 415 transition count 369
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 402 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 402 transition count 356
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 83 place count 402 transition count 344
Applied a total of 83 rules in 141 ms. Remains 402 /439 variables (removed 37) and now considering 344/390 (removed 46) transitions.
// Phase 1: matrix 344 rows 402 cols
[2022-05-17 06:00:27] [INFO ] Computed 62 place invariants in 79 ms
[2022-05-17 06:00:28] [INFO ] Implicit Places using invariants in 974 ms returned []
// Phase 1: matrix 344 rows 402 cols
[2022-05-17 06:00:28] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-17 06:00:29] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
// Phase 1: matrix 344 rows 402 cols
[2022-05-17 06:00:29] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-17 06:00:30] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/439 places, 344/390 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/439 places, 344/390 transitions.
Support contains 23 out of 402 places after structural reductions.
[2022-05-17 06:00:30] [INFO ] Flatten gal took : 131 ms
[2022-05-17 06:00:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA DES-PT-40b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 06:00:30] [INFO ] Flatten gal took : 71 ms
[2022-05-17 06:00:30] [INFO ] Input system was already deterministic with 344 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 344 rows 402 cols
[2022-05-17 06:00:31] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 06:00:32] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 06:00:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-05-17 06:00:32] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 48 ms returned sat
[2022-05-17 06:00:33] [INFO ] After 637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 06:00:33] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 11 ms to minimize.
[2022-05-17 06:00:33] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2022-05-17 06:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 06:00:33] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2022-05-17 06:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2022-05-17 06:00:34] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 1 ms to minimize.
[2022-05-17 06:00:34] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2022-05-17 06:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 613 ms
[2022-05-17 06:00:34] [INFO ] After 2115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 338 ms.
[2022-05-17 06:00:34] [INFO ] After 2732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 727 ms.
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 394 transition count 319
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 376 transition count 319
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 376 transition count 307
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 364 transition count 307
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 362 transition count 305
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 362 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 362 transition count 303
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 361 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 360 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 360 transition count 301
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 225 place count 284 transition count 225
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 231 place count 281 transition count 233
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 281 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 280 transition count 232
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 234 place count 280 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 279 transition count 231
Applied a total of 235 rules in 227 ms. Remains 279 /402 variables (removed 123) and now considering 231/344 (removed 113) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/402 places, 231/344 transitions.
Incomplete random walk after 10000 steps, including 449 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 453015 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 453015 steps, saw 63873 distinct states, run finished after 3002 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 231 rows 279 cols
[2022-05-17 06:00:39] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-17 06:00:39] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 06:00:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 25 ms returned sat
[2022-05-17 06:00:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 165 ms returned sat
[2022-05-17 06:00:40] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 06:00:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:00:40] [INFO ] After 169ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 06:00:40] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2022-05-17 06:00:41] [INFO ] After 1332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 214 ms.
Support contains 7 out of 279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 231/231 transitions.
Applied a total of 0 rules in 15 ms. Remains 279 /279 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 231/231 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 231/231 transitions.
Applied a total of 0 rules in 15 ms. Remains 279 /279 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 279 cols
[2022-05-17 06:00:41] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-17 06:00:41] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 231 rows 279 cols
[2022-05-17 06:00:41] [INFO ] Computed 61 place invariants in 5 ms
[2022-05-17 06:00:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:00:42] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2022-05-17 06:00:42] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 231 rows 279 cols
[2022-05-17 06:00:42] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-17 06:00:43] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 231/231 transitions.
Graph (complete) has 957 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 278 transition count 231
Applied a total of 2 rules in 26 ms. Remains 278 /279 variables (removed 1) and now considering 231/231 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:00:43] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:00:43] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 06:00:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 06:00:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 203 ms returned sat
[2022-05-17 06:00:43] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 06:00:44] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-17 06:00:44] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 06:00:44] [INFO ] Flatten gal took : 35 ms
[2022-05-17 06:00:44] [INFO ] Flatten gal took : 31 ms
[2022-05-17 06:00:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14595959745608948341.gal : 16 ms
[2022-05-17 06:00:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9996106130984541217.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4394495325047365741;'/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/ReachabilityCardinality14595959745608948341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9996106130984541217.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/ReachabilityCardinality9996106130984541217.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 59
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :59 after 66
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :66 after 304
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :304 after 6920
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6920 after 13992
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :13992 after 168024
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :421912 after 520120
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :520120 after 2.16033e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.10289e+06 after 9.93484e+08
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9.93484e+08 after 3.82434e+09
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.82434e+09 after 4.35834e+09
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :4.35834e+09 after 4.66999e+09
Detected timeout of ITS tools.
[2022-05-17 06:00:59] [INFO ] Flatten gal took : 47 ms
[2022-05-17 06:00:59] [INFO ] Applying decomposition
[2022-05-17 06:00:59] [INFO ] Flatten gal took : 44 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/graph3617030623128173539.txt' '-o' '/tmp/graph3617030623128173539.bin' '-w' '/tmp/graph3617030623128173539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3617030623128173539.bin' '-l' '-1' '-v' '-w' '/tmp/graph3617030623128173539.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:00:59] [INFO ] Decomposing Gal with order
[2022-05-17 06:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:00:59] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-17 06:00:59] [INFO ] Flatten gal took : 138 ms
[2022-05-17 06:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 25 ms.
[2022-05-17 06:00:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality671980030433082081.gal : 16 ms
[2022-05-17 06:00:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10500010913796424006.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4394495325047365741;'/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/ReachabilityCardinality671980030433082081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10500010913796424006.prop' '--nowitness'
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...298
Loading property file /tmp/ReachabilityCardinality10500010913796424006.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 284
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :284 after 68712
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :101464 after 1.21277e+09
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.21277e+09 after 2.23176e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.23176e+09 after 3.93007e+09
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.93007e+09 after 6.64735e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6.64735e+09 after 9.02498e+09
Reachability property AtomicPropp11 is true.
Reachability property AtomicPropp5 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.98081e+13 after 2.2333e+13
Reachability property AtomicPropp8 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.56686e+13,7.81999,142576,8892,2682,285933,13481,343,574882,362,86338,0
Total reachable state count : 55668591183576
Verifying 4 reachability properties.
Reachability property AtomicPropp5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp5,4.05675e+11,7.84122,142840,1396,420,285933,13481,345,574882,365,86338,0
Reachability property AtomicPropp8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,20736,7.90554,142840,61,281,285933,13481,351,574882,369,86338,0
Reachability property AtomicPropp10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,12,7.9085,142840,64,136,285933,13481,358,574882,373,86338,0
Reachability property AtomicPropp11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp11,10656,7.90986,142840,69,206,285933,13481,365,574882,377,86338,0
Computed a total of 221 stabilizing places and 213 stable transitions
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.16 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(G(p1))||p0)))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 393 transition count 322
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 377 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 377 transition count 310
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 365 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 362 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 362 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 362 transition count 305
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 361 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 360 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 360 transition count 303
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 285 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 282 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 280 transition count 234
Applied a total of 227 rules in 201 ms. Remains 280 /402 variables (removed 122) and now considering 234/344 (removed 110) transitions.
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:01:08] [INFO ] Computed 59 place invariants in 10 ms
[2022-05-17 06:01:08] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:01:08] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-17 06:01:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:01:09] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2022-05-17 06:01:09] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:01:09] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-17 06:01:09] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/402 places, 234/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/402 places, 234/344 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (NEQ s178 0) (NEQ s84 1)), p0:(OR (EQ s178 0) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 6 ms.
FORMULA DES-PT-40b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-00 finished in 2034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0)) U !X(p1))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 393 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 61 ms. Remains 393 /402 variables (removed 9) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-17 06:01:10] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:10] [INFO ] Computed 62 place invariants in 28 ms
[2022-05-17 06:01:11] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:11] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 06:01:11] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/402 places, 333/344 transitions.
Stuttering acceptance computed with spot in 218 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s254 0) (EQ s117 1)), p0:(OR (EQ s164 0) (EQ s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 3 ms.
FORMULA DES-PT-40b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-01 finished in 2051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(G(X(p0))))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 398 transition count 340
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 398 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 398 transition count 339
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 395 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 395 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 395 transition count 335
Applied a total of 16 rules in 72 ms. Remains 395 /402 variables (removed 7) and now considering 335/344 (removed 9) transitions.
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:01:12] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:01:12] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:01:12] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:01:13] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:01:13] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 06:01:13] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/402 places, 335/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 395/402 places, 335/344 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s389 0) (NEQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-02 finished in 1792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 393 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 40 ms. Remains 393 /402 variables (removed 9) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:13] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 06:01:14] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:14] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 06:01:15] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:15] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-17 06:01:15] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/402 places, 333/344 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-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:(EQ s76 0)], 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 867 reset in 527 ms.
Product exploration explored 100000 steps with 885 reset in 536 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 363 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 103 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 799814 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 799814 steps, saw 132457 distinct states, run finished after 3002 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:20] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 06:01:20] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:01:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-17 06:01:20] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 37 ms returned sat
[2022-05-17 06:01:21] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:01:21] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 2 ms to minimize.
[2022-05-17 06:01:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-17 06:01:21] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 06:01:21] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-05-17 06:01:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 424 ms
[2022-05-17 06:01:21] [INFO ] After 792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-17 06:01:21] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 387 transition count 311
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 370 transition count 311
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 370 transition count 299
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 358 transition count 299
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 215 place count 281 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 279 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 220 place count 279 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 278 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 278 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 277 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 276 transition count 222
Applied a total of 224 rules in 137 ms. Remains 276 /393 variables (removed 117) and now considering 222/333 (removed 111) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/393 places, 222/333 transitions.
Incomplete random walk after 10000 steps, including 494 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1103138 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1103138 steps, saw 153903 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:01:24] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 06:01:25] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:01:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-17 06:01:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 118 ms returned sat
[2022-05-17 06:01:25] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:01:25] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 06:01:25] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:01:25] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 06:01:25] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:01:25] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:01:26] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2022-05-17 06:01:26] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:01:26] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 06:01:26] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 222/222 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 13 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:01:26] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 06:01:26] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:01:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-17 06:01:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 201 ms returned sat
[2022-05-17 06:01:27] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:01:27] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2022-05-17 06:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 06:01:27] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 06:01:27] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:01:27] [INFO ] Flatten gal took : 23 ms
[2022-05-17 06:01:27] [INFO ] Flatten gal took : 21 ms
[2022-05-17 06:01:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13515864725938425013.gal : 4 ms
[2022-05-17 06:01:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14211670122044523049.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4495515264980083419;'/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/ReachabilityCardinality13515864725938425013.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14211670122044523049.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/ReachabilityCardinality14211670122044523049.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 692
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :692 after 9556
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9556 after 128456
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128456 after 206324
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :206324 after 488128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66254e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.66254e+09 after 2.66934e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.79085e+10 after 2.5311e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.6222e+10 after 2.65673e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :9.91794e+10 after 1.01007e+11
Detected timeout of ITS tools.
[2022-05-17 06:01:42] [INFO ] Flatten gal took : 21 ms
[2022-05-17 06:01:42] [INFO ] Applying decomposition
[2022-05-17 06:01:42] [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/graph15213154496690241392.txt' '-o' '/tmp/graph15213154496690241392.bin' '-w' '/tmp/graph15213154496690241392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15213154496690241392.bin' '-l' '-1' '-v' '-w' '/tmp/graph15213154496690241392.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:01:43] [INFO ] Decomposing Gal with order
[2022-05-17 06:01:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:01:43] [INFO ] Removed a total of 39 redundant transitions.
[2022-05-17 06:01:43] [INFO ] Flatten gal took : 34 ms
[2022-05-17 06:01:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2022-05-17 06:01:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14523406430487576128.gal : 6 ms
[2022-05-17 06:01:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8763485244280907344.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4495515264980083419;'/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/ReachabilityCardinality14523406430487576128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8763485244280907344.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality8763485244280907344.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 194
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :194 after 4132
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4132 after 34360
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50736 after 1.37795e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.37795e+09 after 2.39693e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.39693e+09 after 3.58574e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.58574e+09 after 5.79354e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.48246e+13,10.1339,256688,36126,1662,640009,5907,279,932147,353,17472,0
Total reachable state count : 14824592030774
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1.85932e+11,10.1912,256688,2653,460,640009,5907,281,932147,356,17472,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 257 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 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:53] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:01:54] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:54] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:01:55] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:55] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-17 06:01:55] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 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 113 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 764389 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 764389 steps, saw 127204 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:01:59] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 06:01:59] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:01:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-17 06:01:59] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 33 ms returned sat
[2022-05-17 06:01:59] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:02:00] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-17 06:02:00] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2022-05-17 06:02:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 06:02:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2022-05-17 06:02:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 343 ms
[2022-05-17 06:02:00] [INFO ] After 783ms 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-17 06:02:00] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 387 transition count 311
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 370 transition count 311
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 370 transition count 299
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 358 transition count 299
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 215 place count 281 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 279 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 220 place count 279 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 278 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 278 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 277 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 276 transition count 222
Applied a total of 224 rules in 80 ms. Remains 276 /393 variables (removed 117) and now considering 222/333 (removed 111) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/393 places, 222/333 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1062934 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1062934 steps, saw 148758 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:02:03] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:02:03] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:02:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-17 06:02:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 119 ms returned sat
[2022-05-17 06:02:04] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:02:04] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 06:02:04] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:02:04] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:02:04] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:02:04] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:02:04] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2022-05-17 06:02:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:02:05] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:02:05] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 222/222 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 11 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2022-05-17 06:02:05] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:02:05] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:02:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-17 06:02:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 200 ms returned sat
[2022-05-17 06:02:06] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:02:06] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2022-05-17 06:02:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 06:02:06] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 06:02:06] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:02:06] [INFO ] Flatten gal took : 17 ms
[2022-05-17 06:02:06] [INFO ] Flatten gal took : 17 ms
[2022-05-17 06:02:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3528251824938243085.gal : 5 ms
[2022-05-17 06:02:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15250429209079266083.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13304811479612780294;'/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/ReachabilityCardinality3528251824938243085.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15250429209079266083.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/ReachabilityCardinality15250429209079266083.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 692
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :692 after 9556
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9556 after 128456
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :128456 after 206324
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :206324 after 488128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66254e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.66254e+09 after 2.66934e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.79085e+10 after 2.5311e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.6222e+10 after 2.65673e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :9.91794e+10 after 1.01007e+11
Detected timeout of ITS tools.
[2022-05-17 06:02:21] [INFO ] Flatten gal took : 16 ms
[2022-05-17 06:02:21] [INFO ] Applying decomposition
[2022-05-17 06:02:21] [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/graph15093370902008373283.txt' '-o' '/tmp/graph15093370902008373283.bin' '-w' '/tmp/graph15093370902008373283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15093370902008373283.bin' '-l' '-1' '-v' '-w' '/tmp/graph15093370902008373283.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:02:21] [INFO ] Decomposing Gal with order
[2022-05-17 06:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:02:21] [INFO ] Removed a total of 37 redundant transitions.
[2022-05-17 06:02:21] [INFO ] Flatten gal took : 24 ms
[2022-05-17 06:02:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2022-05-17 06:02:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2280616243536556964.gal : 4 ms
[2022-05-17 06:02:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11476577693821984535.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13304811479612780294;'/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/ReachabilityCardinality2280616243536556964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11476577693821984535.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality11476577693821984535.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 836
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :836 after 34360
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50736 after 6.06296e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.06296e+08 after 1.11579e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.11579e+09 after 1.96494e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.96494e+09 after 3.32359e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.32359e+09 after 5.87104e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.51922e+13,7.16141,166404,20071,3219,399663,12306,283,563047,352,66039,0
Total reachable state count : 25192169197070
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1.85932e+11,7.19284,166404,1574,463,399663,12306,285,563047,355,66039,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 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 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 873 reset in 396 ms.
Product exploration explored 100000 steps with 879 reset in 433 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 387 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 387 transition count 332
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 387 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 382 transition count 327
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 382 transition count 327
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 112 place count 382 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 372 transition count 320
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 372 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 372 transition count 348
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 370 transition count 342
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 370 transition count 342
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 142 rules in 181 ms. Remains 370 /393 variables (removed 23) and now considering 342/333 (removed -9) transitions.
[2022-05-17 06:02:30] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 342 rows 370 cols
[2022-05-17 06:02:30] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-17 06:02:31] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 370/393 places, 342/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/393 places, 342/333 transitions.
Product exploration explored 100000 steps with 4625 reset in 864 ms.
Product exploration explored 100000 steps with 4653 reset in 770 ms.
Built C files in :
/tmp/ltsmin15707897223041312989
[2022-05-17 06:02:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15707897223041312989
Running compilation step : cd /tmp/ltsmin15707897223041312989;'/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 1404 ms.
Running link step : cd /tmp/ltsmin15707897223041312989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15707897223041312989;'/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/stateBased4948933017384627464.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 36 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:02:47] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:02:48] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:02:48] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:02:49] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:02:49] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:02:49] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin5213985704533618773
[2022-05-17 06:02:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5213985704533618773
Running compilation step : cd /tmp/ltsmin5213985704533618773;'/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 1101 ms.
Running link step : cd /tmp/ltsmin5213985704533618773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5213985704533618773;'/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/stateBased563802060723994181.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 06:03:04] [INFO ] Flatten gal took : 17 ms
[2022-05-17 06:03:04] [INFO ] Flatten gal took : 15 ms
[2022-05-17 06:03:04] [INFO ] Time to serialize gal into /tmp/LTL11724679706351201342.gal : 2 ms
[2022-05-17 06:03:04] [INFO ] Time to serialize properties into /tmp/LTL4790604223869690613.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/LTL11724679706351201342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4790604223869690613.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/LTL1172467...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(p77==0)"))))
Formula 0 simplified : !GX"(p77==0)"
Detected timeout of ITS tools.
[2022-05-17 06:03:19] [INFO ] Flatten gal took : 15 ms
[2022-05-17 06:03:19] [INFO ] Applying decomposition
[2022-05-17 06:03:19] [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/graph8274418400125857791.txt' '-o' '/tmp/graph8274418400125857791.bin' '-w' '/tmp/graph8274418400125857791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8274418400125857791.bin' '-l' '-1' '-v' '-w' '/tmp/graph8274418400125857791.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:03:19] [INFO ] Decomposing Gal with order
[2022-05-17 06:03:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:03:19] [INFO ] Removed a total of 11 redundant transitions.
[2022-05-17 06:03:19] [INFO ] Flatten gal took : 38 ms
[2022-05-17 06:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2022-05-17 06:03:19] [INFO ] Time to serialize gal into /tmp/LTL13395260237282578573.gal : 6 ms
[2022-05-17 06:03:19] [INFO ] Time to serialize properties into /tmp/LTL13092498606923623572.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/LTL13395260237282578573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13092498606923623572.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1339526...247
Read 1 LTL properties
Checking formula 0 : !((G(X("(i9.u73.p77==0)"))))
Formula 0 simplified : !GX"(i9.u73.p77==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1145998452053890581
[2022-05-17 06:03:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1145998452053890581
Running compilation step : cd /tmp/ltsmin1145998452053890581;'/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 1008 ms.
Running link step : cd /tmp/ltsmin1145998452053890581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1145998452053890581;'/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 DES-PT-40b-LTLCardinality-03 finished in 155993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 393 transition count 323
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 378 transition count 323
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 378 transition count 312
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 367 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 364 transition count 309
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 364 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 307
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 363 transition count 306
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 362 transition count 305
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 362 transition count 305
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 217 place count 286 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 282 transition count 229
Applied a total of 223 rules in 86 ms. Remains 282 /402 variables (removed 120) and now considering 229/344 (removed 115) transitions.
// Phase 1: matrix 229 rows 282 cols
[2022-05-17 06:03:50] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:03:50] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 229 rows 282 cols
[2022-05-17 06:03:50] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:03:50] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2022-05-17 06:03:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 229 rows 282 cols
[2022-05-17 06:03:50] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:03:51] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/402 places, 229/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/402 places, 229/344 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s158 1), p0:(OR (EQ s235 0) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 36 steps with 2 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-04 finished in 1333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((X(p0)&&p0) U p1))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 393 transition count 322
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 377 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 377 transition count 310
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 365 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 363 transition count 308
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 363 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 362 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 362 transition count 307
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 215 place count 286 transition count 231
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 283 transition count 246
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 229 place count 283 transition count 238
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 281 transition count 236
Applied a total of 231 rules in 75 ms. Remains 281 /402 variables (removed 121) and now considering 236/344 (removed 108) transitions.
// Phase 1: matrix 236 rows 281 cols
[2022-05-17 06:03:51] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:03:51] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 236 rows 281 cols
[2022-05-17 06:03:51] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:03:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:03:52] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2022-05-17 06:03:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 236 rows 281 cols
[2022-05-17 06:03:52] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:03:52] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/402 places, 236/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/402 places, 236/344 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s165 0) (EQ s33 1)), p0:(OR (EQ s131 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-05 finished in 1815 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 393 transition count 322
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 377 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 377 transition count 310
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 365 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 363 transition count 308
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 363 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 362 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 361 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 361 transition count 304
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 219 place count 285 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 282 transition count 236
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 280 transition count 234
Applied a total of 227 rules in 104 ms. Remains 280 /402 variables (removed 122) and now considering 234/344 (removed 110) transitions.
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:03:53] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 06:03:53] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:03:53] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 06:03:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:03:54] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2022-05-17 06:03:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:03:54] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:03:54] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/402 places, 234/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/402 places, 234/344 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s98 0) (EQ s269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5296 reset in 264 ms.
Product exploration explored 100000 steps with 5341 reset in 302 ms.
Computed a total of 177 stabilizing places and 178 stable transitions
Computed a total of 177 stabilizing places and 178 stable transitions
Detected a total of 177/280 stabilizing places and 178/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 527 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1128811 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1128811 steps, saw 162282 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:03:58] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:03:58] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:03:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-17 06:03:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2022-05-17 06:03:59] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:03:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:03:59] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:03:59] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 06:03:59] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 234/234 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 233
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 280 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 279 transition count 232
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 279 transition count 232
Applied a total of 4 rules in 21 ms. Remains 279 /280 variables (removed 1) and now considering 232/234 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/280 places, 232/234 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1042436 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1042436 steps, saw 146396 distinct states, run finished after 3005 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:02] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:04:02] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:04:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-17 06:04:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 118 ms returned sat
[2022-05-17 06:04:02] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:02] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2022-05-17 06:04:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 06:04:03] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-17 06:04:03] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 232/232 transitions.
Applied a total of 0 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 232/232 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 232/232 transitions.
Applied a total of 0 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:03] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:04:03] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:03] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-17 06:04:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:04] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2022-05-17 06:04:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:04] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:04:04] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 232/232 transitions.
Graph (complete) has 957 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 278 transition count 232
Applied a total of 2 rules in 19 ms. Remains 278 /279 variables (removed 1) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 278 cols
[2022-05-17 06:04:04] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:04:04] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:04:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 06:04:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 199 ms returned sat
[2022-05-17 06:04:05] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:05] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-17 06:04:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-17 06:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-17 06:04:05] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-17 06:04:06] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:06] [INFO ] Flatten gal took : 22 ms
[2022-05-17 06:04:06] [INFO ] Flatten gal took : 20 ms
[2022-05-17 06:04:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8811858166522963717.gal : 4 ms
[2022-05-17 06:04:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7696175673056871612.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4231747868125307799;'/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/ReachabilityCardinality8811858166522963717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7696175673056871612.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/ReachabilityCardinality7696175673056871612.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 352
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :352 after 8024
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8024 after 16424
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16424 after 195896
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :492184 after 606792
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :606792 after 2.55638e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.86015e+06 after 1.15791e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.15791e+09 after 4.4562e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.4562e+09 after 5.07508e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.07508e+09 after 5.43194e+09
Detected timeout of ITS tools.
[2022-05-17 06:04:21] [INFO ] Flatten gal took : 12 ms
[2022-05-17 06:04:21] [INFO ] Applying decomposition
[2022-05-17 06:04:21] [INFO ] Flatten gal took : 12 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/graph17669775498780474033.txt' '-o' '/tmp/graph17669775498780474033.bin' '-w' '/tmp/graph17669775498780474033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17669775498780474033.bin' '-l' '-1' '-v' '-w' '/tmp/graph17669775498780474033.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:04:21] [INFO ] Decomposing Gal with order
[2022-05-17 06:04:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:04:21] [INFO ] Removed a total of 100 redundant transitions.
[2022-05-17 06:04:21] [INFO ] Flatten gal took : 24 ms
[2022-05-17 06:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 16 ms.
[2022-05-17 06:04:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2358250596280233389.gal : 3 ms
[2022-05-17 06:04:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4655841521858190320.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4231747868125307799;'/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/ReachabilityCardinality2358250596280233389.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4655841521858190320.prop' '--nowitness'
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...298
Loading property file /tmp/ReachabilityCardinality4655841521858190320.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 34
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34 after 1922
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1922 after 5378
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5378 after 118216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :118216 after 9.18783e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.52737e+10,3.9707,98256,7295,447,120711,2020,350,717135,371,4024,0
Total reachable state count : 15273744848
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,720,3.98143,98520,62,146,120711,2020,358,717135,376,4024,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:04:25] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:04:25] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:04:25] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 06:04:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:26] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2022-05-17 06:04:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:04:26] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:04:26] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 234/234 transitions.
Computed a total of 177 stabilizing places and 178 stable transitions
Computed a total of 177 stabilizing places and 178 stable transitions
Detected a total of 177/280 stabilizing places and 178/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 521 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968349 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968349 steps, saw 138646 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 280 cols
[2022-05-17 06:04:30] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 06:04:30] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:04:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2022-05-17 06:04:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2022-05-17 06:04:30] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:30] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:30] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 06:04:30] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 234/234 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 233
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 280 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 279 transition count 232
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 279 transition count 232
Applied a total of 4 rules in 24 ms. Remains 279 /280 variables (removed 1) and now considering 232/234 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/280 places, 232/234 transitions.
Incomplete random walk after 10000 steps, including 519 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 979570 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 979570 steps, saw 137302 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:33] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:04:33] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:04:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-17 06:04:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 202 ms returned sat
[2022-05-17 06:04:34] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:34] [INFO ] After 27ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:34] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2022-05-17 06:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 06:04:34] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 06:04:34] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 232/232 transitions.
Applied a total of 0 rules in 10 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 232/232 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 232/232 transitions.
Applied a total of 0 rules in 10 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:34] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:04:35] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:35] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:04:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:04:36] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2022-05-17 06:04:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 232 rows 279 cols
[2022-05-17 06:04:36] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:04:36] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 232/232 transitions.
Graph (complete) has 957 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 278 transition count 232
Applied a total of 2 rules in 17 ms. Remains 278 /279 variables (removed 1) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 278 cols
[2022-05-17 06:04:36] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:04:36] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:04:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 06:04:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 122 ms returned sat
[2022-05-17 06:04:37] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-17 06:04:37] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2022-05-17 06:04:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2022-05-17 06:04:37] [INFO ] After 560ms 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-17 06:04:37] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:04:37] [INFO ] Flatten gal took : 19 ms
[2022-05-17 06:04:37] [INFO ] Flatten gal took : 19 ms
[2022-05-17 06:04:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15826666911844635442.gal : 3 ms
[2022-05-17 06:04:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8727941925930942660.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18273569899216046579;'/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/ReachabilityCardinality15826666911844635442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8727941925930942660.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/ReachabilityCardinality8727941925930942660.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 352
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :352 after 8024
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8024 after 16424
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16424 after 195896
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :492184 after 606792
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :606792 after 2.55638e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.86015e+06 after 1.15791e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.15791e+09 after 4.4562e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.4562e+09 after 5.07508e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.07508e+09 after 5.43194e+09
Detected timeout of ITS tools.
[2022-05-17 06:04:52] [INFO ] Flatten gal took : 15 ms
[2022-05-17 06:04:52] [INFO ] Applying decomposition
[2022-05-17 06:04:52] [INFO ] Flatten gal took : 11 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/graph6650839958956124156.txt' '-o' '/tmp/graph6650839958956124156.bin' '-w' '/tmp/graph6650839958956124156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6650839958956124156.bin' '-l' '-1' '-v' '-w' '/tmp/graph6650839958956124156.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:04:52] [INFO ] Decomposing Gal with order
[2022-05-17 06:04:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:04:52] [INFO ] Removed a total of 104 redundant transitions.
[2022-05-17 06:04:52] [INFO ] Flatten gal took : 36 ms
[2022-05-17 06:04:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 4 ms.
[2022-05-17 06:04:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6605606788008362284.gal : 3 ms
[2022-05-17 06:04:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16428516733616296639.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms18273569899216046579;'/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/ReachabilityCardinality6605606788008362284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16428516733616296639.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality16428516733616296639.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 122
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :122 after 10756
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10756 after 80040
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :118216 after 1.97409e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.97409e+10 after 3.66117e+10
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.91062e+10,0.645198,16928,2290,395,25634,1949,326,54867,359,3624,0
Total reachable state count : 59106188440
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,73152,0.647362,17192,198,258,25634,1949,333,54867,364,3624,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 5447 reset in 350 ms.
Product exploration explored 100000 steps with 5436 reset in 449 ms.
Built C files in :
/tmp/ltsmin14932242014988238906
[2022-05-17 06:04:54] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2022-05-17 06:04:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:04:54] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2022-05-17 06:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:04:54] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2022-05-17 06:04:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:04:54] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14932242014988238906
Running compilation step : cd /tmp/ltsmin14932242014988238906;'/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 911 ms.
Running link step : cd /tmp/ltsmin14932242014988238906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14932242014988238906;'/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/stateBased8843836572107956014.hoa' '--buchi-type=spotba'
LTSmin run took 2543 ms.
FORMULA DES-PT-40b-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-06 finished in 64834 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 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 393 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 393 transition count 333
Applied a total of 20 rules in 18 ms. Remains 393 /402 variables (removed 9) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:04:57] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:04:58] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:04:58] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 06:04:59] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2022-05-17 06:04:59] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 06:04:59] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/402 places, 333/344 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-10 finished in 1700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U !F(p1)))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 398 transition count 340
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 398 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 398 transition count 339
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 395 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 395 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 395 transition count 335
Applied a total of 16 rules in 28 ms. Remains 395 /402 variables (removed 7) and now considering 335/344 (removed 9) transitions.
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:04:59] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-17 06:05:00] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:05:00] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-17 06:05:00] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
// Phase 1: matrix 335 rows 395 cols
[2022-05-17 06:05:00] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-17 06:05:01] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/402 places, 335/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 395/402 places, 335/344 transitions.
Stuttering acceptance computed with spot in 122 ms :[p1, p1, true, p1]
Running random walk in product with property : DES-PT-40b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s342 0) (EQ s381 1)), p0:(NEQ s347 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-12 finished in 1752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Found a SL insensitive property : DES-PT-40b-LTLCardinality-03
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 402/402 places, 344/344 transitions.
Graph (complete) has 899 edges and 402 vertex of which 394 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 393 transition count 322
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 377 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 377 transition count 310
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 365 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 362 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 362 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 362 transition count 305
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 361 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 360 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 221 place count 284 transition count 227
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 281 transition count 235
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 279 transition count 233
Applied a total of 229 rules in 48 ms. Remains 279 /402 variables (removed 123) and now considering 233/344 (removed 111) transitions.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:05:01] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:05:02] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:05:02] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:05:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:05:02] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:05:02] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:05:03] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 279/402 places, 233/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/402 places, 233/344 transitions.
Running random walk in product with property : DES-PT-40b-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:(EQ s70 0)], 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 5438 reset in 273 ms.
Product exploration explored 100000 steps with 5484 reset in 326 ms.
Computed a total of 176 stabilizing places and 177 stable transitions
Computed a total of 176 stabilizing places and 177 stable transitions
Detected a total of 176/279 stabilizing places and 177/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 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 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 545 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1180606 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :{}
Probabilistic random walk after 1180606 steps, saw 168763 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:05:07] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-17 06:05:07] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:05:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-17 06:05:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 213 ms returned sat
[2022-05-17 06:05:07] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:05:07] [INFO ] After 50ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:07] [INFO ] After 79ms 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-17 06:05:07] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 233/233 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 232
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 279 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 278 transition count 231
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 278 transition count 231
Applied a total of 4 rules in 18 ms. Remains 278 /279 variables (removed 1) and now considering 231/233 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 278/279 places, 231/233 transitions.
Incomplete random walk after 10000 steps, including 545 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1162276 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{}
Probabilistic random walk after 1162276 steps, saw 161727 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:05:11] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 06:05:11] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:05:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-17 06:05:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 256 ms returned sat
[2022-05-17 06:05:11] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:05:11] [INFO ] After 102ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:11] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 06:05:11] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 278/278 places, 231/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 278/278 places, 231/231 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 278/278 places, 231/231 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:05:11] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:05:12] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:05:12] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:05:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:05:13] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2022-05-17 06:05:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:05:13] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:05:13] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 278/278 places, 231/231 transitions.
Graph (complete) has 956 edges and 278 vertex of which 277 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 231
Applied a total of 2 rules in 14 ms. Remains 277 /278 variables (removed 1) and now considering 231/231 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 277 cols
[2022-05-17 06:05:13] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:05:13] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:05:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 06:05:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 92 ms returned sat
[2022-05-17 06:05:13] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:13] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 06:05:13] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:05:13] [INFO ] Flatten gal took : 11 ms
[2022-05-17 06:05:13] [INFO ] Flatten gal took : 12 ms
[2022-05-17 06:05:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality943531732542401138.gal : 2 ms
[2022-05-17 06:05:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2156721785567629803.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3498218858196231438;'/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/ReachabilityCardinality943531732542401138.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2156721785567629803.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...318
Loading property file /tmp/ReachabilityCardinality2156721785567629803.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 356
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :356 after 2528
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2528 after 22468
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :22468 after 299816
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :299816 after 484144
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :484144 after 1.89658e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.15362e+09 after 6.22904e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.50585e+09 after 6.52921e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.27049e+10 after 6.04292e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.26119e+10 after 6.37152e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.7287e+11 after 5.80459e+11
Detected timeout of ITS tools.
[2022-05-17 06:05:28] [INFO ] Flatten gal took : 19 ms
[2022-05-17 06:05:28] [INFO ] Applying decomposition
[2022-05-17 06:05:28] [INFO ] Flatten gal took : 19 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/graph2601127824995111976.txt' '-o' '/tmp/graph2601127824995111976.bin' '-w' '/tmp/graph2601127824995111976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2601127824995111976.bin' '-l' '-1' '-v' '-w' '/tmp/graph2601127824995111976.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:05:29] [INFO ] Decomposing Gal with order
[2022-05-17 06:05:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:05:29] [INFO ] Removed a total of 97 redundant transitions.
[2022-05-17 06:05:29] [INFO ] Flatten gal took : 50 ms
[2022-05-17 06:05:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2022-05-17 06:05:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17703169572433303532.gal : 4 ms
[2022-05-17 06:05:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11485181535574219495.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3498218858196231438;'/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/ReachabilityCardinality17703169572433303532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11485181535574219495.prop' '--nowitness'
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...300
Loading property file /tmp/ReachabilityCardinality11485181535574219495.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 340
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :340 after 80040
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :118216 after 8.77734e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.77734e+09 after 1.86984e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.86984e+10 after 2.86197e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.86197e+10 after 4.84617e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.84617e+10 after 8.56658e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2079651768600011421
[2022-05-17 06:05:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2079651768600011421
Running compilation step : cd /tmp/ltsmin2079651768600011421;'/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 667 ms.
Running link step : cd /tmp/ltsmin2079651768600011421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2079651768600011421;'/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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 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 100 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:05:59] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:06:00] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:06:00] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:06:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:06:01] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:06:01] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:06:01] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 233/233 transitions.
Computed a total of 176 stabilizing places and 177 stable transitions
Computed a total of 176 stabilizing places and 177 stable transitions
Detected a total of 176/279 stabilizing places and 177/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 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 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 542 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 965859 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 965859 steps, saw 138281 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:06:04] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:06:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:06:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2022-05-17 06:06:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 127 ms returned sat
[2022-05-17 06:06:05] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:06:05] [INFO ] After 57ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:05] [INFO ] After 93ms 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-17 06:06:05] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 279/279 places, 233/233 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 232
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 279 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 278 transition count 231
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 278 transition count 231
Applied a total of 4 rules in 28 ms. Remains 278 /279 variables (removed 1) and now considering 231/233 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 278/279 places, 231/233 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1135340 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 1135340 steps, saw 158174 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:06:08] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 06:06:08] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:06:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-17 06:06:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 258 ms returned sat
[2022-05-17 06:06:09] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:06:09] [INFO ] After 148ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:09] [INFO ] After 181ms 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-17 06:06:09] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 278/278 places, 231/231 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 278/278 places, 231/231 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 278/278 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:06:09] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:06:10] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:06:10] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 06:06:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:06:11] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2022-05-17 06:06:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 231 rows 278 cols
[2022-05-17 06:06:11] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 06:06:11] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 278/278 places, 231/231 transitions.
Graph (complete) has 956 edges and 278 vertex of which 277 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 231
Applied a total of 2 rules in 15 ms. Remains 277 /278 variables (removed 1) and now considering 231/231 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 277 cols
[2022-05-17 06:06:11] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-17 06:06:11] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 06:06:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 06:06:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 86 ms returned sat
[2022-05-17 06:06:12] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:12] [INFO ] After 276ms 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-17 06:06:12] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 06:06:12] [INFO ] Flatten gal took : 19 ms
[2022-05-17 06:06:12] [INFO ] Flatten gal took : 23 ms
[2022-05-17 06:06:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10458148668339569952.gal : 3 ms
[2022-05-17 06:06:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1582897361775733107.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4803937757841593078;'/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/ReachabilityCardinality10458148668339569952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1582897361775733107.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/ReachabilityCardinality1582897361775733107.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 356
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :356 after 2528
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2528 after 22468
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :22468 after 299816
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :299816 after 484144
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :484144 after 1.89658e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.15362e+09 after 6.22904e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.50585e+09 after 6.52921e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.27049e+10 after 6.04292e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.26119e+10 after 6.37152e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.7287e+11 after 5.80459e+11
Detected timeout of ITS tools.
[2022-05-17 06:06:27] [INFO ] Flatten gal took : 19 ms
[2022-05-17 06:06:27] [INFO ] Applying decomposition
[2022-05-17 06:06:27] [INFO ] Flatten gal took : 18 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/graph9350393629982192154.txt' '-o' '/tmp/graph9350393629982192154.bin' '-w' '/tmp/graph9350393629982192154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9350393629982192154.bin' '-l' '-1' '-v' '-w' '/tmp/graph9350393629982192154.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:06:27] [INFO ] Decomposing Gal with order
[2022-05-17 06:06:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:06:27] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-17 06:06:27] [INFO ] Flatten gal took : 67 ms
[2022-05-17 06:06:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 22 ms.
[2022-05-17 06:06:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4780812827629642387.gal : 4 ms
[2022-05-17 06:06:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2028508960901900709.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4803937757841593078;'/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/ReachabilityCardinality4780812827629642387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2028508960901900709.prop' '--nowitness'
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...298
Loading property file /tmp/ReachabilityCardinality2028508960901900709.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 194
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :194 after 4946
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4946 after 13252
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :118216 after 1.49329e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.49329e+10 after 3.22949e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.22949e+10 after 5.21371e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.21371e+10 after 8.43806e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin859250499901773525
[2022-05-17 06:06:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin859250499901773525
Running compilation step : cd /tmp/ltsmin859250499901773525;'/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 620 ms.
Running link step : cd /tmp/ltsmin859250499901773525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin859250499901773525;'/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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 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 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5427 reset in 261 ms.
Product exploration explored 100000 steps with 5401 reset in 282 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2022-05-17 06:06:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:06:58] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:06:59] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 233/233 transitions.
Product exploration explored 100000 steps with 5483 reset in 440 ms.
Product exploration explored 100000 steps with 5403 reset in 457 ms.
Built C files in :
/tmp/ltsmin8210741141799530744
[2022-05-17 06:07:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8210741141799530744
Running compilation step : cd /tmp/ltsmin8210741141799530744;'/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 823 ms.
Running link step : cd /tmp/ltsmin8210741141799530744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8210741141799530744;'/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/stateBased14672160596547042979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:07:15] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:07:15] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:07:15] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-17 06:07:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 06:07:16] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 279 cols
[2022-05-17 06:07:16] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-17 06:07:16] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 233/233 transitions.
Built C files in :
/tmp/ltsmin1062951093577171478
[2022-05-17 06:07:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1062951093577171478
Running compilation step : cd /tmp/ltsmin1062951093577171478;'/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 699 ms.
Running link step : cd /tmp/ltsmin1062951093577171478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1062951093577171478;'/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/stateBased2195769877502336671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 06:07:31] [INFO ] Flatten gal took : 13 ms
[2022-05-17 06:07:31] [INFO ] Flatten gal took : 14 ms
[2022-05-17 06:07:31] [INFO ] Time to serialize gal into /tmp/LTL5196776759780451994.gal : 2 ms
[2022-05-17 06:07:31] [INFO ] Time to serialize properties into /tmp/LTL1225305139633639766.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/LTL5196776759780451994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1225305139633639766.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/LTL5196776...266
Read 1 LTL properties
Checking formula 0 : !((G(X("(p77==0)"))))
Formula 0 simplified : !GX"(p77==0)"
Detected timeout of ITS tools.
[2022-05-17 06:07:46] [INFO ] Flatten gal took : 12 ms
[2022-05-17 06:07:46] [INFO ] Applying decomposition
[2022-05-17 06:07:46] [INFO ] Flatten gal took : 13 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/graph86646184797547568.txt' '-o' '/tmp/graph86646184797547568.bin' '-w' '/tmp/graph86646184797547568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph86646184797547568.bin' '-l' '-1' '-v' '-w' '/tmp/graph86646184797547568.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:07:46] [INFO ] Decomposing Gal with order
[2022-05-17 06:07:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:07:46] [INFO ] Removed a total of 92 redundant transitions.
[2022-05-17 06:07:46] [INFO ] Flatten gal took : 29 ms
[2022-05-17 06:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 2 ms.
[2022-05-17 06:07:46] [INFO ] Time to serialize gal into /tmp/LTL8186386873768007064.gal : 3 ms
[2022-05-17 06:07:46] [INFO ] Time to serialize properties into /tmp/LTL17946288218061877071.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/LTL8186386873768007064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17946288218061877071.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8186386...246
Read 1 LTL properties
Checking formula 0 : !((G(X("(u44.p77==0)"))))
Formula 0 simplified : !GX"(u44.p77==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11515845807431974865
[2022-05-17 06:08:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11515845807431974865
Running compilation step : cd /tmp/ltsmin11515845807431974865;'/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 643 ms.
Running link step : cd /tmp/ltsmin11515845807431974865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11515845807431974865;'/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 DES-PT-40b-LTLCardinality-03 finished in 195744 ms.
[2022-05-17 06:08:17] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14050996009493847613
[2022-05-17 06:08:17] [INFO ] Computing symmetric may disable matrix : 344 transitions.
[2022-05-17 06:08:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:08:17] [INFO ] Computing symmetric may enable matrix : 344 transitions.
[2022-05-17 06:08:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:08:17] [INFO ] Applying decomposition
[2022-05-17 06:08:17] [INFO ] Flatten gal took : 13 ms
[2022-05-17 06:08:17] [INFO ] Computing Do-Not-Accords matrix : 344 transitions.
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/graph1374544528124580188.txt' '-o' '/tmp/graph1374544528124580188.bin' '-w' '/tmp/graph1374544528124580188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1374544528124580188.bin' '-l' '-1' '-v' '-w' '/tmp/graph1374544528124580188.weights' '-q' '0' '-e' '0.001'
[2022-05-17 06:08:17] [INFO ] Decomposing Gal with order
[2022-05-17 06:08:17] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 06:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:08:17] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14050996009493847613
Running compilation step : cd /tmp/ltsmin14050996009493847613;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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-17 06:08:17] [INFO ] Removed a total of 13 redundant transitions.
[2022-05-17 06:08:17] [INFO ] Flatten gal took : 25 ms
[2022-05-17 06:08:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2022-05-17 06:08:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality12133696669465131118.gal : 4 ms
[2022-05-17 06:08:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality2362835962602772595.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/LTLCardinality12133696669465131118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2362835962602772595.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(X("(i11.u80.p77==0)"))))
Formula 0 simplified : !GX"(i11.u80.p77==0)"
Compilation finished in 1099 ms.
Running link step : cd /tmp/ltsmin14050996009493847613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14050996009493847613;'/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'
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t120, t255, t304, t337, u9.t220, u9.t221, u9.t222, u9.t223, u9.t224, u9.t225, u9.t22...1122
Computing Next relation with stutter on 1.73573e+08 deadlock states
Detected timeout of ITS tools.
[2022-05-17 06:30:53] [INFO ] Applying decomposition
[2022-05-17 06:30:53] [INFO ] Flatten gal took : 43 ms
[2022-05-17 06:30:53] [INFO ] Decomposing Gal with order
[2022-05-17 06:30:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 06:30:53] [INFO ] Removed a total of 165 redundant transitions.
[2022-05-17 06:30:53] [INFO ] Flatten gal took : 117 ms
[2022-05-17 06:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 32 ms.
[2022-05-17 06:30:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality16820363311667221871.gal : 19 ms
[2022-05-17 06:30:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality16213781175887013343.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/LTLCardinality16820363311667221871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16213781175887013343.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G(X("(i0.i0.i0.u5.p77==0)"))))
Formula 0 simplified : !GX"(i0.i0.i0.u5.p77==0)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: [](X((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: "[](X((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.088: DFS-FIFO for weak LTL, using special progress label 346
pins2lts-mc-linux64( 0/ 8), 0.088: There are 347 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.088: State length is 403, there are 348 groups
pins2lts-mc-linux64( 0/ 8), 0.088: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.088: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.088: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.088: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.099: ~1 levels ~960 states ~4176 transitions
pins2lts-mc-linux64( 5/ 8), 0.126: ~1 levels ~1920 states ~8856 transitions
pins2lts-mc-linux64( 5/ 8), 0.184: ~1 levels ~3840 states ~18592 transitions
pins2lts-mc-linux64( 5/ 8), 0.364: ~1 levels ~7680 states ~39704 transitions
pins2lts-mc-linux64( 5/ 8), 0.637: ~1 levels ~15360 states ~89608 transitions
pins2lts-mc-linux64( 6/ 8), 1.162: ~1 levels ~30720 states ~170760 transitions
pins2lts-mc-linux64( 5/ 8), 2.176: ~1 levels ~61440 states ~411584 transitions
pins2lts-mc-linux64( 5/ 8), 3.964: ~1 levels ~122880 states ~839296 transitions
pins2lts-mc-linux64( 5/ 8), 6.985: ~1 levels ~245760 states ~1721760 transitions
pins2lts-mc-linux64( 5/ 8), 11.849: ~1 levels ~491520 states ~3548648 transitions
pins2lts-mc-linux64( 5/ 8), 19.939: ~1 levels ~983040 states ~7232352 transitions
pins2lts-mc-linux64( 5/ 8), 35.198: ~1 levels ~1966080 states ~14789640 transitions
pins2lts-mc-linux64( 5/ 8), 70.465: ~1 levels ~3932160 states ~34193240 transitions
pins2lts-mc-linux64( 7/ 8), 145.448: ~1 levels ~7864320 states ~76915296 transitions
pins2lts-mc-linux64( 7/ 8), 290.602: ~1 levels ~15728640 states ~158454440 transitions
pins2lts-mc-linux64( 7/ 8), 589.633: ~1 levels ~31457280 states ~330627752 transitions
pins2lts-mc-linux64( 7/ 8), 1194.498: ~1 levels ~62914560 states ~680171072 transitions
pins2lts-mc-linux64( 3/ 8), 1698.544: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1698.637:
pins2lts-mc-linux64( 0/ 8), 1698.638: mean standard work distribution: 5.4% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1698.638:
pins2lts-mc-linux64( 0/ 8), 1698.638: Explored 78901156 states 973376283 transitions, fanout: 12.337
pins2lts-mc-linux64( 0/ 8), 1698.638: Total exploration time 1698.520 sec (1698.460 sec minimum, 1698.486 sec on average)
pins2lts-mc-linux64( 0/ 8), 1698.638: States per second: 46453, Transitions per second: 573073
pins2lts-mc-linux64( 0/ 8), 1698.638:
pins2lts-mc-linux64( 0/ 8), 1698.638: Progress states detected: 134217388
pins2lts-mc-linux64( 0/ 8), 1698.638: Redundant explorations: -41.2139
pins2lts-mc-linux64( 0/ 8), 1698.638:
pins2lts-mc-linux64( 0/ 8), 1698.638: Queue width: 8B, total height: 97520198, memory: 744.02MB
pins2lts-mc-linux64( 0/ 8), 1698.638: Tree memory: 1188.2MB, 9.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1698.638: Tree fill ratio (roots/leafs): 99.0%/64.0%
pins2lts-mc-linux64( 0/ 8), 1698.638: Stored 346 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1698.638: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1698.638: Est. total memory use: 1932.3MB (~1768.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14050996009493847613;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14050996009493847613;'/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'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 06:53:30] [INFO ] Flatten gal took : 16 ms
[2022-05-17 06:53:30] [INFO ] Input system was already deterministic with 344 transitions.
[2022-05-17 06:53:30] [INFO ] Transformed 402 places.
[2022-05-17 06:53:30] [INFO ] Transformed 344 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 06:53:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality13219126998957998728.gal : 4 ms
[2022-05-17 06:53:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality12403295287397574691.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13219126998957998728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12403295287397574691.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X("(p77==0)"))))
Formula 0 simplified : !GX"(p77==0)"
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="DES-PT-40b"
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 DES-PT-40b, 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 r042-smll-165252095800507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;