About the Execution of ITS-Tools for FamilyReunion-PT-L00050M0005C002P002G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16141.859 | 3600000.00 | 13035476.00 | 4735.40 | TFFF?F?FFTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110700732.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110700732
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.4M
-rw-r--r-- 1 mcc users 101K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 605K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 30 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 1002K Apr 30 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 64K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 277K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M 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 FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652723041811
Running Version 202205111006
[2022-05-16 17:44:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 17:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:44:03] [INFO ] Load time of PNML (sax parser for PT used): 383 ms
[2022-05-16 17:44:03] [INFO ] Transformed 12194 places.
[2022-05-16 17:44:03] [INFO ] Transformed 10560 transitions.
[2022-05-16 17:44:03] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 548 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
Support contains 3127 out of 12177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Reduce places removed 173 places and 0 transitions.
Discarding 1224 places :
Implicit places reduction removed 1224 places
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 10780 transition count 10560
Discarding 817 places :
Symmetric choice reduction at 1 with 817 rule applications. Total rules 2214 place count 9963 transition count 9692
Iterating global reduction 1 with 817 rules applied. Total rules applied 3031 place count 9963 transition count 9692
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 3389 place count 9605 transition count 9184
Iterating global reduction 1 with 358 rules applied. Total rules applied 3747 place count 9605 transition count 9184
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 3798 place count 9554 transition count 9184
Applied a total of 3798 rules in 3947 ms. Remains 9554 /12177 variables (removed 2623) and now considering 9184/10560 (removed 1376) transitions.
// Phase 1: matrix 9184 rows 9554 cols
[2022-05-16 17:44:08] [INFO ] Computed 1382 place invariants in 599 ms
[2022-05-16 17:44:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:44:10] [INFO ] Implicit Places using invariants in 2515 ms returned []
// Phase 1: matrix 9184 rows 9554 cols
[2022-05-16 17:44:10] [INFO ] Computed 1382 place invariants in 253 ms
[2022-05-16 17:44:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:44:11] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 3862 ms to find 0 implicit places.
// Phase 1: matrix 9184 rows 9554 cols
[2022-05-16 17:44:11] [INFO ] Computed 1382 place invariants in 246 ms
[2022-05-16 17:44:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:44:12] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9554/12177 places, 9184/10560 transitions.
Finished structural reductions, in 1 iterations. Remains : 9554/12177 places, 9184/10560 transitions.
Support contains 3127 out of 9554 places after structural reductions.
[2022-05-16 17:44:13] [INFO ] Flatten gal took : 473 ms
[2022-05-16 17:44:14] [INFO ] Flatten gal took : 293 ms
[2022-05-16 17:44:14] [INFO ] Input system was already deterministic with 9184 transitions.
Support contains 3126 out of 9554 places (down from 3127) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 35) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 9184 rows 9554 cols
[2022-05-16 17:44:16] [INFO ] Computed 1382 place invariants in 218 ms
[2022-05-16 17:44:19] [INFO ] [Real]Absence check using 0 positive and 1382 generalized place invariants in 627 ms returned sat
[2022-05-16 17:44:36] [INFO ] After 16177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-16 17:44:37] [INFO ] After 16904ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 17:44:37] [INFO ] After 20716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 17:44:39] [INFO ] [Nat]Absence check using 0 positive and 1382 generalized place invariants in 615 ms returned sat
[2022-05-16 17:44:57] [INFO ] After 16304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-16 17:45:02] [INFO ] After 21436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 17:45:02] [INFO ] After 25134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1729 steps, including 0 resets, run visited all 8 properties in 97 ms. (steps per millisecond=17 )
Parikh walk visited 8 properties in 106 ms.
Computed a total of 9554 stabilizing places and 9184 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9554 transition count 9184
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((G(p2)&&p1)))))'
Support contains 513 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 868 places :
Symmetric choice reduction at 1 with 868 rule applications. Total rules 1480 place count 8074 transition count 8316
Iterating global reduction 1 with 868 rules applied. Total rules applied 2348 place count 8074 transition count 8316
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2399 place count 8023 transition count 8316
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 2508 place count 7914 transition count 7907
Iterating global reduction 2 with 109 rules applied. Total rules applied 2617 place count 7914 transition count 7907
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2719 place count 7812 transition count 7907
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2974 place count 7557 transition count 7652
Iterating global reduction 3 with 255 rules applied. Total rules applied 3229 place count 7557 transition count 7652
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3484 place count 7302 transition count 7397
Iterating global reduction 3 with 255 rules applied. Total rules applied 3739 place count 7302 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3994 place count 7047 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 4249 place count 7047 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4504 place count 6792 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 4759 place count 6792 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5014 place count 6537 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 5269 place count 6537 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5524 place count 6282 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 5779 place count 6282 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6034 place count 6027 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 6289 place count 6027 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6544 place count 5772 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 6799 place count 5772 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7054 place count 5517 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 7309 place count 5517 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7564 place count 5262 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 7819 place count 5262 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8074 place count 5007 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 8329 place count 5007 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8584 place count 4752 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 8839 place count 4752 transition count 4847
Applied a total of 8839 rules in 13672 ms. Remains 4752 /9554 variables (removed 4802) and now considering 4847/9184 (removed 4337) transitions.
// Phase 1: matrix 4847 rows 4752 cols
[2022-05-16 17:45:16] [INFO ] Computed 617 place invariants in 62 ms
[2022-05-16 17:45:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:18] [INFO ] Implicit Places using invariants in 1333 ms returned [391, 2161, 3004]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1340 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4749/9554 places, 4847/9184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4748 transition count 4846
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4748 transition count 4846
Applied a total of 2 rules in 724 ms. Remains 4748 /4749 variables (removed 1) and now considering 4846/4847 (removed 1) transitions.
// Phase 1: matrix 4846 rows 4748 cols
[2022-05-16 17:45:18] [INFO ] Computed 614 place invariants in 76 ms
[2022-05-16 17:45:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:20] [INFO ] Implicit Places using invariants in 1411 ms returned [394, 2995]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1419 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4746/9554 places, 4846/9184 transitions.
Applied a total of 0 rules in 374 ms. Remains 4746 /4746 variables (removed 0) and now considering 4846/4846 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4746/9554 places, 4846/9184 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1122 1) (GEQ s1301 1)) (AND (GEQ s1121 1) (GEQ s1287 1)) (AND (GEQ s1120 1) (GEQ s1277 1)) (AND (GEQ s1121 1) (GEQ s1291 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 55 reset in 3589 ms.
Product exploration explored 100000 steps with 53 reset in 3513 ms.
Computed a total of 4746 stabilizing places and 4846 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4746 transition count 4846
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 6 factoid took 337 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 finished in 26561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((G(p0) U p1))))&&(!p2 U X(p3))))'
Support contains 1173 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 9248 transition count 9184
Discarding 257 places :
Symmetric choice reduction at 1 with 257 rule applications. Total rules 563 place count 8991 transition count 8877
Iterating global reduction 1 with 257 rules applied. Total rules applied 820 place count 8991 transition count 8877
Discarding 155 places :
Symmetric choice reduction at 1 with 155 rule applications. Total rules 975 place count 8836 transition count 8672
Iterating global reduction 1 with 155 rules applied. Total rules applied 1130 place count 8836 transition count 8672
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 255 rules applied. Total rules applied 1385 place count 8734 transition count 8519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1386 place count 8733 transition count 8468
Iterating global reduction 2 with 1 rules applied. Total rules applied 1387 place count 8733 transition count 8468
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 1438 place count 8682 transition count 8417
Iterating global reduction 2 with 51 rules applied. Total rules applied 1489 place count 8682 transition count 8417
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 1591 place count 8631 transition count 8366
Applied a total of 1591 rules in 6857 ms. Remains 8631 /9554 variables (removed 923) and now considering 8366/9184 (removed 818) transitions.
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 17:45:36] [INFO ] Computed 923 place invariants in 170 ms
[2022-05-16 17:45:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:37] [INFO ] Implicit Places using invariants in 1067 ms returned []
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 17:45:37] [INFO ] Computed 923 place invariants in 159 ms
[2022-05-16 17:45:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:38] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
// Phase 1: matrix 8366 rows 8631 cols
[2022-05-16 17:45:38] [INFO ] Computed 923 place invariants in 174 ms
[2022-05-16 17:45:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:39] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8631/9554 places, 8366/9184 transitions.
Finished structural reductions, in 1 iterations. Remains : 8631/9554 places, 8366/9184 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p3) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p2:(OR (GEQ s8133 1) (GEQ s8064 1) (GEQ s8137 1) (GEQ s8060 1) (GEQ s8125 1) (GEQ s8072 1) (GEQ s8129 1) (GEQ s8068 1) (GEQ s8019 1) (GEQ s8149 1) (GEQ s8...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2923 steps with 0 reset in 129 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 finished in 10636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(X(F(X(G(p0)))))))))'
Support contains 255 out of 9554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Graph (complete) has 13623 edges and 9554 vertex of which 9042 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.40 ms
Discarding 512 places :
Also discarding 460 output transitions
Drop transitions removed 460 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 5100 transitions
Trivial Post-agglo rules discarded 5100 transitions
Performed 5100 trivial Post agglomeration. Transition count delta: 5100
Iterating post reduction 0 with 5712 rules applied. Total rules applied 5713 place count 8379 transition count 3573
Reduce places removed 5100 places and 0 transitions.
Iterating post reduction 1 with 5100 rules applied. Total rules applied 10813 place count 3279 transition count 3573
Performed 764 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 764 Pre rules applied. Total rules applied 10813 place count 3279 transition count 2809
Deduced a syphon composed of 764 places in 2 ms
Ensure Unique test removed 306 places
Reduce places removed 1070 places and 0 transitions.
Iterating global reduction 2 with 1834 rules applied. Total rules applied 12647 place count 2209 transition count 2809
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 12851 place count 2209 transition count 2605
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 306 rules applied. Total rules applied 13157 place count 2005 transition count 2503
Discarding 365 places :
Symmetric choice reduction at 4 with 365 rule applications. Total rules 13522 place count 1640 transition count 1838
Iterating global reduction 4 with 365 rules applied. Total rules applied 13887 place count 1640 transition count 1838
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 4 with 510 rules applied. Total rules applied 14397 place count 1487 transition count 1481
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 5 with 255 rules applied. Total rules applied 14652 place count 1232 transition count 1481
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 53 Pre rules applied. Total rules applied 14652 place count 1232 transition count 1428
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 14758 place count 1179 transition count 1428
Discarding 256 places :
Symmetric choice reduction at 6 with 256 rule applications. Total rules 15014 place count 923 transition count 1122
Iterating global reduction 6 with 256 rules applied. Total rules applied 15270 place count 923 transition count 1122
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 15525 place count 923 transition count 867
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 15525 place count 923 transition count 816
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 15678 place count 821 transition count 816
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 15831 place count 719 transition count 765
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 15882 place count 668 transition count 714
Applied a total of 15882 rules in 551 ms. Remains 668 /9554 variables (removed 8886) and now considering 714/9184 (removed 8470) transitions.
// Phase 1: matrix 714 rows 668 cols
[2022-05-16 17:45:40] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-16 17:45:41] [INFO ] Implicit Places using invariants in 333 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 306, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 615, 616]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 336 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/9554 places, 714/9184 transitions.
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 512 transition count 612
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 461 transition count 612
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 102 place count 461 transition count 510
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 306 place count 359 transition count 510
Applied a total of 306 rules in 16 ms. Remains 359 /563 variables (removed 204) and now considering 510/714 (removed 204) transitions.
// Phase 1: matrix 510 rows 359 cols
[2022-05-16 17:45:41] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 17:45:41] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 510 rows 359 cols
[2022-05-16 17:45:41] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 17:45:41] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 359/9554 places, 510/9184 transitions.
Finished structural reductions, in 2 iterations. Remains : 359/9554 places, 510/9184 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s274 1) (LT s278 1) (LT s282 1) (LT s286 1) (LT s290 1) (LT s229 1) (LT s294 1) (LT s233 1) (LT s298 1) (LT s237 1) (LT s302 1) (LT s242 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 finished in 1259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 204 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 869 places :
Symmetric choice reduction at 1 with 869 rule applications. Total rules 1481 place count 8073 transition count 8265
Iterating global reduction 1 with 869 rules applied. Total rules applied 2350 place count 8073 transition count 8265
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2401 place count 8022 transition count 8265
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 2612 place count 7811 transition count 7754
Iterating global reduction 2 with 211 rules applied. Total rules applied 2823 place count 7811 transition count 7754
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Iterating post reduction 2 with 255 rules applied. Total rules applied 3078 place count 7658 transition count 7652
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 3334 place count 7402 transition count 7346
Iterating global reduction 3 with 256 rules applied. Total rules applied 3590 place count 7402 transition count 7346
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3845 place count 7147 transition count 7091
Iterating global reduction 3 with 255 rules applied. Total rules applied 4100 place count 7147 transition count 7091
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4355 place count 6892 transition count 6836
Iterating global reduction 3 with 255 rules applied. Total rules applied 4610 place count 6892 transition count 6836
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4865 place count 6637 transition count 6581
Iterating global reduction 3 with 255 rules applied. Total rules applied 5120 place count 6637 transition count 6581
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5375 place count 6382 transition count 6326
Iterating global reduction 3 with 255 rules applied. Total rules applied 5630 place count 6382 transition count 6326
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5885 place count 6127 transition count 6071
Iterating global reduction 3 with 255 rules applied. Total rules applied 6140 place count 6127 transition count 6071
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6395 place count 5872 transition count 5816
Iterating global reduction 3 with 255 rules applied. Total rules applied 6650 place count 5872 transition count 5816
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6905 place count 5617 transition count 5561
Iterating global reduction 3 with 255 rules applied. Total rules applied 7160 place count 5617 transition count 5561
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7415 place count 5362 transition count 5306
Iterating global reduction 3 with 255 rules applied. Total rules applied 7670 place count 5362 transition count 5306
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7925 place count 5107 transition count 5051
Iterating global reduction 3 with 255 rules applied. Total rules applied 8180 place count 5107 transition count 5051
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8435 place count 4852 transition count 4796
Iterating global reduction 3 with 255 rules applied. Total rules applied 8690 place count 4852 transition count 4796
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8945 place count 4597 transition count 4541
Iterating global reduction 3 with 255 rules applied. Total rules applied 9200 place count 4597 transition count 4541
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9455 place count 4342 transition count 4286
Iterating global reduction 3 with 255 rules applied. Total rules applied 9710 place count 4342 transition count 4286
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 10016 place count 4291 transition count 4031
Applied a total of 10016 rules in 13838 ms. Remains 4291 /9554 variables (removed 5263) and now considering 4031/9184 (removed 5153) transitions.
// Phase 1: matrix 4031 rows 4291 cols
[2022-05-16 17:45:55] [INFO ] Computed 515 place invariants in 48 ms
[2022-05-16 17:45:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:45:56] [INFO ] Implicit Places using invariants in 1229 ms returned [454]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4290/9554 places, 4031/9184 transitions.
Applied a total of 0 rules in 353 ms. Remains 4290 /4290 variables (removed 0) and now considering 4031/4031 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4290/9554 places, 4031/9184 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s261 1) (GEQ s263 1) (GEQ s257 1) (GEQ s259 1) (GEQ s269 1) (GEQ s271 1) (GEQ s265 1) (GEQ s267 1) (GEQ s277 1) (GEQ s279 1) (GEQ s273 1) (GEQ...], 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 1759 steps with 0 reset in 32 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 finished in 15624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Support contains 255 out of 9554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Graph (complete) has 13623 edges and 9554 vertex of which 7810 are kept as prefixes of interest. Removing 1744 places using SCC suffix rule.13 ms
Discarding 1744 places :
Also discarding 1687 output transitions
Drop transitions removed 1687 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 4692 transitions
Trivial Post-agglo rules discarded 4692 transitions
Performed 4692 trivial Post agglomeration. Transition count delta: 4692
Iterating post reduction 0 with 5304 rules applied. Total rules applied 5305 place count 7147 transition count 2754
Reduce places removed 4692 places and 0 transitions.
Iterating post reduction 1 with 4692 rules applied. Total rules applied 9997 place count 2455 transition count 2754
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 459 Pre rules applied. Total rules applied 9997 place count 2455 transition count 2295
Deduced a syphon composed of 459 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 2 with 1071 rules applied. Total rules applied 11068 place count 1843 transition count 2295
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11221 place count 1843 transition count 2142
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 11476 place count 1690 transition count 2040
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 11736 place count 1430 transition count 1530
Iterating global reduction 4 with 260 rules applied. Total rules applied 11996 place count 1430 transition count 1530
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 12098 place count 1379 transition count 1479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 12149 place count 1328 transition count 1479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 12149 place count 1328 transition count 1428
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 12251 place count 1277 transition count 1428
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 12506 place count 1022 transition count 1173
Iterating global reduction 6 with 255 rules applied. Total rules applied 12761 place count 1022 transition count 1173
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 13016 place count 1022 transition count 918
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 13016 place count 1022 transition count 867
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 13169 place count 920 transition count 867
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 7 with 255 rules applied. Total rules applied 13424 place count 767 transition count 765
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 13475 place count 716 transition count 714
Applied a total of 13475 rules in 373 ms. Remains 716 /9554 variables (removed 8838) and now considering 714/9184 (removed 8470) transitions.
// Phase 1: matrix 714 rows 716 cols
[2022-05-16 17:45:57] [INFO ] Computed 104 place invariants in 5 ms
[2022-05-16 17:45:57] [INFO ] Implicit Places using invariants in 218 ms returned [51, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 562]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 238 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 663/9554 places, 714/9184 transitions.
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 612 transition count 612
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 561 transition count 612
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 561 transition count 561
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 510 transition count 561
Applied a total of 204 rules in 12 ms. Remains 510 /663 variables (removed 153) and now considering 561/714 (removed 153) transitions.
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:45:57] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 17:45:57] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:45:57] [INFO ] Computed 51 place invariants in 8 ms
[2022-05-16 17:45:58] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/9554 places, 561/9184 transitions.
Finished structural reductions, in 2 iterations. Remains : 510/9554 places, 561/9184 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s471 1) (GEQ s469 1) (GEQ s467 1) (GEQ s465 1) (GEQ s463 1) (GEQ s461 1) (GEQ s459 1) (GEQ s487 1) (GEQ s485 1) (GEQ s483 1) (GEQ s481 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1506 reset in 1347 ms.
Product exploration explored 100000 steps with 1508 reset in 1351 ms.
Computed a total of 510 stabilizing places and 561 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 510 transition count 561
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 62 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:02] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 17:46:03] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 23 ms returned sat
[2022-05-16 17:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:04] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2022-05-16 17:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:46:05] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 53 ms returned sat
[2022-05-16 17:46:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:06] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-05-16 17:46:06] [INFO ] Computed and/alt/rep : 408/969/408 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-16 17:46:07] [INFO ] Added : 156 causal constraints over 32 iterations in 1257 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:07] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:07] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 12 ms returned sat
[2022-05-16 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:07] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-16 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:46:08] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 12 ms returned sat
[2022-05-16 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:08] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-05-16 17:46:08] [INFO ] Computed and/alt/rep : 408/969/408 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-16 17:46:09] [INFO ] Added : 180 causal constraints over 37 iterations in 1308 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 255 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 561/561 transitions.
Applied a total of 0 rules in 12 ms. Remains 510 /510 variables (removed 0) and now considering 561/561 (removed 0) transitions.
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:09] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-16 17:46:09] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:09] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:10] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-05-16 17:46:10] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:10] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:10] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/510 places, 561/561 transitions.
Computed a total of 510 stabilizing places and 561 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 510 transition count 561
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 70 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 393 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:11] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:13] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 23 ms returned sat
[2022-05-16 17:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:13] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-16 17:46:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:46:15] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 23 ms returned sat
[2022-05-16 17:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:15] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2022-05-16 17:46:15] [INFO ] Computed and/alt/rep : 408/969/408 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-16 17:46:16] [INFO ] Added : 156 causal constraints over 32 iterations in 1190 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:16] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:17] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 12 ms returned sat
[2022-05-16 17:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:17] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-16 17:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:46:17] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 17:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:46:17] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-05-16 17:46:17] [INFO ] Computed and/alt/rep : 408/969/408 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-16 17:46:19] [INFO ] Added : 180 causal constraints over 37 iterations in 1298 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1528 reset in 1349 ms.
Product exploration explored 100000 steps with 1509 reset in 1367 ms.
Built C files in :
/tmp/ltsmin6916510382951761891
[2022-05-16 17:46:21] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2022-05-16 17:46:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:21] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2022-05-16 17:46:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:22] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2022-05-16 17:46:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:22] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6916510382951761891
Running compilation step : cd /tmp/ltsmin6916510382951761891;'/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 1336 ms.
Running link step : cd /tmp/ltsmin6916510382951761891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6916510382951761891;'/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/stateBased16237248170682068783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 255 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 561/561 transitions.
Applied a total of 0 rules in 5 ms. Remains 510 /510 variables (removed 0) and now considering 561/561 (removed 0) transitions.
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:37] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-16 17:46:37] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:37] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-16 17:46:37] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2022-05-16 17:46:37] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 561 rows 510 cols
[2022-05-16 17:46:37] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-16 17:46:37] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/510 places, 561/561 transitions.
Built C files in :
/tmp/ltsmin9008325077766607225
[2022-05-16 17:46:37] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2022-05-16 17:46:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:37] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2022-05-16 17:46:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:37] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2022-05-16 17:46:37] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:46:37] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9008325077766607225
Running compilation step : cd /tmp/ltsmin9008325077766607225;'/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 1208 ms.
Running link step : cd /tmp/ltsmin9008325077766607225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9008325077766607225;'/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/stateBased13948671891867201813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 17:46:52] [INFO ] Flatten gal took : 17 ms
[2022-05-16 17:46:53] [INFO ] Flatten gal took : 16 ms
[2022-05-16 17:46:53] [INFO ] Time to serialize gal into /tmp/LTL10851075266108383615.gal : 6 ms
[2022-05-16 17:46:53] [INFO ] Time to serialize properties into /tmp/LTL9402778540464485998.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/LTL10851075266108383615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9402778540464485998.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/LTL1085107...267
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((l21_12>=1)||(l21_10>=1))||((l21_8>=1)||(l21_6>=1)))||(((l21_4>=1)||(l21_2>=1))||((l21_0>=1)||(l21_28>=1))))||((((l21_2...5625
Formula 0 simplified : !F("((((((((((lc0_3>=1)&&(cl1_3_2>=1))||((lc0_20>=1)&&(cl1_20_1>=1)))||(((lc0_37>=1)&&(cl1_37_0>=1))||((lc0_15>=1)&&(cl1_15_1>=1))))...5618
Reverse transition relation is NOT exact ! Due to transitions t8929, t8930, t8931, t8932, t8933, t8934, t8935, t8936, t8937, t8938, t8939, t8940, t8941, t8...519
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 17:47:08] [INFO ] Flatten gal took : 16 ms
[2022-05-16 17:47:08] [INFO ] Applying decomposition
[2022-05-16 17:47:08] [INFO ] Flatten gal took : 14 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/graph14713918898074649405.txt' '-o' '/tmp/graph14713918898074649405.bin' '-w' '/tmp/graph14713918898074649405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14713918898074649405.bin' '-l' '-1' '-v' '-w' '/tmp/graph14713918898074649405.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:47:08] [INFO ] Decomposing Gal with order
[2022-05-16 17:47:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:47:08] [INFO ] Removed a total of 204 redundant transitions.
[2022-05-16 17:47:08] [INFO ] Flatten gal took : 176 ms
[2022-05-16 17:47:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 17:47:08] [INFO ] Time to serialize gal into /tmp/LTL8340182995088097503.gal : 17 ms
[2022-05-16 17:47:08] [INFO ] Time to serialize properties into /tmp/LTL4919037298115393649.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/LTL8340182995088097503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4919037298115393649.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/LTL8340182...245
Read 1 LTL properties
Checking formula 0 : !((F((F("(((((((i6.u7.l21_12>=1)||(i47.u6.l21_10>=1))||((i26.u36.l21_8>=1)||(i4.u4.l21_6>=1)))||(((i3.u3.l21_4>=1)||(i1.u1.l21_2>=1))|...8475
Formula 0 simplified : !F("((((((((((i2.u2.lc0_3>=1)&&(i2.u177.cl1_3_2>=1))||((i39.u13.lc0_20>=1)&&(i39.u80.cl1_20_1>=1)))||(((i33.u46.lc0_37>=1)&&(i33.u14...8468
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t8929, i1.u1.t8931, i2.u2.t8932, i3.u3.t8933, i4.u4.t8935, i5.u5.t8938, i6.u7.t8941, i7...907
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5090445576276193781
[2022-05-16 17:47:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5090445576276193781
Running compilation step : cd /tmp/ltsmin5090445576276193781;'/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 819 ms.
Running link step : cd /tmp/ltsmin5090445576276193781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5090445576276193781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 101742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(F(G(G(X(F(p1))))))))'
Support contains 714 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 9248 transition count 9184
Discarding 818 places :
Symmetric choice reduction at 1 with 818 rule applications. Total rules 1124 place count 8430 transition count 8316
Iterating global reduction 1 with 818 rules applied. Total rules applied 1942 place count 8430 transition count 8316
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1993 place count 8379 transition count 8316
Discarding 261 places :
Symmetric choice reduction at 2 with 261 rule applications. Total rules 2254 place count 8118 transition count 7805
Iterating global reduction 2 with 261 rules applied. Total rules applied 2515 place count 8118 transition count 7805
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 255 rules applied. Total rules applied 2770 place count 8016 transition count 7652
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 3026 place count 7760 transition count 7346
Iterating global reduction 3 with 256 rules applied. Total rules applied 3282 place count 7760 transition count 7346
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 3333 place count 7709 transition count 7295
Iterating global reduction 3 with 51 rules applied. Total rules applied 3384 place count 7709 transition count 7295
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 102 rules applied. Total rules applied 3486 place count 7658 transition count 7244
Applied a total of 3486 rules in 6216 ms. Remains 7658 /9554 variables (removed 1896) and now considering 7244/9184 (removed 1940) transitions.
// Phase 1: matrix 7244 rows 7658 cols
[2022-05-16 17:47:45] [INFO ] Computed 872 place invariants in 120 ms
[2022-05-16 17:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:47:47] [INFO ] Implicit Places using invariants in 2002 ms returned [6274]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2007 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7657/9554 places, 7244/9184 transitions.
Applied a total of 0 rules in 1112 ms. Remains 7657 /7657 variables (removed 0) and now considering 7244/7244 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7657/9554 places, 7244/9184 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s4293 1) (GEQ s5010 1)) (AND (GEQ s4145 1) (GEQ s4862 1)) (AND (GEQ s4135 1) (GEQ s4852 1)) (AND (GEQ s4155 1) (GEQ s4872 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 finished in 9547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X((X(X(p1))&&G(p2))))))))'
Support contains 357 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 666 places :
Symmetric choice reduction at 1 with 666 rule applications. Total rules 1278 place count 8276 transition count 8468
Iterating global reduction 1 with 666 rules applied. Total rules applied 1944 place count 8276 transition count 8468
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2104 place count 8116 transition count 8008
Iterating global reduction 1 with 160 rules applied. Total rules applied 2264 place count 8116 transition count 8008
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 2417 place count 8014 transition count 7957
Discarding 256 places :
Symmetric choice reduction at 2 with 256 rule applications. Total rules 2673 place count 7758 transition count 7651
Iterating global reduction 2 with 256 rules applied. Total rules applied 2929 place count 7758 transition count 7651
Discarding 306 places :
Symmetric choice reduction at 2 with 306 rule applications. Total rules 3235 place count 7452 transition count 7345
Iterating global reduction 2 with 306 rules applied. Total rules applied 3541 place count 7452 transition count 7345
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 3643 place count 7401 transition count 7294
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3898 place count 7146 transition count 7039
Iterating global reduction 3 with 255 rules applied. Total rules applied 4153 place count 7146 transition count 7039
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4408 place count 6891 transition count 6784
Iterating global reduction 3 with 255 rules applied. Total rules applied 4663 place count 6891 transition count 6784
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4918 place count 6636 transition count 6529
Iterating global reduction 3 with 255 rules applied. Total rules applied 5173 place count 6636 transition count 6529
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5428 place count 6381 transition count 6274
Iterating global reduction 3 with 255 rules applied. Total rules applied 5683 place count 6381 transition count 6274
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5938 place count 6126 transition count 6019
Iterating global reduction 3 with 255 rules applied. Total rules applied 6193 place count 6126 transition count 6019
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6448 place count 5871 transition count 5764
Iterating global reduction 3 with 255 rules applied. Total rules applied 6703 place count 5871 transition count 5764
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6958 place count 5616 transition count 5509
Iterating global reduction 3 with 255 rules applied. Total rules applied 7213 place count 5616 transition count 5509
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7468 place count 5361 transition count 5254
Iterating global reduction 3 with 255 rules applied. Total rules applied 7723 place count 5361 transition count 5254
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7978 place count 5106 transition count 4999
Iterating global reduction 3 with 255 rules applied. Total rules applied 8233 place count 5106 transition count 4999
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8488 place count 4851 transition count 4744
Iterating global reduction 3 with 255 rules applied. Total rules applied 8743 place count 4851 transition count 4744
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8998 place count 4596 transition count 4489
Iterating global reduction 3 with 255 rules applied. Total rules applied 9253 place count 4596 transition count 4489
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9559 place count 4545 transition count 4234
Applied a total of 9559 rules in 14299 ms. Remains 4545 /9554 variables (removed 5009) and now considering 4234/9184 (removed 4950) transitions.
// Phase 1: matrix 4234 rows 4545 cols
[2022-05-16 17:48:02] [INFO ] Computed 566 place invariants in 55 ms
[2022-05-16 17:48:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:48:03] [INFO ] Implicit Places using invariants in 1345 ms returned [1723, 3152, 3162]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1349 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4542/9554 places, 4234/9184 transitions.
Applied a total of 0 rules in 393 ms. Remains 4542 /4542 variables (removed 0) and now considering 4234/4234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4542/9554 places, 4234/9184 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=1, aps=[p0:(OR (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ s220 1) (GEQ s226 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1598 ms.
Product exploration explored 100000 steps with 62 reset in 1597 ms.
Computed a total of 4542 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4542 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Finished random walk after 1653 steps, including 0 resets, run visited all 5 properties in 83 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 357 out of 4542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4542/4542 places, 4234/4234 transitions.
Applied a total of 0 rules in 355 ms. Remains 4542 /4542 variables (removed 0) and now considering 4234/4234 (removed 0) transitions.
// Phase 1: matrix 4234 rows 4542 cols
[2022-05-16 17:48:11] [INFO ] Computed 563 place invariants in 55 ms
[2022-05-16 17:48:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:48:12] [INFO ] Implicit Places using invariants in 1158 ms returned [3138, 3162]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4540/4542 places, 4234/4234 transitions.
Applied a total of 0 rules in 381 ms. Remains 4540 /4540 variables (removed 0) and now considering 4234/4234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4540/4542 places, 4234/4234 transitions.
Computed a total of 4540 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4540 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Finished random walk after 1715 steps, including 0 resets, run visited all 5 properties in 59 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 9 states, 13 edges and 3 AP to 9 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 62 reset in 1631 ms.
Product exploration explored 100000 steps with 62 reset in 1641 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 357 out of 4540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4540/4540 places, 4234/4234 transitions.
Graph (complete) has 5854 edges and 4540 vertex of which 4539 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1173 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1173 rules applied. Total rules applied 1174 place count 4539 transition count 4233
Performed 1021 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1021 Pre rules applied. Total rules applied 1174 place count 4539 transition count 4437
Deduced a syphon composed of 2194 places in 2 ms
Iterating global reduction 1 with 1021 rules applied. Total rules applied 2195 place count 4539 transition count 4437
Discarding 918 places :
Symmetric choice reduction at 1 with 918 rule applications. Total rules 3113 place count 3621 transition count 3519
Deduced a syphon composed of 1276 places in 2 ms
Iterating global reduction 1 with 918 rules applied. Total rules applied 4031 place count 3621 transition count 3519
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 1784 places in 2 ms
Iterating global reduction 1 with 508 rules applied. Total rules applied 4539 place count 3621 transition count 3671
Discarding 356 places :
Symmetric choice reduction at 1 with 356 rule applications. Total rules 4895 place count 3265 transition count 3315
Deduced a syphon composed of 1428 places in 2 ms
Iterating global reduction 1 with 356 rules applied. Total rules applied 5251 place count 3265 transition count 3315
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -207
Deduced a syphon composed of 1480 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 5303 place count 3265 transition count 3522
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5307 place count 3261 transition count 3510
Deduced a syphon composed of 1476 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 5311 place count 3261 transition count 3510
Deduced a syphon composed of 1476 places in 2 ms
Applied a total of 5311 rules in 2189 ms. Remains 3261 /4540 variables (removed 1279) and now considering 3510/4234 (removed 724) transitions.
[2022-05-16 17:48:22] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 3510 rows 3261 cols
[2022-05-16 17:48:22] [INFO ] Computed 561 place invariants in 71 ms
[2022-05-16 17:48:24] [INFO ] Dead Transitions using invariants and state equation in 2499 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3261/4540 places, 3510/4234 transitions.
Finished structural reductions, in 1 iterations. Remains : 3261/4540 places, 3510/4234 transitions.
Product exploration explored 100000 steps with 519 reset in 1765 ms.
Product exploration explored 100000 steps with 522 reset in 1705 ms.
Built C files in :
/tmp/ltsmin18400075073137828614
[2022-05-16 17:48:28] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18400075073137828614
Running compilation step : cd /tmp/ltsmin18400075073137828614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18400075073137828614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18400075073137828614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 357 out of 4540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4540/4540 places, 4234/4234 transitions.
Applied a total of 0 rules in 435 ms. Remains 4540 /4540 variables (removed 0) and now considering 4234/4234 (removed 0) transitions.
// Phase 1: matrix 4234 rows 4540 cols
[2022-05-16 17:48:31] [INFO ] Computed 561 place invariants in 61 ms
[2022-05-16 17:48:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:48:33] [INFO ] Implicit Places using invariants in 1274 ms returned []
// Phase 1: matrix 4234 rows 4540 cols
[2022-05-16 17:48:33] [INFO ] Computed 561 place invariants in 50 ms
[2022-05-16 17:48:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:48:34] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
// Phase 1: matrix 4234 rows 4540 cols
[2022-05-16 17:48:34] [INFO ] Computed 561 place invariants in 54 ms
[2022-05-16 17:48:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:48:36] [INFO ] Dead Transitions using invariants and state equation in 2526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4540/4540 places, 4234/4234 transitions.
Built C files in :
/tmp/ltsmin3928425295399812205
[2022-05-16 17:48:36] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3928425295399812205
Running compilation step : cd /tmp/ltsmin3928425295399812205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3928425295399812205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3928425295399812205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 17:48:40] [INFO ] Flatten gal took : 183 ms
[2022-05-16 17:48:40] [INFO ] Flatten gal took : 134 ms
[2022-05-16 17:48:40] [INFO ] Time to serialize gal into /tmp/LTL15798408373502678579.gal : 13 ms
[2022-05-16 17:48:40] [INFO ] Time to serialize properties into /tmp/LTL13375432115014920977.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/LTL15798408373502678579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13375432115014920977.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/LTL1579840...268
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((l30_2>=1)||(l30_0>=1))||((l30_6>=1)||(l30_4>=1)))||(((l30_10>=1)||(l30_8>=1))||((l30_14>=1)||(l30_12>=1))))||((((l30...6953
Formula 0 simplified : !XX(F"(((((((l30_2>=1)||(l30_0>=1))||((l30_6>=1)||(l30_4>=1)))||(((l30_10>=1)||(l30_8>=1))||((l30_14>=1)||(l30_12>=1))))||((((l30_18...6933
Detected timeout of ITS tools.
[2022-05-16 17:48:55] [INFO ] Flatten gal took : 97 ms
[2022-05-16 17:48:55] [INFO ] Applying decomposition
[2022-05-16 17:48:55] [INFO ] Flatten gal took : 99 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/graph188421851888700413.txt' '-o' '/tmp/graph188421851888700413.bin' '-w' '/tmp/graph188421851888700413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph188421851888700413.bin' '-l' '-1' '-v' '-w' '/tmp/graph188421851888700413.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:48:55] [INFO ] Decomposing Gal with order
[2022-05-16 17:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:48:57] [INFO ] Removed a total of 751 redundant transitions.
[2022-05-16 17:48:57] [INFO ] Flatten gal took : 250 ms
[2022-05-16 17:48:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-16 17:48:57] [INFO ] Time to serialize gal into /tmp/LTL17304793287828154567.gal : 35 ms
[2022-05-16 17:48:57] [INFO ] Time to serialize properties into /tmp/LTL11497128449356496327.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/LTL17304793287828154567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11497128449356496327.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/LTL1730479...247
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((i44.u179.l30_2>=1)||(i50.u90.l30_0>=1))||((i29.u182.l30_6>=1)||(i15.u180.l30_4>=1)))||(((i58.u185.l30_10>=1)||(i35.u...11398
Formula 0 simplified : !XX(F"(((((((i44.u179.l30_2>=1)||(i50.u90.l30_0>=1))||((i29.u182.l30_6>=1)||(i15.u180.l30_4>=1)))||(((i58.u185.l30_10>=1)||(i35.u183...11378
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16781549283684786124
[2022-05-16 17:49:12] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16781549283684786124
Running compilation step : cd /tmp/ltsmin16781549283684786124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16781549283684786124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16781549283684786124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 finished in 87035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&X(G(p1))))'
Support contains 102 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 869 places :
Symmetric choice reduction at 1 with 869 rule applications. Total rules 1481 place count 8073 transition count 8265
Iterating global reduction 1 with 869 rules applied. Total rules applied 2350 place count 8073 transition count 8265
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2401 place count 8022 transition count 8265
Discarding 262 places :
Symmetric choice reduction at 2 with 262 rule applications. Total rules 2663 place count 7760 transition count 7703
Iterating global reduction 2 with 262 rules applied. Total rules applied 2925 place count 7760 transition count 7703
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 3231 place count 7607 transition count 7550
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 3487 place count 7351 transition count 7244
Iterating global reduction 3 with 256 rules applied. Total rules applied 3743 place count 7351 transition count 7244
Discarding 306 places :
Symmetric choice reduction at 3 with 306 rule applications. Total rules 4049 place count 7045 transition count 6938
Iterating global reduction 3 with 306 rules applied. Total rules applied 4355 place count 7045 transition count 6938
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 102 rules applied. Total rules applied 4457 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4712 place count 6739 transition count 6632
Iterating global reduction 4 with 255 rules applied. Total rules applied 4967 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5222 place count 6484 transition count 6377
Iterating global reduction 4 with 255 rules applied. Total rules applied 5477 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5732 place count 6229 transition count 6122
Iterating global reduction 4 with 255 rules applied. Total rules applied 5987 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6242 place count 5974 transition count 5867
Iterating global reduction 4 with 255 rules applied. Total rules applied 6497 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6752 place count 5719 transition count 5612
Iterating global reduction 4 with 255 rules applied. Total rules applied 7007 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7262 place count 5464 transition count 5357
Iterating global reduction 4 with 255 rules applied. Total rules applied 7517 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7772 place count 5209 transition count 5102
Iterating global reduction 4 with 255 rules applied. Total rules applied 8027 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8282 place count 4954 transition count 4847
Iterating global reduction 4 with 255 rules applied. Total rules applied 8537 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8792 place count 4699 transition count 4592
Iterating global reduction 4 with 255 rules applied. Total rules applied 9047 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9302 place count 4444 transition count 4337
Iterating global reduction 4 with 255 rules applied. Total rules applied 9557 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9812 place count 4189 transition count 4082
Iterating global reduction 4 with 255 rules applied. Total rules applied 10067 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 306 rules applied. Total rules applied 10373 place count 4138 transition count 3827
Applied a total of 10373 rules in 16911 ms. Remains 4138 /9554 variables (removed 5416) and now considering 3827/9184 (removed 5357) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 17:49:32] [INFO ] Computed 464 place invariants in 64 ms
[2022-05-16 17:49:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:49:33] [INFO ] Implicit Places using invariants in 1213 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1219 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/9554 places, 3827/9184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4135 transition count 3826
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4135 transition count 3826
Applied a total of 2 rules in 861 ms. Remains 4135 /4136 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4135 cols
[2022-05-16 17:49:34] [INFO ] Computed 462 place invariants in 46 ms
[2022-05-16 17:49:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:49:35] [INFO ] Implicit Places using invariants in 1120 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/9554 places, 3826/9184 transitions.
Applied a total of 0 rules in 434 ms. Remains 4133 /4133 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4133/9554 places, 3826/9184 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s4020 1) (GEQ s4022 1) (GEQ s4024 1) (GEQ s4026 1) (GEQ s4028 1) (GEQ s4030 1) (GEQ s4004 1) (GEQ s4006 1) (GEQ s4008 1) (GEQ s4010 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 finished in 20707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X((F(G((F(p1)&&p0)))&&p2))))))'
Support contains 4 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 867 places :
Symmetric choice reduction at 1 with 867 rule applications. Total rules 1479 place count 8075 transition count 8267
Iterating global reduction 1 with 867 rules applied. Total rules applied 2346 place count 8075 transition count 8267
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2397 place count 8024 transition count 8267
Discarding 261 places :
Symmetric choice reduction at 2 with 261 rule applications. Total rules 2658 place count 7763 transition count 7706
Iterating global reduction 2 with 261 rules applied. Total rules applied 2919 place count 7763 transition count 7706
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 152 places :
Implicit places reduction removed 152 places
Iterating post reduction 2 with 305 rules applied. Total rules applied 3224 place count 7611 transition count 7553
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 3478 place count 7357 transition count 7299
Iterating global reduction 3 with 254 rules applied. Total rules applied 3732 place count 7357 transition count 7299
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 3986 place count 7103 transition count 7045
Iterating global reduction 3 with 254 rules applied. Total rules applied 4240 place count 7103 transition count 7045
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 4494 place count 6849 transition count 6791
Iterating global reduction 3 with 254 rules applied. Total rules applied 4748 place count 6849 transition count 6791
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5002 place count 6595 transition count 6537
Iterating global reduction 3 with 254 rules applied. Total rules applied 5256 place count 6595 transition count 6537
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5510 place count 6341 transition count 6283
Iterating global reduction 3 with 254 rules applied. Total rules applied 5764 place count 6341 transition count 6283
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6018 place count 6087 transition count 6029
Iterating global reduction 3 with 254 rules applied. Total rules applied 6272 place count 6087 transition count 6029
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6526 place count 5833 transition count 5775
Iterating global reduction 3 with 254 rules applied. Total rules applied 6780 place count 5833 transition count 5775
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7034 place count 5579 transition count 5521
Iterating global reduction 3 with 254 rules applied. Total rules applied 7288 place count 5579 transition count 5521
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7542 place count 5325 transition count 5267
Iterating global reduction 3 with 254 rules applied. Total rules applied 7796 place count 5325 transition count 5267
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8050 place count 5071 transition count 5013
Iterating global reduction 3 with 254 rules applied. Total rules applied 8304 place count 5071 transition count 5013
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8558 place count 4817 transition count 4759
Iterating global reduction 3 with 254 rules applied. Total rules applied 8812 place count 4817 transition count 4759
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 9066 place count 4563 transition count 4505
Iterating global reduction 3 with 254 rules applied. Total rules applied 9320 place count 4563 transition count 4505
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 9574 place count 4309 transition count 4251
Iterating global reduction 3 with 254 rules applied. Total rules applied 9828 place count 4309 transition count 4251
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 3 with 304 rules applied. Total rules applied 10132 place count 4259 transition count 3997
Applied a total of 10132 rules in 16246 ms. Remains 4259 /9554 variables (removed 5295) and now considering 3997/9184 (removed 5187) transitions.
// Phase 1: matrix 3997 rows 4259 cols
[2022-05-16 17:49:52] [INFO ] Computed 517 place invariants in 52 ms
[2022-05-16 17:49:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:49:53] [INFO ] Implicit Places using invariants in 1254 ms returned [416, 2876]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1259 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4257/9554 places, 3997/9184 transitions.
Applied a total of 0 rules in 435 ms. Remains 4257 /4257 variables (removed 0) and now considering 3997/3997 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4257/9554 places, 3997/9184 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(LT s1905 1), p0:(AND (GEQ s1078 1) (GEQ s1298 1)), p1:(LT s3796 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2924 steps with 0 reset in 23 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 finished in 18297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((X(p0)&&p1) U p2))||p2)))'
Support contains 1 out of 9554 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Graph (complete) has 13623 edges and 9554 vertex of which 5255 are kept as prefixes of interest. Removing 4299 places using SCC suffix rule.10 ms
Discarding 4299 places :
Also discarding 4088 output transitions
Drop transitions removed 4088 transitions
Reduce places removed 50 places and 50 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 3739 transitions
Trivial Post-agglo rules discarded 3739 transitions
Performed 3739 trivial Post agglomeration. Transition count delta: 3739
Iterating post reduction 0 with 4353 rules applied. Total rules applied 4354 place count 4593 transition count 1305
Reduce places removed 3739 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 3745 rules applied. Total rules applied 8099 place count 854 transition count 1299
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 8105 place count 848 transition count 1299
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 8105 place count 848 transition count 1245
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 8213 place count 794 transition count 1245
Discarding 312 places :
Symmetric choice reduction at 3 with 312 rule applications. Total rules 8525 place count 482 transition count 683
Iterating global reduction 3 with 312 rules applied. Total rules applied 8837 place count 482 transition count 683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 18 rules applied. Total rules applied 8855 place count 476 transition count 671
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 8863 place count 468 transition count 671
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 8863 place count 468 transition count 668
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 8869 place count 465 transition count 668
Discarding 303 places :
Symmetric choice reduction at 5 with 303 rule applications. Total rules 9172 place count 162 transition count 365
Iterating global reduction 5 with 303 rules applied. Total rules applied 9475 place count 162 transition count 365
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 257 rules applied. Total rules applied 9732 place count 161 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 9733 place count 160 transition count 109
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 50 Pre rules applied. Total rules applied 9733 place count 160 transition count 59
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 50 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 150 rules applied. Total rules applied 9883 place count 60 transition count 59
Discarding 47 places :
Symmetric choice reduction at 7 with 47 rule applications. Total rules 9930 place count 13 transition count 12
Iterating global reduction 7 with 47 rules applied. Total rules applied 9977 place count 13 transition count 12
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 9980 place count 10 transition count 9
Applied a total of 9980 rules in 98 ms. Remains 10 /9554 variables (removed 9544) and now considering 9/9184 (removed 9175) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 17:49:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 17:49:54] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9554 places, 9/9184 transitions.
Graph (complete) has 6 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Applied a total of 1 rules in 0 ms. Remains 6 /9 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:54] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:49:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/9554 places, 6/9184 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/9554 places, 6/9184 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28519 reset in 47 ms.
Product exploration explored 100000 steps with 28568 reset in 54 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p2)]
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 17:49:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 17:49:55] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 17:49:55] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:55] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 17:49:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 6/6 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 17:49:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 17:49:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 17:49:55] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 17:49:55] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 31 ms :[(NOT p2)]
Product exploration explored 100000 steps with 28495 reset in 74 ms.
Product exploration explored 100000 steps with 28643 reset in 54 ms.
Built C files in :
/tmp/ltsmin8929353322771718416
[2022-05-16 17:49:56] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 17:49:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:49:56] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 17:49:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:49:56] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 17:49:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:49:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8929353322771718416
Running compilation step : cd /tmp/ltsmin8929353322771718416;'/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 71 ms.
Running link step : cd /tmp/ltsmin8929353322771718416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8929353322771718416;'/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/stateBased7278713176881540832.hoa' '--buchi-type=spotba'
LTSmin run took 84 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 finished in 1894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!F(G(p0)) U !p0)&&G(p1))))'
Support contains 2 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 868 places :
Symmetric choice reduction at 1 with 868 rule applications. Total rules 1480 place count 8074 transition count 8266
Iterating global reduction 1 with 868 rules applied. Total rules applied 2348 place count 8074 transition count 8266
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2399 place count 8023 transition count 8266
Discarding 261 places :
Symmetric choice reduction at 2 with 261 rule applications. Total rules 2660 place count 7762 transition count 7755
Iterating global reduction 2 with 261 rules applied. Total rules applied 2921 place count 7762 transition count 7755
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 255 rules applied. Total rules applied 3176 place count 7660 transition count 7602
Discarding 205 places :
Symmetric choice reduction at 3 with 205 rule applications. Total rules 3381 place count 7455 transition count 7347
Iterating global reduction 3 with 205 rules applied. Total rules applied 3586 place count 7455 transition count 7347
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3841 place count 7200 transition count 7092
Iterating global reduction 3 with 255 rules applied. Total rules applied 4096 place count 7200 transition count 7092
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 102 rules applied. Total rules applied 4198 place count 7149 transition count 7041
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 4402 place count 6945 transition count 6837
Iterating global reduction 4 with 204 rules applied. Total rules applied 4606 place count 6945 transition count 6837
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 4810 place count 6741 transition count 6633
Iterating global reduction 4 with 204 rules applied. Total rules applied 5014 place count 6741 transition count 6633
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 5218 place count 6537 transition count 6429
Iterating global reduction 4 with 204 rules applied. Total rules applied 5422 place count 6537 transition count 6429
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 5626 place count 6333 transition count 6225
Iterating global reduction 4 with 204 rules applied. Total rules applied 5830 place count 6333 transition count 6225
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 6034 place count 6129 transition count 6021
Iterating global reduction 4 with 204 rules applied. Total rules applied 6238 place count 6129 transition count 6021
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 6442 place count 5925 transition count 5817
Iterating global reduction 4 with 204 rules applied. Total rules applied 6646 place count 5925 transition count 5817
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 6850 place count 5721 transition count 5613
Iterating global reduction 4 with 204 rules applied. Total rules applied 7054 place count 5721 transition count 5613
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 7258 place count 5517 transition count 5409
Iterating global reduction 4 with 204 rules applied. Total rules applied 7462 place count 5517 transition count 5409
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 7666 place count 5313 transition count 5205
Iterating global reduction 4 with 204 rules applied. Total rules applied 7870 place count 5313 transition count 5205
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 8074 place count 5109 transition count 5001
Iterating global reduction 4 with 204 rules applied. Total rules applied 8278 place count 5109 transition count 5001
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 8482 place count 4905 transition count 4797
Iterating global reduction 4 with 204 rules applied. Total rules applied 8686 place count 4905 transition count 4797
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 8890 place count 4905 transition count 4593
Applied a total of 8890 rules in 17598 ms. Remains 4905 /9554 variables (removed 4649) and now considering 4593/9184 (removed 4591) transitions.
// Phase 1: matrix 4593 rows 4905 cols
[2022-05-16 17:50:13] [INFO ] Computed 566 place invariants in 66 ms
[2022-05-16 17:50:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:50:15] [INFO ] Implicit Places using invariants in 1370 ms returned [360, 2892, 3526]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1373 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4902/9554 places, 4593/9184 transitions.
Applied a total of 0 rules in 620 ms. Remains 4902 /4902 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4902/9554 places, 4593/9184 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3065 1), p1:(AND (GEQ s3065 1) (GEQ s4720 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 finished in 19767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 869 places :
Symmetric choice reduction at 1 with 869 rule applications. Total rules 1481 place count 8073 transition count 8265
Iterating global reduction 1 with 869 rules applied. Total rules applied 2350 place count 8073 transition count 8265
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2401 place count 8022 transition count 8265
Discarding 261 places :
Symmetric choice reduction at 2 with 261 rule applications. Total rules 2662 place count 7761 transition count 7704
Iterating global reduction 2 with 261 rules applied. Total rules applied 2923 place count 7761 transition count 7704
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Discarding 152 places :
Implicit places reduction removed 152 places
Iterating post reduction 2 with 304 rules applied. Total rules applied 3227 place count 7609 transition count 7552
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 3483 place count 7353 transition count 7246
Iterating global reduction 3 with 256 rules applied. Total rules applied 3739 place count 7353 transition count 7246
Discarding 306 places :
Symmetric choice reduction at 3 with 306 rule applications. Total rules 4045 place count 7047 transition count 6940
Iterating global reduction 3 with 306 rules applied. Total rules applied 4351 place count 7047 transition count 6940
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 102 rules applied. Total rules applied 4453 place count 6996 transition count 6889
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4708 place count 6741 transition count 6634
Iterating global reduction 4 with 255 rules applied. Total rules applied 4963 place count 6741 transition count 6634
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5218 place count 6486 transition count 6379
Iterating global reduction 4 with 255 rules applied. Total rules applied 5473 place count 6486 transition count 6379
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5728 place count 6231 transition count 6124
Iterating global reduction 4 with 255 rules applied. Total rules applied 5983 place count 6231 transition count 6124
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6238 place count 5976 transition count 5869
Iterating global reduction 4 with 255 rules applied. Total rules applied 6493 place count 5976 transition count 5869
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6748 place count 5721 transition count 5614
Iterating global reduction 4 with 255 rules applied. Total rules applied 7003 place count 5721 transition count 5614
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7258 place count 5466 transition count 5359
Iterating global reduction 4 with 255 rules applied. Total rules applied 7513 place count 5466 transition count 5359
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7768 place count 5211 transition count 5104
Iterating global reduction 4 with 255 rules applied. Total rules applied 8023 place count 5211 transition count 5104
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8278 place count 4956 transition count 4849
Iterating global reduction 4 with 255 rules applied. Total rules applied 8533 place count 4956 transition count 4849
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8788 place count 4701 transition count 4594
Iterating global reduction 4 with 255 rules applied. Total rules applied 9043 place count 4701 transition count 4594
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9298 place count 4446 transition count 4339
Iterating global reduction 4 with 255 rules applied. Total rules applied 9553 place count 4446 transition count 4339
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9808 place count 4191 transition count 4084
Iterating global reduction 4 with 255 rules applied. Total rules applied 10063 place count 4191 transition count 4084
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 306 rules applied. Total rules applied 10369 place count 4140 transition count 3829
Applied a total of 10369 rules in 16231 ms. Remains 4140 /9554 variables (removed 5414) and now considering 3829/9184 (removed 5355) transitions.
// Phase 1: matrix 3829 rows 4140 cols
[2022-05-16 17:50:32] [INFO ] Computed 465 place invariants in 53 ms
[2022-05-16 17:50:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:50:33] [INFO ] Implicit Places using invariants in 1216 ms returned [1723]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4139/9554 places, 3829/9184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4138 transition count 3828
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4138 transition count 3828
Applied a total of 2 rules in 858 ms. Remains 4138 /4139 variables (removed 1) and now considering 3828/3829 (removed 1) transitions.
// Phase 1: matrix 3828 rows 4138 cols
[2022-05-16 17:50:34] [INFO ] Computed 464 place invariants in 57 ms
[2022-05-16 17:50:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:50:35] [INFO ] Implicit Places using invariants in 1219 ms returned [2751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4137/9554 places, 3828/9184 transitions.
Applied a total of 0 rules in 436 ms. Remains 4137 /4137 variables (removed 0) and now considering 3828/3828 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4137/9554 places, 3828/9184 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s2531 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5742 steps with 2 reset in 40 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 finished in 20187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((F(p0)||p1) U (X(p2)||p2))||F(p3)))'
Support contains 5 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 867 places :
Symmetric choice reduction at 1 with 867 rule applications. Total rules 1479 place count 8075 transition count 8317
Iterating global reduction 1 with 867 rules applied. Total rules applied 2346 place count 8075 transition count 8317
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2397 place count 8024 transition count 8317
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 2608 place count 7813 transition count 7806
Iterating global reduction 2 with 211 rules applied. Total rules applied 2819 place count 7813 transition count 7806
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Iterating post reduction 2 with 255 rules applied. Total rules applied 3074 place count 7660 transition count 7704
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3329 place count 7405 transition count 7399
Iterating global reduction 3 with 255 rules applied. Total rules applied 3584 place count 7405 transition count 7399
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 3889 place count 7100 transition count 7094
Iterating global reduction 3 with 305 rules applied. Total rules applied 4194 place count 7100 transition count 7094
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 4245 place count 7100 transition count 7043
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 4499 place count 6846 transition count 6789
Iterating global reduction 4 with 254 rules applied. Total rules applied 4753 place count 6846 transition count 6789
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5007 place count 6592 transition count 6535
Iterating global reduction 4 with 254 rules applied. Total rules applied 5261 place count 6592 transition count 6535
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5515 place count 6338 transition count 6281
Iterating global reduction 4 with 254 rules applied. Total rules applied 5769 place count 6338 transition count 6281
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6023 place count 6084 transition count 6027
Iterating global reduction 4 with 254 rules applied. Total rules applied 6277 place count 6084 transition count 6027
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6531 place count 5830 transition count 5773
Iterating global reduction 4 with 254 rules applied. Total rules applied 6785 place count 5830 transition count 5773
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7039 place count 5576 transition count 5519
Iterating global reduction 4 with 254 rules applied. Total rules applied 7293 place count 5576 transition count 5519
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7547 place count 5322 transition count 5265
Iterating global reduction 4 with 254 rules applied. Total rules applied 7801 place count 5322 transition count 5265
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8055 place count 5068 transition count 5011
Iterating global reduction 4 with 254 rules applied. Total rules applied 8309 place count 5068 transition count 5011
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8563 place count 4814 transition count 4757
Iterating global reduction 4 with 254 rules applied. Total rules applied 8817 place count 4814 transition count 4757
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9071 place count 4560 transition count 4503
Iterating global reduction 4 with 254 rules applied. Total rules applied 9325 place count 4560 transition count 4503
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9579 place count 4306 transition count 4249
Iterating global reduction 4 with 254 rules applied. Total rules applied 9833 place count 4306 transition count 4249
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 4 with 304 rules applied. Total rules applied 10137 place count 4256 transition count 3995
Applied a total of 10137 rules in 16048 ms. Remains 4256 /9554 variables (removed 5298) and now considering 3995/9184 (removed 5189) transitions.
// Phase 1: matrix 3995 rows 4256 cols
[2022-05-16 17:50:52] [INFO ] Computed 516 place invariants in 52 ms
[2022-05-16 17:50:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:50:53] [INFO ] Implicit Places using invariants in 1203 ms returned [416, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1212 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4254/9554 places, 3995/9184 transitions.
Applied a total of 0 rules in 437 ms. Remains 4254 /4254 variables (removed 0) and now considering 3995/3995 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4254/9554 places, 3995/9184 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND p0 p2 (NOT p3)), (AND (NOT p3) p0), (AND p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=4 dest: 4}]], initial=4, aps=[p0:(GEQ s2366 1), p2:(GEQ s237 1), p3:(GEQ s1903 1), p1:(AND (GEQ s768 1) (GEQ s946 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 57 reset in 791 ms.
Product exploration explored 100000 steps with 58 reset in 780 ms.
Computed a total of 4254 stabilizing places and 3995 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4254 transition count 3995
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 727 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3995 rows 4254 cols
[2022-05-16 17:50:58] [INFO ] Computed 514 place invariants in 47 ms
[2022-05-16 17:50:58] [INFO ] [Real]Absence check using 0 positive and 514 generalized place invariants in 181 ms returned sat
[2022-05-16 17:51:01] [INFO ] After 2953ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-16 17:51:02] [INFO ] After 3202ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 17:51:02] [INFO ] After 4092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 17:51:02] [INFO ] [Nat]Absence check using 0 positive and 514 generalized place invariants in 183 ms returned sat
[2022-05-16 17:51:06] [INFO ] After 3580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 17:51:07] [INFO ] After 4299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 412 ms.
[2022-05-16 17:51:07] [INFO ] After 5590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1591 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=106 )
Parikh walk visited 3 properties in 71 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p0) p2)), (F (AND (NOT p3) p0 p2)), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) p0)), (F (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))), (F (AND (NOT p3) p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 19 factoid took 879 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 288 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Support contains 5 out of 4254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4254/4254 places, 3995/3995 transitions.
Applied a total of 0 rules in 436 ms. Remains 4254 /4254 variables (removed 0) and now considering 3995/3995 (removed 0) transitions.
// Phase 1: matrix 3995 rows 4254 cols
[2022-05-16 17:51:09] [INFO ] Computed 514 place invariants in 51 ms
[2022-05-16 17:51:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:51:10] [INFO ] Implicit Places using invariants in 1208 ms returned [416, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1214 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4252/4254 places, 3995/3995 transitions.
Applied a total of 0 rules in 442 ms. Remains 4252 /4252 variables (removed 0) and now considering 3995/3995 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4252/4254 places, 3995/3995 transitions.
Computed a total of 4252 stabilizing places and 3995 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4252 transition count 3995
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (NOT p3)), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 841 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3995 rows 4252 cols
[2022-05-16 17:51:13] [INFO ] Computed 512 place invariants in 46 ms
[2022-05-16 17:51:14] [INFO ] [Real]Absence check using 0 positive and 512 generalized place invariants in 173 ms returned sat
[2022-05-16 17:51:17] [INFO ] After 3020ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-16 17:51:17] [INFO ] After 3291ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-16 17:51:18] [INFO ] After 4328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-16 17:51:18] [INFO ] [Nat]Absence check using 0 positive and 512 generalized place invariants in 168 ms returned sat
[2022-05-16 17:51:22] [INFO ] After 3300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 17:51:23] [INFO ] After 4020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 405 ms.
[2022-05-16 17:51:23] [INFO ] After 5330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1446 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=90 )
Parikh walk visited 3 properties in 57 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (NOT p3)), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p0) p2)), (F (AND (NOT p3) p0 p2)), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) p0)), (F (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))), (F (AND (NOT p3) p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 19 factoid took 823 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 220 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 360 ms :[(NOT p3), (AND (NOT p3) p0), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering criterion allowed to conclude after 62893 steps with 36 reset in 462 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 finished in 49422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 9554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Graph (complete) has 13623 edges and 9554 vertex of which 9251 are kept as prefixes of interest. Removing 303 places using SCC suffix rule.12 ms
Discarding 303 places :
Also discarding 303 output transitions
Drop transitions removed 303 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 5405 transitions
Trivial Post-agglo rules discarded 5405 transitions
Performed 5405 trivial Post agglomeration. Transition count delta: 5405
Iterating post reduction 0 with 6017 rules applied. Total rules applied 6018 place count 8588 transition count 3425
Reduce places removed 5405 places and 0 transitions.
Iterating post reduction 1 with 5405 rules applied. Total rules applied 11423 place count 3183 transition count 3425
Performed 764 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 764 Pre rules applied. Total rules applied 11423 place count 3183 transition count 2661
Deduced a syphon composed of 764 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1070 places and 0 transitions.
Iterating global reduction 2 with 1834 rules applied. Total rules applied 13257 place count 2113 transition count 2661
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 13461 place count 2113 transition count 2457
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 306 rules applied. Total rules applied 13767 place count 1909 transition count 2355
Discarding 366 places :
Symmetric choice reduction at 4 with 366 rule applications. Total rules 14133 place count 1543 transition count 1639
Iterating global reduction 4 with 366 rules applied. Total rules applied 14499 place count 1543 transition count 1639
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 154 places :
Implicit places reduction removed 154 places
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 4 with 562 rules applied. Total rules applied 15061 place count 1389 transition count 1231
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 5 with 255 rules applied. Total rules applied 15316 place count 1134 transition count 1231
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 54 Pre rules applied. Total rules applied 15316 place count 1134 transition count 1177
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 15424 place count 1080 transition count 1177
Discarding 256 places :
Symmetric choice reduction at 6 with 256 rule applications. Total rules 15680 place count 824 transition count 871
Iterating global reduction 6 with 256 rules applied. Total rules applied 15936 place count 824 transition count 871
Ensure Unique test removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 6 with 408 rules applied. Total rules applied 16344 place count 773 transition count 514
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 16395 place count 722 transition count 514
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 16395 place count 722 transition count 463
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 153 rules applied. Total rules applied 16548 place count 620 transition count 463
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 8 with 355 rules applied. Total rules applied 16903 place count 417 transition count 311
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 16904 place count 417 transition count 311
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 8 with 51 rules applied. Total rules applied 16955 place count 366 transition count 260
Applied a total of 16955 rules in 358 ms. Remains 366 /9554 variables (removed 9188) and now considering 260/9184 (removed 8924) transitions.
// Phase 1: matrix 260 rows 366 cols
[2022-05-16 17:51:26] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants in 299 ms returned [0, 52, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 256, 310, 314]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 303 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/9554 places, 260/9184 transitions.
Graph (complete) has 260 edges and 261 vertex of which 211 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 160 transition count 108
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 109 transition count 108
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 103 place count 109 transition count 57
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 205 place count 58 transition count 57
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 254 place count 9 transition count 8
Iterating global reduction 2 with 49 rules applied. Total rules applied 303 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 8 transition count 7
Applied a total of 305 rules in 3 ms. Remains 8 /261 variables (removed 253) and now considering 7/260 (removed 253) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 17:51:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 17:51:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9554 places, 7/9184 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 7/9554 places, 7/9184 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20579 reset in 71 ms.
Product exploration explored 100000 steps with 20601 reset in 67 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 finished in 1043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(!(G(p0) U p0)))&&p0)))'
Support contains 1 out of 9554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Graph (complete) has 13623 edges and 9554 vertex of which 5209 are kept as prefixes of interest. Removing 4345 places using SCC suffix rule.9 ms
Discarding 4345 places :
Also discarding 4134 output transitions
Drop transitions removed 4134 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 3723 transitions
Trivial Post-agglo rules discarded 3723 transitions
Performed 3723 trivial Post agglomeration. Transition count delta: 3723
Iterating post reduction 0 with 4335 rules applied. Total rules applied 4336 place count 4546 transition count 1276
Reduce places removed 3723 places and 0 transitions.
Iterating post reduction 1 with 3723 rules applied. Total rules applied 8059 place count 823 transition count 1276
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8059 place count 823 transition count 1225
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 8161 place count 772 transition count 1225
Discarding 308 places :
Symmetric choice reduction at 2 with 308 rule applications. Total rules 8469 place count 464 transition count 668
Iterating global reduction 2 with 308 rules applied. Total rules applied 8777 place count 464 transition count 668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8777 place count 464 transition count 667
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8779 place count 463 transition count 667
Discarding 253 places :
Symmetric choice reduction at 2 with 253 rule applications. Total rules 9032 place count 210 transition count 414
Iterating global reduction 2 with 253 rules applied. Total rules applied 9285 place count 210 transition count 414
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 2 with 204 rules applied. Total rules applied 9489 place count 210 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9489 place count 210 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9491 place count 209 transition count 209
Applied a total of 9491 rules in 92 ms. Remains 209 /9554 variables (removed 9345) and now considering 209/9184 (removed 8975) transitions.
// Phase 1: matrix 209 rows 209 cols
[2022-05-16 17:51:26] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants in 108 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 110 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/9554 places, 209/9184 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 158 transition count 107
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 56 transition count 107
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 253 place count 7 transition count 9
Iterating global reduction 2 with 49 rules applied. Total rules applied 302 place count 7 transition count 9
Applied a total of 302 rules in 1 ms. Remains 7 /158 variables (removed 151) and now considering 9/209 (removed 200) transitions.
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 17:51:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 17:51:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 17:51:26] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9554 places, 9/9184 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9554 places, 9/9184 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, p0]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||F(X(X(X(G(p1)))))))&&X(p2)))'
Support contains 4 out of 9554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9554/9554 places, 9184/9184 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8942 transition count 9184
Discarding 869 places :
Symmetric choice reduction at 1 with 869 rule applications. Total rules 1481 place count 8073 transition count 8265
Iterating global reduction 1 with 869 rules applied. Total rules applied 2350 place count 8073 transition count 8265
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2401 place count 8022 transition count 8265
Discarding 262 places :
Symmetric choice reduction at 2 with 262 rule applications. Total rules 2663 place count 7760 transition count 7703
Iterating global reduction 2 with 262 rules applied. Total rules applied 2925 place count 7760 transition count 7703
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 3231 place count 7607 transition count 7550
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3486 place count 7352 transition count 7245
Iterating global reduction 3 with 255 rules applied. Total rules applied 3741 place count 7352 transition count 7245
Discarding 305 places :
Symmetric choice reduction at 3 with 305 rule applications. Total rules 4046 place count 7047 transition count 6940
Iterating global reduction 3 with 305 rules applied. Total rules applied 4351 place count 7047 transition count 6940
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 102 rules applied. Total rules applied 4453 place count 6996 transition count 6889
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 4707 place count 6742 transition count 6635
Iterating global reduction 4 with 254 rules applied. Total rules applied 4961 place count 6742 transition count 6635
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5215 place count 6488 transition count 6381
Iterating global reduction 4 with 254 rules applied. Total rules applied 5469 place count 6488 transition count 6381
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5723 place count 6234 transition count 6127
Iterating global reduction 4 with 254 rules applied. Total rules applied 5977 place count 6234 transition count 6127
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6231 place count 5980 transition count 5873
Iterating global reduction 4 with 254 rules applied. Total rules applied 6485 place count 5980 transition count 5873
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6739 place count 5726 transition count 5619
Iterating global reduction 4 with 254 rules applied. Total rules applied 6993 place count 5726 transition count 5619
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7247 place count 5472 transition count 5365
Iterating global reduction 4 with 254 rules applied. Total rules applied 7501 place count 5472 transition count 5365
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7755 place count 5218 transition count 5111
Iterating global reduction 4 with 254 rules applied. Total rules applied 8009 place count 5218 transition count 5111
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8263 place count 4964 transition count 4857
Iterating global reduction 4 with 254 rules applied. Total rules applied 8517 place count 4964 transition count 4857
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8771 place count 4710 transition count 4603
Iterating global reduction 4 with 254 rules applied. Total rules applied 9025 place count 4710 transition count 4603
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9279 place count 4456 transition count 4349
Iterating global reduction 4 with 254 rules applied. Total rules applied 9533 place count 4456 transition count 4349
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9787 place count 4202 transition count 4095
Iterating global reduction 4 with 254 rules applied. Total rules applied 10041 place count 4202 transition count 4095
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 4 with 304 rules applied. Total rules applied 10345 place count 4152 transition count 3841
Applied a total of 10345 rules in 16247 ms. Remains 4152 /9554 variables (removed 5402) and now considering 3841/9184 (removed 5343) transitions.
// Phase 1: matrix 3841 rows 4152 cols
[2022-05-16 17:51:43] [INFO ] Computed 465 place invariants in 48 ms
[2022-05-16 17:51:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:51:44] [INFO ] Implicit Places using invariants in 1148 ms returned [2751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4151/9554 places, 3841/9184 transitions.
Applied a total of 0 rules in 434 ms. Remains 4151 /4151 variables (removed 0) and now considering 3841/3841 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4151/9554 places, 3841/9184 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s1801 1), p0:(AND (GEQ s3983 1) (GEQ s903 1)), p1:(GEQ s238 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 finished in 18068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X((X(X(p1))&&G(p2))))))))'
[2022-05-16 17:51:45] [INFO ] Flatten gal took : 262 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5766647058577785216
[2022-05-16 17:51:45] [INFO ] Too many transitions (9184) to apply POR reductions. Disabling POR matrices.
[2022-05-16 17:51:45] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5766647058577785216
Running compilation step : cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-16 17:51:45] [INFO ] Applying decomposition
[2022-05-16 17:51:46] [INFO ] Flatten gal took : 268 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/graph18130838788333066690.txt' '-o' '/tmp/graph18130838788333066690.bin' '-w' '/tmp/graph18130838788333066690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18130838788333066690.bin' '-l' '-1' '-v' '-w' '/tmp/graph18130838788333066690.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:51:46] [INFO ] Decomposing Gal with order
[2022-05-16 17:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:51:51] [INFO ] Removed a total of 2538 redundant transitions.
[2022-05-16 17:51:51] [INFO ] Flatten gal took : 502 ms
[2022-05-16 17:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 151 ms.
[2022-05-16 17:51:53] [INFO ] Time to serialize gal into /tmp/LTLFireability10713648364663529216.gal : 66 ms
[2022-05-16 17:51:53] [INFO ] Time to serialize properties into /tmp/LTLFireability4754614992267010047.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10713648364663529216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4754614992267010047.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F((F("(((((((i62.i4.i1.u3397.l21_12>=1)||(i62.i4.i7.u3395.l21_10>=1))||((i47.i5.i4.u3393.l21_8>=1)||(i61.u3429.l21_6>=1)))||(((i62....11055
Formula 0 simplified : !F("((((((((((i59.u2601.lc0_3>=1)&&(i59.u2759.cl1_3_2>=1))||((i10.i4.i0.u2607.lc0_20>=1)&&(i10.i4.i0.u2659.cl1_20_1>=1)))||(((i66.i0...11048
Compilation finished in 54763 ms.
Running link step : cd /tmp/ltsmin5766647058577785216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 18:14:29] [INFO ] Flatten gal took : 488 ms
[2022-05-16 18:14:29] [INFO ] Time to serialize gal into /tmp/LTLFireability10965444633857745909.gal : 46 ms
[2022-05-16 18:14:29] [INFO ] Time to serialize properties into /tmp/LTLFireability2269033668243293963.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/LTLFireability10965444633857745909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2269033668243293963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((F((F("(((((((l21_12>=1)||(l21_10>=1))||((l21_8>=1)||(l21_6>=1)))||(((l21_4>=1)||(l21_2>=1))||((l21_0>=1)||(l21_28>=1))))||((((l21_2...5625
Formula 0 simplified : !F("((((((((((lc0_3>=1)&&(cl1_3_2>=1))||((lc0_20>=1)&&(cl1_20_1>=1)))||(((lc0_37>=1)&&(cl1_37_0>=1))||((lc0_15>=1)&&(cl1_15_1>=1))))...5618
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 18:37:05] [INFO ] Flatten gal took : 582 ms
[2022-05-16 18:37:06] [INFO ] Input system was already deterministic with 9184 transitions.
[2022-05-16 18:37:06] [INFO ] Transformed 9554 places.
[2022-05-16 18:37:06] [INFO ] Transformed 9184 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-16 18:37:37] [INFO ] Time to serialize gal into /tmp/LTLFireability6450176341251737319.gal : 61 ms
[2022-05-16 18:37:37] [INFO ] Time to serialize properties into /tmp/LTLFireability16411039942601398168.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/LTLFireability6450176341251737319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16411039942601398168.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/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((F("(((((((l21_12>=1)||(l21_10>=1))||((l21_8>=1)||(l21_6>=1)))||(((l21_4>=1)||(l21_2>=1))||((l21_0>=1)||(l21_28>=1))))||((((l21_2...5625
Formula 0 simplified : !F("((((((((((lc0_3>=1)&&(cl1_3_2>=1))||((lc0_20>=1)&&(cl1_20_1>=1)))||(((lc0_37>=1)&&(cl1_37_0>=1))||((lc0_15>=1)&&(cl1_15_1>=1))))...5618
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.400: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.400: LTL layer: formula: X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.402: "X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.438: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.464: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.483: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.491: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.495: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.496: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.507: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.513: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.580: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 5.556: DFS-FIFO for weak LTL, using special progress label 9189
pins2lts-mc-linux64( 0/ 8), 5.556: There are 9190 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.556: State length is 9555, there are 9198 groups
pins2lts-mc-linux64( 0/ 8), 5.556: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.556: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.556: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 5.556: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 10.216: ~1 levels ~960 states ~53240 transitions
pins2lts-mc-linux64( 5/ 8), 14.545: ~1 levels ~1920 states ~108760 transitions
pins2lts-mc-linux64( 5/ 8), 23.566: ~1 levels ~3840 states ~223200 transitions
pins2lts-mc-linux64( 5/ 8), 42.474: ~1 levels ~7680 states ~440480 transitions
pins2lts-mc-linux64( 5/ 8), 77.479: ~1 levels ~15360 states ~890400 transitions
pins2lts-mc-linux64( 5/ 8), 148.780: ~1 levels ~30720 states ~1821400 transitions
pins2lts-mc-linux64( 5/ 8), 286.472: ~1 levels ~61440 states ~3640960 transitions
pins2lts-mc-linux64( 0/ 8), 594.141: ~1 levels ~122880 states ~7518560 transitions
pins2lts-mc-linux64( 5/ 8), 1163.963: ~1 levels ~245760 states ~14989800 transitions
pins2lts-mc-linux64( 7/ 8), 1249.032: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1250.422:
pins2lts-mc-linux64( 0/ 8), 1250.422: mean standard work distribution: 0.5% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1250.422:
pins2lts-mc-linux64( 0/ 8), 1250.422: Explored 261557 states 16492344 transitions, fanout: 63.054
pins2lts-mc-linux64( 0/ 8), 1250.422: Total exploration time 1244.850 sec (1243.750 sec minimum, 1244.311 sec on average)
pins2lts-mc-linux64( 0/ 8), 1250.422: States per second: 210, Transitions per second: 13248
pins2lts-mc-linux64( 0/ 8), 1250.422:
pins2lts-mc-linux64( 0/ 8), 1250.422: Progress states detected: 6256054
pins2lts-mc-linux64( 0/ 8), 1250.422: Redundant explorations: -95.8192
pins2lts-mc-linux64( 0/ 8), 1250.422:
pins2lts-mc-linux64( 0/ 8), 1250.422: Queue width: 8B, total height: 6680834, memory: 50.97MB
pins2lts-mc-linux64( 0/ 8), 1250.422: Tree memory: 303.7MB, 50.9 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 1250.422: Tree fill ratio (roots/leafs): 4.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 1250.422: Stored 10077 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1250.422: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1250.423: Est. total memory use: 354.7MB (~1075.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5766647058577785216;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))||X(X((X(X((LTLAPp3==true)))&&[](!(LTLAPp1==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)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110700732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00050M0005C002P002G001.tgz
mv FamilyReunion-PT-L00050M0005C002P002G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;