About the Execution of ITS-Tools for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12297.892 | 3600000.00 | 4001739.00 | 14760.10 | FTTFF?F?TFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889196900235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RERS2020-PT-pb103, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889196900235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 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 RERS2020-PT-pb103-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678989767696
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 18:02:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 18:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:02:50] [INFO ] Load time of PNML (sax parser for PT used): 858 ms
[2023-03-16 18:02:50] [INFO ] Transformed 520 places.
[2023-03-16 18:02:50] [INFO ] Transformed 31658 transitions.
[2023-03-16 18:02:50] [INFO ] Found NUPN structural information;
[2023-03-16 18:02:50] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1046 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 127 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:02:51] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:02:51] [INFO ] Computed 8 place invariants in 150 ms
[2023-03-16 18:02:52] [INFO ] Implicit Places using invariants in 1251 ms returned []
Implicit Place search using SMT only with invariants took 1277 ms to find 0 implicit places.
[2023-03-16 18:02:52] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:02:52] [INFO ] Invariant cache hit.
[2023-03-16 18:03:00] [INFO ] Dead Transitions using invariants and state equation in 8187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9601 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 29 out of 513 places after structural reductions.
[2023-03-16 18:03:01] [INFO ] Flatten gal took : 1040 ms
[2023-03-16 18:03:02] [INFO ] Flatten gal took : 727 ms
[2023-03-16 18:03:04] [INFO ] Input system was already deterministic with 28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-16 18:03:05] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:03:05] [INFO ] Invariant cache hit.
[2023-03-16 18:03:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:03:10] [INFO ] After 5231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-16 18:03:11] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:03:12] [INFO ] After 1710ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:03:12] [INFO ] After 7363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:03:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:03:18] [INFO ] After 5146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-16 18:03:27] [INFO ] After 9699ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-16 18:03:29] [INFO ] Deduced a trap composed of 12 places in 975 ms of which 5 ms to minimize.
[2023-03-16 18:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1759 ms
[2023-03-16 18:03:32] [INFO ] Deduced a trap composed of 53 places in 1886 ms of which 1 ms to minimize.
[2023-03-16 18:03:34] [INFO ] Deduced a trap composed of 67 places in 1901 ms of which 1 ms to minimize.
[2023-03-16 18:03:36] [INFO ] Deduced a trap composed of 102 places in 1906 ms of which 1 ms to minimize.
[2023-03-16 18:03:39] [INFO ] Deduced a trap composed of 60 places in 2019 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:03:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:03:39] [INFO ] After 26407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 46 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 852 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 854 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 33256 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33256 steps, saw 23732 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-16 18:03:43] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:03:43] [INFO ] Computed 8 place invariants in 91 ms
[2023-03-16 18:03:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:03:49] [INFO ] After 5088ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-16 18:03:49] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:03:50] [INFO ] After 1360ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:03:50] [INFO ] After 6803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:03:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:03:55] [INFO ] After 5011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-16 18:04:07] [INFO ] After 11392ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-16 18:04:11] [INFO ] Deduced a trap composed of 136 places in 1847 ms of which 1 ms to minimize.
[2023-03-16 18:04:13] [INFO ] Deduced a trap composed of 60 places in 1808 ms of which 0 ms to minimize.
[2023-03-16 18:04:18] [INFO ] Deduced a trap composed of 12 places in 2395 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:04:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:04:18] [INFO ] After 27421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 22 ms.
Support contains 9 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 122 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 120 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:04:18] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:04:18] [INFO ] Invariant cache hit.
[2023-03-16 18:04:19] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
[2023-03-16 18:04:19] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:04:19] [INFO ] Invariant cache hit.
[2023-03-16 18:04:26] [INFO ] Dead Transitions using invariants and state equation in 7666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8685 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10075 edges and 497 vertex of which 367 / 497 are part of one of the 61 SCC in 5 ms
Free SCC test removed 306 places
Drop transitions removed 10578 transitions
Ensure Unique test removed 14187 transitions
Reduce isomorphic transitions removed 24765 transitions.
Graph (complete) has 2575 edges and 191 vertex of which 184 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 184 transition count 2679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 182 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 181 transition count 2669
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 181 transition count 2669
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 179 transition count 2667
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 179 transition count 2634
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 178 transition count 2644
Drop transitions removed 1448 transitions
Redundant transition composition rules discarded 1448 transitions
Iterating global reduction 3 with 1448 rules applied. Total rules applied 1505 place count 178 transition count 1196
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1423 edges and 176 vertex of which 160 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1516 place count 160 transition count 1185
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 102 rules applied. Total rules applied 1618 place count 160 transition count 1083
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1620 place count 158 transition count 1073
Iterating global reduction 5 with 2 rules applied. Total rules applied 1622 place count 158 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1623 place count 158 transition count 1072
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1625 place count 157 transition count 1071
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1630 place count 157 transition count 1066
Free-agglomeration rule applied 7 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1637 place count 157 transition count 1057
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1649 place count 150 transition count 1052
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1677 place count 150 transition count 1024
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1679 place count 150 transition count 1022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1681 place count 148 transition count 1022
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1684 place count 148 transition count 1019
Free-agglomeration rule (complex) applied 5 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1689 place count 148 transition count 1132
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1706 place count 143 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1707 place count 142 transition count 1115
Iterating global reduction 9 with 1 rules applied. Total rules applied 1708 place count 142 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1717 place count 142 transition count 1106
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1740 place count 142 transition count 1083
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1742 place count 142 transition count 1083
Applied a total of 1742 rules in 309 ms. Remains 142 /497 variables (removed 355) and now considering 1083/27456 (removed 26373) transitions.
Running SMT prover for 5 properties.
[2023-03-16 18:04:27] [INFO ] Flow matrix only has 1052 transitions (discarded 31 similar events)
// Phase 1: matrix 1052 rows 142 cols
[2023-03-16 18:04:27] [INFO ] Computed 0 place invariants in 24 ms
[2023-03-16 18:04:27] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 18:04:28] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-16 18:04:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-16 18:04:28] [INFO ] After 121ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-16 18:04:28] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-16 18:04:28] [INFO ] After 779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 121 stabilizing places and 10286 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 351 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:04:29] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:04:29] [INFO ] Computed 8 place invariants in 88 ms
[2023-03-16 18:04:30] [INFO ] Implicit Places using invariants in 845 ms returned []
Implicit Place search using SMT only with invariants took 848 ms to find 0 implicit places.
[2023-03-16 18:04:30] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:04:30] [INFO ] Invariant cache hit.
[2023-03-16 18:04:38] [INFO ] Dead Transitions using invariants and state equation in 8301 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9510 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s429 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2351 ms.
Product exploration explored 100000 steps with 0 reset in 2386 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 6709 steps, including 2 resets, run visited all 1 properties in 248 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 134 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:04:44] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:04:44] [INFO ] Invariant cache hit.
[2023-03-16 18:04:45] [INFO ] Implicit Places using invariants in 931 ms returned []
Implicit Place search using SMT only with invariants took 933 ms to find 0 implicit places.
[2023-03-16 18:04:45] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:04:45] [INFO ] Invariant cache hit.
[2023-03-16 18:04:54] [INFO ] Dead Transitions using invariants and state equation in 8808 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9879 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Finished Best-First random walk after 279 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 3104 ms.
Product exploration explored 100000 steps with 0 reset in 2509 ms.
Built C files in :
/tmp/ltsmin16423347534261257407
[2023-03-16 18:05:00] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:05:00] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16423347534261257407
Running compilation step : cd /tmp/ltsmin16423347534261257407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16423347534261257407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16423347534261257407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 123 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:05:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:05:04] [INFO ] Invariant cache hit.
[2023-03-16 18:05:04] [INFO ] Implicit Places using invariants in 823 ms returned []
Implicit Place search using SMT only with invariants took 824 ms to find 0 implicit places.
[2023-03-16 18:05:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:05:04] [INFO ] Invariant cache hit.
[2023-03-16 18:05:12] [INFO ] Dead Transitions using invariants and state equation in 8081 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9031 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin69029765573241949
[2023-03-16 18:05:13] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:05:13] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin69029765573241949
Running compilation step : cd /tmp/ltsmin69029765573241949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin69029765573241949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin69029765573241949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:05:17] [INFO ] Flatten gal took : 733 ms
[2023-03-16 18:05:18] [INFO ] Flatten gal took : 766 ms
[2023-03-16 18:05:18] [INFO ] Time to serialize gal into /tmp/LTL7277860465972236980.gal : 133 ms
[2023-03-16 18:05:18] [INFO ] Time to serialize properties into /tmp/LTL914803598486966119.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7277860465972236980.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12230801687396677194.hoa' '-atoms' '/tmp/LTL914803598486966119.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL914803598486966119.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12230801687396677194.hoa
Detected timeout of ITS tools.
[2023-03-16 18:05:35] [INFO ] Flatten gal took : 790 ms
[2023-03-16 18:05:35] [INFO ] Flatten gal took : 768 ms
[2023-03-16 18:05:35] [INFO ] Time to serialize gal into /tmp/LTL4485052659091943962.gal : 94 ms
[2023-03-16 18:05:35] [INFO ] Time to serialize properties into /tmp/LTL2952861632526194255.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4485052659091943962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2952861632526194255.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(ps90==0)"))))
Formula 0 simplified : GF!"(ps90==0)"
Detected timeout of ITS tools.
[2023-03-16 18:05:51] [INFO ] Flatten gal took : 746 ms
[2023-03-16 18:05:51] [INFO ] Applying decomposition
[2023-03-16 18:05:52] [INFO ] Flatten gal took : 750 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13284532902222263087.txt' '-o' '/tmp/graph13284532902222263087.bin' '-w' '/tmp/graph13284532902222263087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13284532902222263087.bin' '-l' '-1' '-v' '-w' '/tmp/graph13284532902222263087.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:05:54] [INFO ] Decomposing Gal with order
[2023-03-16 18:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:05:56] [INFO ] Removed a total of 64246 redundant transitions.
[2023-03-16 18:05:56] [INFO ] Flatten gal took : 1861 ms
[2023-03-16 18:05:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2110 labels/synchronizations in 769 ms.
[2023-03-16 18:05:58] [INFO ] Time to serialize gal into /tmp/LTL14978115739646872986.gal : 56 ms
[2023-03-16 18:05:58] [INFO ] Time to serialize properties into /tmp/LTL14541420207838030293.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14978115739646872986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14541420207838030293.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i5.i2.u53.ps90==0)"))))
Formula 0 simplified : GF!"(i5.i2.u53.ps90==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4410067006859771196
[2023-03-16 18:06:13] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4410067006859771196
Running compilation step : cd /tmp/ltsmin4410067006859771196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4410067006859771196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4410067006859771196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLCardinality-01 finished in 107555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 37 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:06:16] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:06:16] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-16 18:06:17] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
[2023-03-16 18:06:17] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:17] [INFO ] Invariant cache hit.
[2023-03-16 18:06:25] [INFO ] Dead Transitions using invariants and state equation in 8054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8977 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-02 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: 1}]], initial=2, aps=[p0:(OR (EQ s60 0) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3596 ms.
Product exploration explored 100000 steps with 33333 reset in 3073 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLCardinality-02 finished in 15998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U p2))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:06:32] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:32] [INFO ] Invariant cache hit.
[2023-03-16 18:06:33] [INFO ] Implicit Places using invariants in 777 ms returned []
Implicit Place search using SMT only with invariants took 778 ms to find 0 implicit places.
[2023-03-16 18:06:33] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:33] [INFO ] Invariant cache hit.
[2023-03-16 18:06:41] [INFO ] Dead Transitions using invariants and state equation in 8475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9290 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s393 1), p1:(OR (EQ s201 0) (EQ s510 1)), p0:(AND (EQ s510 0) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 5 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-03 finished in 9593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 37 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:06:41] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:42] [INFO ] Invariant cache hit.
[2023-03-16 18:06:42] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 838 ms to find 0 implicit places.
[2023-03-16 18:06:42] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:42] [INFO ] Invariant cache hit.
[2023-03-16 18:06:51] [INFO ] Dead Transitions using invariants and state equation in 8311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9187 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s225 0) (EQ s140 1)), p0:(OR (EQ s439 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1824 steps with 0 reset in 55 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-04 finished in 9505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(X((F(p0) U !p0)))) U p1))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 38 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:06:51] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:51] [INFO ] Invariant cache hit.
[2023-03-16 18:06:52] [INFO ] Implicit Places using invariants in 788 ms returned []
Implicit Place search using SMT only with invariants took 789 ms to find 0 implicit places.
[2023-03-16 18:06:52] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:06:52] [INFO ] Invariant cache hit.
[2023-03-16 18:07:00] [INFO ] Dead Transitions using invariants and state equation in 8164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8995 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s419 0) (EQ s33 1)), p0:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2303 ms.
Product exploration explored 100000 steps with 0 reset in 2310 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 35676 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35676 steps, saw 24448 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 18:07:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:07:09] [INFO ] Invariant cache hit.
[2023-03-16 18:07:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:07:13] [INFO ] After 4061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 18:07:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:07:16] [INFO ] After 3681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 18:07:17] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:07:25] [INFO ] After 8663ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 18:07:28] [INFO ] Deduced a trap composed of 61 places in 1376 ms of which 1 ms to minimize.
[2023-03-16 18:07:31] [INFO ] Deduced a trap composed of 96 places in 1603 ms of which 3 ms to minimize.
[2023-03-16 18:07:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4222 ms
[2023-03-16 18:07:33] [INFO ] Deduced a trap composed of 50 places in 1712 ms of which 0 ms to minimize.
[2023-03-16 18:07:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2573 ms
[2023-03-16 18:07:34] [INFO ] After 17666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 827 ms.
[2023-03-16 18:07:35] [INFO ] After 22394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 858 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 859 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:07:36] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:07:36] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-16 18:07:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:07:40] [INFO ] After 3679ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:07:40] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:07:42] [INFO ] After 1307ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:07:42] [INFO ] After 5200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:07:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:07:45] [INFO ] After 3620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:07:51] [INFO ] After 5552ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:07:53] [INFO ] Deduced a trap composed of 51 places in 1727 ms of which 1 ms to minimize.
[2023-03-16 18:07:55] [INFO ] Deduced a trap composed of 185 places in 1649 ms of which 1 ms to minimize.
[2023-03-16 18:07:57] [INFO ] Deduced a trap composed of 19 places in 1673 ms of which 1 ms to minimize.
[2023-03-16 18:08:00] [INFO ] Deduced a trap composed of 121 places in 1789 ms of which 0 ms to minimize.
[2023-03-16 18:08:02] [INFO ] Deduced a trap composed of 144 places in 2025 ms of which 1 ms to minimize.
[2023-03-16 18:08:05] [INFO ] Deduced a trap composed of 118 places in 2080 ms of which 1 ms to minimize.
[2023-03-16 18:08:07] [INFO ] Deduced a trap composed of 164 places in 1756 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:08:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:08:07] [INFO ] After 25699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 111 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 497/497 places, 27456/27456 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37321 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37321 steps, saw 26410 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:08:11] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:08:11] [INFO ] Invariant cache hit.
[2023-03-16 18:08:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:08:14] [INFO ] After 3441ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:08:14] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:08:16] [INFO ] After 1279ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:16] [INFO ] After 4926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:08:19] [INFO ] After 3341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:08:23] [INFO ] After 4326ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:08:25] [INFO ] Deduced a trap composed of 19 places in 1039 ms of which 1 ms to minimize.
[2023-03-16 18:08:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1747 ms
[2023-03-16 18:08:26] [INFO ] After 6952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 701 ms.
[2023-03-16 18:08:27] [INFO ] After 11098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:08:27] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:08:27] [INFO ] Invariant cache hit.
[2023-03-16 18:08:28] [INFO ] Implicit Places using invariants in 981 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
[2023-03-16 18:08:28] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:08:28] [INFO ] Invariant cache hit.
[2023-03-16 18:08:36] [INFO ] Dead Transitions using invariants and state equation in 8082 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9164 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10337 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 171 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 2287
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 2287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 166 transition count 2285
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 166 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 165 transition count 2262
Drop transitions removed 1209 transitions
Redundant transition composition rules discarded 1209 transitions
Iterating global reduction 3 with 1209 rules applied. Total rules applied 1266 place count 165 transition count 1053
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1233 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1277 place count 144 transition count 1042
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1388 place count 144 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1390 place count 142 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 1392 place count 142 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1393 place count 142 transition count 920
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 6 with 2 rules applied. Total rules applied 1395 place count 141 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1400 place count 141 transition count 914
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 141 transition count 895
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1444 place count 129 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1445 place count 128 transition count 873
Iterating global reduction 7 with 1 rules applied. Total rules applied 1446 place count 128 transition count 873
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1454 place count 128 transition count 865
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1512 place count 128 transition count 807
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 128 transition count 801
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1528 place count 122 transition count 797
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1534 place count 122 transition count 791
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 122 transition count 789
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 120 transition count 787
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 120 transition count 783
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 120 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 118 transition count 779
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1552 place count 118 transition count 777
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1557 place count 118 transition count 855
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1574 place count 113 transition count 843
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1575 place count 112 transition count 839
Iterating global reduction 12 with 1 rules applied. Total rules applied 1576 place count 112 transition count 839
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1585 place count 112 transition count 830
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1604 place count 112 transition count 811
Applied a total of 1604 rules in 237 ms. Remains 112 /497 variables (removed 385) and now considering 811/27456 (removed 26645) transitions.
Running SMT prover for 1 properties.
[2023-03-16 18:08:36] [INFO ] Flow matrix only has 779 transitions (discarded 32 similar events)
// Phase 1: matrix 779 rows 112 cols
[2023-03-16 18:08:36] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-16 18:08:37] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:08:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 18:08:37] [INFO ] After 18ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:37] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:37] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:08:37] [INFO ] After 29ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:08:37] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 18:08:37] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:08:37] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:08:37] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-16 18:08:38] [INFO ] Implicit Places using invariants in 813 ms returned []
Implicit Place search using SMT only with invariants took 814 ms to find 0 implicit places.
[2023-03-16 18:08:38] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:08:38] [INFO ] Invariant cache hit.
[2023-03-16 18:08:46] [INFO ] Dead Transitions using invariants and state equation in 7660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8506 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:08:47] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:08:47] [INFO ] Invariant cache hit.
[2023-03-16 18:08:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:08:50] [INFO ] After 3566ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:08:50] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:08:52] [INFO ] After 1945ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:52] [INFO ] After 5729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:08:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:08:56] [INFO ] After 3551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:02] [INFO ] After 6143ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:05] [INFO ] Deduced a trap composed of 85 places in 1890 ms of which 0 ms to minimize.
[2023-03-16 18:09:07] [INFO ] Deduced a trap composed of 96 places in 1844 ms of which 0 ms to minimize.
[2023-03-16 18:09:09] [INFO ] Deduced a trap composed of 53 places in 1584 ms of which 0 ms to minimize.
[2023-03-16 18:09:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6924 ms
[2023-03-16 18:09:09] [INFO ] After 13394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1693 ms.
[2023-03-16 18:09:11] [INFO ] After 18739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 579 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37538 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37538 steps, saw 26575 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:09:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:09:15] [INFO ] Computed 8 place invariants in 49 ms
[2023-03-16 18:09:15] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:09:19] [INFO ] After 3597ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:09:19] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:09:20] [INFO ] After 1296ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:09:20] [INFO ] After 5078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:09:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:09:24] [INFO ] After 3567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:30] [INFO ] After 6437ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:32] [INFO ] Deduced a trap composed of 51 places in 1722 ms of which 1 ms to minimize.
[2023-03-16 18:09:34] [INFO ] Deduced a trap composed of 185 places in 1676 ms of which 0 ms to minimize.
[2023-03-16 18:09:36] [INFO ] Deduced a trap composed of 19 places in 1679 ms of which 1 ms to minimize.
[2023-03-16 18:09:39] [INFO ] Deduced a trap composed of 121 places in 1703 ms of which 1 ms to minimize.
[2023-03-16 18:09:41] [INFO ] Deduced a trap composed of 144 places in 1786 ms of which 0 ms to minimize.
[2023-03-16 18:09:44] [INFO ] Deduced a trap composed of 118 places in 1804 ms of which 1 ms to minimize.
[2023-03-16 18:09:46] [INFO ] Deduced a trap composed of 164 places in 1675 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:09:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:09:46] [INFO ] After 25733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:09:46] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:09:46] [INFO ] Invariant cache hit.
[2023-03-16 18:09:47] [INFO ] Implicit Places using invariants in 868 ms returned []
Implicit Place search using SMT only with invariants took 869 ms to find 0 implicit places.
[2023-03-16 18:09:47] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:09:47] [INFO ] Invariant cache hit.
[2023-03-16 18:09:54] [INFO ] Dead Transitions using invariants and state equation in 7390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8372 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10337 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 171 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 2287
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 2287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 166 transition count 2285
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 166 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 165 transition count 2262
Drop transitions removed 1209 transitions
Redundant transition composition rules discarded 1209 transitions
Iterating global reduction 3 with 1209 rules applied. Total rules applied 1266 place count 165 transition count 1053
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1233 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1277 place count 144 transition count 1042
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1388 place count 144 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1390 place count 142 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 1392 place count 142 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1393 place count 142 transition count 920
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 6 with 2 rules applied. Total rules applied 1395 place count 141 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1400 place count 141 transition count 914
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 141 transition count 895
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1444 place count 129 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1445 place count 128 transition count 873
Iterating global reduction 7 with 1 rules applied. Total rules applied 1446 place count 128 transition count 873
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1454 place count 128 transition count 865
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1512 place count 128 transition count 807
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 128 transition count 801
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1528 place count 122 transition count 797
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1534 place count 122 transition count 791
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 122 transition count 789
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 120 transition count 787
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 120 transition count 783
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 120 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 118 transition count 779
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1552 place count 118 transition count 777
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1557 place count 118 transition count 855
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1574 place count 113 transition count 843
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1575 place count 112 transition count 839
Iterating global reduction 12 with 1 rules applied. Total rules applied 1576 place count 112 transition count 839
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1585 place count 112 transition count 830
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1604 place count 112 transition count 811
Applied a total of 1604 rules in 219 ms. Remains 112 /497 variables (removed 385) and now considering 811/27456 (removed 26645) transitions.
Running SMT prover for 1 properties.
[2023-03-16 18:09:55] [INFO ] Flow matrix only has 779 transitions (discarded 32 similar events)
// Phase 1: matrix 779 rows 112 cols
[2023-03-16 18:09:55] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-16 18:09:55] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:09:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 18:09:55] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:09:55] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:09:55] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:55] [INFO ] After 23ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 18:09:55] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 18:09:55] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 0 reset in 2199 ms.
Product exploration explored 100000 steps with 0 reset in 1782 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 11 ms
Applied a total of 2 rules in 237 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2023-03-16 18:10:00] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2023-03-16 18:10:00] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-16 18:10:08] [INFO ] Dead Transitions using invariants and state equation in 7879 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8118 ms. Remains : 513/513 places, 28442/28429 transitions.
Built C files in :
/tmp/ltsmin17121854822420045014
[2023-03-16 18:10:08] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17121854822420045014
Running compilation step : cd /tmp/ltsmin17121854822420045014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17121854822420045014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17121854822420045014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:10:11] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:10:11] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-16 18:10:12] [INFO ] Implicit Places using invariants in 835 ms returned []
Implicit Place search using SMT only with invariants took 837 ms to find 0 implicit places.
[2023-03-16 18:10:12] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:10:12] [INFO ] Invariant cache hit.
[2023-03-16 18:10:20] [INFO ] Dead Transitions using invariants and state equation in 7870 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8741 ms. Remains : 513/513 places, 28429/28429 transitions.
Built C files in :
/tmp/ltsmin16111279289508652543
[2023-03-16 18:10:20] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16111279289508652543
Running compilation step : cd /tmp/ltsmin16111279289508652543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16111279289508652543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16111279289508652543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:10:24] [INFO ] Flatten gal took : 770 ms
[2023-03-16 18:10:25] [INFO ] Flatten gal took : 671 ms
[2023-03-16 18:10:25] [INFO ] Time to serialize gal into /tmp/LTL1669845428214408360.gal : 119 ms
[2023-03-16 18:10:25] [INFO ] Time to serialize properties into /tmp/LTL3818779264858241019.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1669845428214408360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10295863774485857358.hoa' '-atoms' '/tmp/LTL3818779264858241019.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3818779264858241019.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10295863774485857358.hoa
Detected timeout of ITS tools.
[2023-03-16 18:10:41] [INFO ] Flatten gal took : 664 ms
[2023-03-16 18:10:42] [INFO ] Flatten gal took : 683 ms
[2023-03-16 18:10:42] [INFO ] Time to serialize gal into /tmp/LTL17840444455778125975.gal : 97 ms
[2023-03-16 18:10:42] [INFO ] Time to serialize properties into /tmp/LTL686322383184954688.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17840444455778125975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL686322383184954688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(X((X(F(X((F("(ps328==1)"))U("(ps328==0)")))))U("((ps49==0)||(ps458==1))")))))
Formula 0 simplified : XF(!"((ps49==0)||(ps458==1))" & X(!"((ps49==0)||(ps458==1))" W XG!"(ps328==0)"))
Detected timeout of ITS tools.
[2023-03-16 18:10:58] [INFO ] Flatten gal took : 689 ms
[2023-03-16 18:10:58] [INFO ] Applying decomposition
[2023-03-16 18:10:58] [INFO ] Flatten gal took : 651 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5475833250195384.txt' '-o' '/tmp/graph5475833250195384.bin' '-w' '/tmp/graph5475833250195384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5475833250195384.bin' '-l' '-1' '-v' '-w' '/tmp/graph5475833250195384.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:11:00] [INFO ] Decomposing Gal with order
[2023-03-16 18:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:11:01] [INFO ] Removed a total of 64220 redundant transitions.
[2023-03-16 18:11:02] [INFO ] Flatten gal took : 1199 ms
[2023-03-16 18:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2047 labels/synchronizations in 680 ms.
[2023-03-16 18:11:03] [INFO ] Time to serialize gal into /tmp/LTL15565549392843378850.gal : 38 ms
[2023-03-16 18:11:03] [INFO ] Time to serialize properties into /tmp/LTL11619314031223188315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15565549392843378850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11619314031223188315.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(X((X(F(X((F("(i3.i1.u61.ps328==1)"))U("(i3.i1.u61.ps328==0)")))))U("((i2.i3.u117.ps49==0)||(i0.u22.ps458==1))")))))
Formula 0 simplified : XF(!"((i2.i3.u117.ps49==0)||(i0.u22.ps458==1))" & X(!"((i2.i3.u117.ps49==0)||(i0.u22.ps458==1))" W XG!"(i3.i1.u61.ps328==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13873893003764018270
[2023-03-16 18:11:18] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13873893003764018270
Running compilation step : cd /tmp/ltsmin13873893003764018270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13873893003764018270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13873893003764018270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLCardinality-05 finished in 269835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p1||G(p2))))&&p0)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 35 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:11:21] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:11:21] [INFO ] Invariant cache hit.
[2023-03-16 18:11:22] [INFO ] Implicit Places using invariants in 830 ms returned []
Implicit Place search using SMT only with invariants took 831 ms to find 0 implicit places.
[2023-03-16 18:11:22] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:11:22] [INFO ] Invariant cache hit.
[2023-03-16 18:11:29] [INFO ] Dead Transitions using invariants and state equation in 7635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8503 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(AND (EQ s179 0) (EQ s134 1)), p2:(AND (EQ s179 0) (EQ s134 1)), p1:(AND (NEQ s226 0) (NEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-06 finished in 8747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(((p2&&F(p3))||p1)))))'
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:11:30] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:11:30] [INFO ] Invariant cache hit.
[2023-03-16 18:11:30] [INFO ] Implicit Places using invariants in 749 ms returned []
Implicit Place search using SMT only with invariants took 752 ms to find 0 implicit places.
[2023-03-16 18:11:30] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:11:30] [INFO ] Invariant cache hit.
[2023-03-16 18:11:38] [INFO ] Dead Transitions using invariants and state equation in 7660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8445 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s365 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s265 0) (EQ s245 1)), p0:(AND (EQ s0 0) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1785 ms.
Product exploration explored 100000 steps with 0 reset in 2242 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 516 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35712 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35712 steps, saw 24462 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:11:47] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:11:47] [INFO ] Invariant cache hit.
[2023-03-16 18:11:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:11:47] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:11:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:11:52] [INFO ] After 4656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:11:52] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:12:01] [INFO ] After 8677ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:12:03] [INFO ] Deduced a trap composed of 50 places in 1912 ms of which 1 ms to minimize.
[2023-03-16 18:12:06] [INFO ] Deduced a trap composed of 67 places in 2124 ms of which 1 ms to minimize.
[2023-03-16 18:12:08] [INFO ] Deduced a trap composed of 73 places in 1926 ms of which 1 ms to minimize.
[2023-03-16 18:12:10] [INFO ] Deduced a trap composed of 34 places in 2077 ms of which 4 ms to minimize.
[2023-03-16 18:12:13] [INFO ] Deduced a trap composed of 102 places in 2084 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:12:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:12:13] [INFO ] After 25758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 740 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35552 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35552 steps, saw 25264 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:12:17] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:12:17] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-16 18:12:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:12:18] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:12:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:12:23] [INFO ] After 4994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:12:23] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:12:36] [INFO ] After 13182ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:12:38] [INFO ] Deduced a trap composed of 49 places in 1782 ms of which 0 ms to minimize.
[2023-03-16 18:12:41] [INFO ] Deduced a trap composed of 42 places in 1582 ms of which 15 ms to minimize.
[2023-03-16 18:12:43] [INFO ] Deduced a trap composed of 49 places in 1599 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:12:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:12:43] [INFO ] After 25345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 100 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:12:43] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:12:43] [INFO ] Invariant cache hit.
[2023-03-16 18:12:44] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 881 ms to find 0 implicit places.
[2023-03-16 18:12:44] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:12:44] [INFO ] Invariant cache hit.
[2023-03-16 18:12:52] [INFO ] Dead Transitions using invariants and state equation in 7481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8466 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 206 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-16 18:12:52] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-16 18:12:52] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-16 18:12:52] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:12:53] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:12:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-16 18:12:53] [INFO ] After 226ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:12:53] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-16 18:12:53] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 394 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:12:54] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:12:54] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-16 18:12:55] [INFO ] Implicit Places using invariants in 786 ms returned []
Implicit Place search using SMT only with invariants took 789 ms to find 0 implicit places.
[2023-03-16 18:12:55] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:12:55] [INFO ] Invariant cache hit.
[2023-03-16 18:13:03] [INFO ] Dead Transitions using invariants and state equation in 7701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8522 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34132 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34132 steps, saw 23419 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:13:07] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:13:07] [INFO ] Invariant cache hit.
[2023-03-16 18:13:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:13:07] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:13:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:13:13] [INFO ] After 5129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:13:13] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-16 18:13:22] [INFO ] After 9426ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:13:25] [INFO ] Deduced a trap composed of 50 places in 1807 ms of which 0 ms to minimize.
[2023-03-16 18:13:27] [INFO ] Deduced a trap composed of 67 places in 1908 ms of which 1 ms to minimize.
[2023-03-16 18:13:29] [INFO ] Deduced a trap composed of 73 places in 1916 ms of which 1 ms to minimize.
[2023-03-16 18:13:31] [INFO ] Deduced a trap composed of 34 places in 1949 ms of which 1 ms to minimize.
[2023-03-16 18:13:34] [INFO ] Deduced a trap composed of 102 places in 2009 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:13:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:13:34] [INFO ] After 26442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 693 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 694 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36171 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36171 steps, saw 25672 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:13:38] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:13:38] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-16 18:13:38] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:13:38] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:13:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:13:44] [INFO ] After 5158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:13:44] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:13:57] [INFO ] After 13341ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:13:59] [INFO ] Deduced a trap composed of 49 places in 1772 ms of which 1 ms to minimize.
[2023-03-16 18:14:02] [INFO ] Deduced a trap composed of 42 places in 1493 ms of which 1 ms to minimize.
[2023-03-16 18:14:04] [INFO ] Deduced a trap composed of 49 places in 1583 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:14:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:14:04] [INFO ] After 25497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 85 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 85 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:14:04] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:14:04] [INFO ] Invariant cache hit.
[2023-03-16 18:14:05] [INFO ] Implicit Places using invariants in 872 ms returned []
Implicit Place search using SMT only with invariants took 873 ms to find 0 implicit places.
[2023-03-16 18:14:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:14:05] [INFO ] Invariant cache hit.
[2023-03-16 18:14:12] [INFO ] Dead Transitions using invariants and state equation in 7446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8406 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 193 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-16 18:14:13] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-16 18:14:13] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-16 18:14:13] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:14:13] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:14:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-16 18:14:14] [INFO ] After 214ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:14:14] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-16 18:14:14] [INFO ] After 1055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 363 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 2197 ms.
Product exploration explored 100000 steps with 0 reset in 1801 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 208 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2023-03-16 18:14:20] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2023-03-16 18:14:20] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-16 18:14:27] [INFO ] Dead Transitions using invariants and state equation in 7841 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8057 ms. Remains : 513/513 places, 28442/28429 transitions.
Built C files in :
/tmp/ltsmin7108062770061074764
[2023-03-16 18:14:28] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7108062770061074764
Running compilation step : cd /tmp/ltsmin7108062770061074764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7108062770061074764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7108062770061074764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:14:31] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:14:31] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-16 18:14:32] [INFO ] Implicit Places using invariants in 793 ms returned []
Implicit Place search using SMT only with invariants took 794 ms to find 0 implicit places.
[2023-03-16 18:14:32] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:14:32] [INFO ] Invariant cache hit.
[2023-03-16 18:14:39] [INFO ] Dead Transitions using invariants and state equation in 7845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8673 ms. Remains : 513/513 places, 28429/28429 transitions.
Built C files in :
/tmp/ltsmin18241495792412657700
[2023-03-16 18:14:40] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18241495792412657700
Running compilation step : cd /tmp/ltsmin18241495792412657700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18241495792412657700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18241495792412657700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:14:44] [INFO ] Flatten gal took : 639 ms
[2023-03-16 18:14:44] [INFO ] Flatten gal took : 673 ms
[2023-03-16 18:14:44] [INFO ] Time to serialize gal into /tmp/LTL4613529552171607619.gal : 93 ms
[2023-03-16 18:14:44] [INFO ] Time to serialize properties into /tmp/LTL13312132352691357117.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4613529552171607619.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6123990670414346281.hoa' '-atoms' '/tmp/LTL13312132352691357117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13312132352691357117.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6123990670414346281.hoa
Detected timeout of ITS tools.
[2023-03-16 18:15:00] [INFO ] Flatten gal took : 644 ms
[2023-03-16 18:15:01] [INFO ] Flatten gal took : 675 ms
[2023-03-16 18:15:01] [INFO ] Time to serialize gal into /tmp/LTL8454909971724537306.gal : 95 ms
[2023-03-16 18:15:01] [INFO ] Time to serialize properties into /tmp/LTL10029194408479990376.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8454909971724537306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10029194408479990376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("((ps303==0)&&(ps386==1))"))||(F(("((ps97==0)||(ps138==1))")||(("((ps494==0)||(ps468==1))")&&(F("((ps512==0)||(ps350==1))"))))...159
Formula 0 simplified : F(X!"((ps303==0)&&(ps386==1))" & G(!"((ps97==0)||(ps138==1))" & (!"((ps494==0)||(ps468==1))" | G!"((ps512==0)||(ps350==1))")))
Detected timeout of ITS tools.
[2023-03-16 18:15:17] [INFO ] Flatten gal took : 652 ms
[2023-03-16 18:15:17] [INFO ] Applying decomposition
[2023-03-16 18:15:18] [INFO ] Flatten gal took : 683 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18122791846694853187.txt' '-o' '/tmp/graph18122791846694853187.bin' '-w' '/tmp/graph18122791846694853187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18122791846694853187.bin' '-l' '-1' '-v' '-w' '/tmp/graph18122791846694853187.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:15:19] [INFO ] Decomposing Gal with order
[2023-03-16 18:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:15:20] [INFO ] Removed a total of 64193 redundant transitions.
[2023-03-16 18:15:21] [INFO ] Flatten gal took : 1169 ms
[2023-03-16 18:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2416 labels/synchronizations in 663 ms.
[2023-03-16 18:15:22] [INFO ] Time to serialize gal into /tmp/LTL16295710894711585150.gal : 37 ms
[2023-03-16 18:15:22] [INFO ] Time to serialize properties into /tmp/LTL7267771496730320346.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16295710894711585150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7267771496730320346.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i0.i1.u81.ps303==0)&&(i4.i1.u94.ps386==1))"))||(F(("((i5.i0.u25.ps97==0)||(i7.i3.u87.ps138==1))")||(("((i1.u105.ps494==0)||...236
Formula 0 simplified : F(X!"((i0.i1.u81.ps303==0)&&(i4.i1.u94.ps386==1))" & G(!"((i5.i0.u25.ps97==0)||(i7.i3.u87.ps138==1))" & (!"((i1.u105.ps494==0)||(i4....226
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12297017419817047960
[2023-03-16 18:15:37] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12297017419817047960
Running compilation step : cd /tmp/ltsmin12297017419817047960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12297017419817047960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12297017419817047960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLCardinality-07 finished in 250245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:15:40] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:15:40] [INFO ] Invariant cache hit.
[2023-03-16 18:15:41] [INFO ] Implicit Places using invariants in 770 ms returned []
Implicit Place search using SMT only with invariants took 786 ms to find 0 implicit places.
[2023-03-16 18:15:41] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:15:41] [INFO ] Invariant cache hit.
[2023-03-16 18:15:49] [INFO ] Dead Transitions using invariants and state equation in 7931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8752 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-12 finished in 8887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 234 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:15:49] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:15:49] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-16 18:15:50] [INFO ] Implicit Places using invariants in 837 ms returned []
Implicit Place search using SMT only with invariants took 838 ms to find 0 implicit places.
[2023-03-16 18:15:50] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:15:50] [INFO ] Invariant cache hit.
[2023-03-16 18:15:58] [INFO ] Dead Transitions using invariants and state equation in 7774 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8847 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 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]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-13 finished in 8938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-16 18:15:58] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-16 18:15:58] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-16 18:15:58] [INFO ] Implicit Places using invariants in 791 ms returned []
Implicit Place search using SMT only with invariants took 792 ms to find 0 implicit places.
[2023-03-16 18:15:58] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-16 18:15:58] [INFO ] Invariant cache hit.
[2023-03-16 18:16:06] [INFO ] Dead Transitions using invariants and state equation in 7705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8528 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s394 1) (EQ s494 0) (EQ s463 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-15 finished in 8663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(X((F(p0) U !p0)))) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(((p2&&F(p3))||p1)))))'
Found a Lengthening insensitive property : RERS2020-PT-pb103-LTLCardinality-07
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 253 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-16 18:16:07] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:16:07] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-16 18:16:08] [INFO ] Implicit Places using invariants in 824 ms returned []
Implicit Place search using SMT only with invariants took 825 ms to find 0 implicit places.
[2023-03-16 18:16:08] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:16:08] [INFO ] Invariant cache hit.
[2023-03-16 18:16:16] [INFO ] Dead Transitions using invariants and state equation in 7759 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8838 ms. Remains : 510/513 places, 28438/28429 transitions.
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s363 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s264 0) (EQ s244 1)), p0:(AND (EQ s0 0) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2522 ms.
Product exploration explored 100000 steps with 0 reset in 1915 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35921 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35921 steps, saw 24591 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:16:24] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:16:24] [INFO ] Invariant cache hit.
[2023-03-16 18:16:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:16:25] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:16:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:16:30] [INFO ] After 4953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:16:30] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:16:39] [INFO ] After 9371ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:16:42] [INFO ] Deduced a trap composed of 56 places in 2103 ms of which 1 ms to minimize.
[2023-03-16 18:16:44] [INFO ] Deduced a trap composed of 11 places in 2000 ms of which 0 ms to minimize.
[2023-03-16 18:16:47] [INFO ] Deduced a trap composed of 84 places in 2167 ms of which 0 ms to minimize.
[2023-03-16 18:16:49] [INFO ] Deduced a trap composed of 13 places in 1930 ms of which 1 ms to minimize.
[2023-03-16 18:16:51] [INFO ] Deduced a trap composed of 95 places in 1893 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:16:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:16:51] [INFO ] After 26680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 392 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36303 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36303 steps, saw 25760 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:16:55] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:16:55] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-16 18:16:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:16:56] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:16:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 18:17:01] [INFO ] After 4762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:17:01] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:17:13] [INFO ] After 12489ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:17:15] [INFO ] Deduced a trap composed of 49 places in 1754 ms of which 1 ms to minimize.
[2023-03-16 18:17:18] [INFO ] Deduced a trap composed of 42 places in 1626 ms of which 0 ms to minimize.
[2023-03-16 18:17:20] [INFO ] Deduced a trap composed of 49 places in 1593 ms of which 1 ms to minimize.
[2023-03-16 18:17:22] [INFO ] Deduced a trap composed of 11 places in 1670 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:17:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:17:22] [INFO ] After 26465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 89 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 87 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:17:22] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:17:22] [INFO ] Invariant cache hit.
[2023-03-16 18:17:23] [INFO ] Implicit Places using invariants in 849 ms returned []
Implicit Place search using SMT only with invariants took 849 ms to find 0 implicit places.
[2023-03-16 18:17:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:17:23] [INFO ] Invariant cache hit.
[2023-03-16 18:17:30] [INFO ] Dead Transitions using invariants and state equation in 7365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8304 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 184 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-16 18:17:31] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-16 18:17:31] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-16 18:17:31] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:17:31] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:17:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-16 18:17:32] [INFO ] After 202ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:17:32] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-16 18:17:32] [INFO ] After 1042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 365 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 29 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:17:33] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:17:33] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-16 18:17:34] [INFO ] Implicit Places using invariants in 764 ms returned []
Implicit Place search using SMT only with invariants took 764 ms to find 0 implicit places.
[2023-03-16 18:17:34] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:17:34] [INFO ] Invariant cache hit.
[2023-03-16 18:17:42] [INFO ] Dead Transitions using invariants and state equation in 7842 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8637 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 402 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 31805 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31805 steps, saw 21901 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:17:46] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:17:46] [INFO ] Invariant cache hit.
[2023-03-16 18:17:46] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 18:17:46] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:17:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:17:51] [INFO ] After 5024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:17:51] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-16 18:17:59] [INFO ] After 7909ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:18:02] [INFO ] Deduced a trap composed of 56 places in 1897 ms of which 1 ms to minimize.
[2023-03-16 18:18:04] [INFO ] Deduced a trap composed of 11 places in 1939 ms of which 0 ms to minimize.
[2023-03-16 18:18:06] [INFO ] Deduced a trap composed of 84 places in 2002 ms of which 0 ms to minimize.
[2023-03-16 18:18:09] [INFO ] Deduced a trap composed of 13 places in 1944 ms of which 0 ms to minimize.
[2023-03-16 18:18:11] [INFO ] Deduced a trap composed of 95 places in 1980 ms of which 0 ms to minimize.
[2023-03-16 18:18:13] [INFO ] Deduced a trap composed of 30 places in 2105 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:18:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:18:13] [INFO ] After 27148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 387 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34650 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34650 steps, saw 24683 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 18:18:17] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-16 18:18:17] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-16 18:18:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:18:18] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:18:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 18:18:23] [INFO ] After 5045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:18:23] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-16 18:18:37] [INFO ] After 13467ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:18:39] [INFO ] Deduced a trap composed of 49 places in 1831 ms of which 0 ms to minimize.
[2023-03-16 18:18:41] [INFO ] Deduced a trap composed of 42 places in 1544 ms of which 0 ms to minimize.
[2023-03-16 18:18:44] [INFO ] Deduced a trap composed of 49 places in 1647 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 18:18:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 18:18:44] [INFO ] After 25794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-16 18:18:44] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:18:44] [INFO ] Invariant cache hit.
[2023-03-16 18:18:45] [INFO ] Implicit Places using invariants in 874 ms returned []
Implicit Place search using SMT only with invariants took 875 ms to find 0 implicit places.
[2023-03-16 18:18:45] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-16 18:18:45] [INFO ] Invariant cache hit.
[2023-03-16 18:18:52] [INFO ] Dead Transitions using invariants and state equation in 7443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8419 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 202 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2023-03-16 18:18:52] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2023-03-16 18:18:52] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-16 18:18:53] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 18:18:53] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 18:18:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-16 18:18:53] [INFO ] After 220ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 18:18:54] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-16 18:18:54] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p2 p1 p3 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 2248 ms.
Product exploration explored 100000 steps with 0 reset in 2379 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 99 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:19:00] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-16 18:19:00] [INFO ] Computed 8 place invariants in 66 ms
[2023-03-16 18:19:08] [INFO ] Dead Transitions using invariants and state equation in 8220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8319 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin8114202466464630079
[2023-03-16 18:19:08] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8114202466464630079
Running compilation step : cd /tmp/ltsmin8114202466464630079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8114202466464630079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8114202466464630079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 32 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-16 18:19:11] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:19:11] [INFO ] Invariant cache hit.
[2023-03-16 18:19:12] [INFO ] Implicit Places using invariants in 790 ms returned []
Implicit Place search using SMT only with invariants took 791 ms to find 0 implicit places.
[2023-03-16 18:19:12] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-16 18:19:12] [INFO ] Invariant cache hit.
[2023-03-16 18:19:20] [INFO ] Dead Transitions using invariants and state equation in 8099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8924 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin8223264596166126239
[2023-03-16 18:19:20] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8223264596166126239
Running compilation step : cd /tmp/ltsmin8223264596166126239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8223264596166126239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8223264596166126239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 18:19:25] [INFO ] Flatten gal took : 652 ms
[2023-03-16 18:19:25] [INFO ] Flatten gal took : 713 ms
[2023-03-16 18:19:25] [INFO ] Time to serialize gal into /tmp/LTL1396527969854379886.gal : 88 ms
[2023-03-16 18:19:25] [INFO ] Time to serialize properties into /tmp/LTL4059585903195859263.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1396527969854379886.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4435070341785768576.hoa' '-atoms' '/tmp/LTL4059585903195859263.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4059585903195859263.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4435070341785768576.hoa
Detected timeout of ITS tools.
[2023-03-16 18:19:41] [INFO ] Flatten gal took : 661 ms
[2023-03-16 18:19:42] [INFO ] Flatten gal took : 692 ms
[2023-03-16 18:19:42] [INFO ] Time to serialize gal into /tmp/LTL1801688230253563194.gal : 98 ms
[2023-03-16 18:19:42] [INFO ] Time to serialize properties into /tmp/LTL5855488768426229242.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1801688230253563194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5855488768426229242.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((ps303==0)&&(ps386==1))"))||(F(("((ps97==0)||(ps138==1))")||(("((ps494==0)||(ps468==1))")&&(F("((ps512==0)||(ps350==1))"))))...159
Formula 0 simplified : F(X!"((ps303==0)&&(ps386==1))" & G(!"((ps97==0)||(ps138==1))" & (!"((ps494==0)||(ps468==1))" | G!"((ps512==0)||(ps350==1))")))
Detected timeout of ITS tools.
[2023-03-16 18:19:58] [INFO ] Flatten gal took : 663 ms
[2023-03-16 18:19:58] [INFO ] Applying decomposition
[2023-03-16 18:19:59] [INFO ] Flatten gal took : 687 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6453837036743457963.txt' '-o' '/tmp/graph6453837036743457963.bin' '-w' '/tmp/graph6453837036743457963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6453837036743457963.bin' '-l' '-1' '-v' '-w' '/tmp/graph6453837036743457963.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:20:00] [INFO ] Decomposing Gal with order
[2023-03-16 18:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:20:01] [INFO ] Removed a total of 64142 redundant transitions.
[2023-03-16 18:20:02] [INFO ] Flatten gal took : 1158 ms
[2023-03-16 18:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2450 labels/synchronizations in 641 ms.
[2023-03-16 18:20:03] [INFO ] Time to serialize gal into /tmp/LTL16052888908905019850.gal : 38 ms
[2023-03-16 18:20:03] [INFO ] Time to serialize properties into /tmp/LTL203391267444995363.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16052888908905019850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL203391267444995363.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("((i3.i0.u80.ps303==0)&&(i1.i1.u91.ps386==1))"))||(F(("((i6.i0.u96.ps97==0)||(i4.i2.u99.ps138==1))")||(("((i5.u104.ps494==0)||...236
Formula 0 simplified : F(X!"((i3.i0.u80.ps303==0)&&(i1.i1.u91.ps386==1))" & G(!"((i6.i0.u96.ps97==0)||(i4.i2.u99.ps138==1))" & (!"((i5.u104.ps494==0)||(i7....226
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3659362602420945182
[2023-03-16 18:20:18] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3659362602420945182
Running compilation step : cd /tmp/ltsmin3659362602420945182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3659362602420945182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3659362602420945182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb103-LTLCardinality-07 finished in 254408 ms.
[2023-03-16 18:20:22] [INFO ] Flatten gal took : 658 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin786482469835127746
[2023-03-16 18:20:22] [INFO ] Too many transitions (28429) to apply POR reductions. Disabling POR matrices.
[2023-03-16 18:20:22] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin786482469835127746
Running compilation step : cd /tmp/ltsmin786482469835127746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 18:20:22] [INFO ] Applying decomposition
[2023-03-16 18:20:23] [INFO ] Flatten gal took : 687 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8430001354514443499.txt' '-o' '/tmp/graph8430001354514443499.bin' '-w' '/tmp/graph8430001354514443499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8430001354514443499.bin' '-l' '-1' '-v' '-w' '/tmp/graph8430001354514443499.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:20:24] [INFO ] Decomposing Gal with order
[2023-03-16 18:20:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:20:26] [INFO ] Removed a total of 64195 redundant transitions.
[2023-03-16 18:20:26] [INFO ] Flatten gal took : 1169 ms
[2023-03-16 18:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2303 labels/synchronizations in 619 ms.
[2023-03-16 18:20:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality12845942399289496734.gal : 36 ms
[2023-03-16 18:20:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality15893960409310678945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12845942399289496734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15893960409310678945.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("(i1.i2.u64.ps90==0)"))))
Formula 0 simplified : GF!"(i1.i2.u64.ps90==0)"
Reverse transition relation is NOT exact ! Due to transitions t215, t278, t610, t626, t642, t690, t706, t723, t739, t1032, t1040, t1063, t1375, t1439, t145...2037
Computing Next relation with stutter on 6 deadlock states
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/ltsmin786482469835127746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin786482469835127746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
83531 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,836.519,4302396,1,0,5.90053e+06,1.23216e+06,21876,3.6049e+07,3662,5.98908e+06,7687131
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RERS2020-PT-pb103-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X((X(F(X((F("(i0.i0.u62.ps328==1)"))U("(i0.i0.u62.ps328!=1)")))))U("((i1.i2.u76.ps49==0)||(i6.u6.ps458==1))")))))
Formula 1 simplified : XF(!"((i1.i2.u76.ps49==0)||(i6.u6.ps458==1))" & X(!"((i1.i2.u76.ps49==0)||(i6.u6.ps458==1))" W XG!"(i0.i0.u62.ps328!=1)"))
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
[2023-03-16 18:46:19] [INFO ] Applying decomposition
[2023-03-16 18:46:19] [INFO ] Flatten gal took : 689 ms
[2023-03-16 18:46:20] [INFO ] Decomposing Gal with order
[2023-03-16 18:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:46:26] [INFO ] Removed a total of 54565 redundant transitions.
[2023-03-16 18:46:26] [INFO ] Flatten gal took : 5920 ms
[2023-03-16 18:46:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1537 labels/synchronizations in 966 ms.
[2023-03-16 18:46:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality16614343823736549258.gal : 6 ms
[2023-03-16 18:46:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality41854888004883336.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16614343823736549258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality41854888004883336.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((G(X((X(F(X((F("(ucomponent4.ps328==1)"))U("(ucomponent4.ps328!=1)")))))U("((ucomponent0.ps49==0)||(ucomponent6.ps458==1))")))))
Formula 0 simplified : XF(!"((ucomponent0.ps49==0)||(ucomponent6.ps458==1))" & X(!"((ucomponent0.ps49==0)||(ucomponent6.ps458==1))" W XG!"(ucomponent4.ps32...163
Reverse transition relation is NOT exact ! Due to transitions t725, t3185, t3188, t3523, t4826, t4831, t6708, t6709, t7406, t7436, t7445, t7563, t7979, t83...936
Computing Next relation with stutter on 6 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5834168 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16020056 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb103"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb103, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889196900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;