About the Execution of ITS-Tools for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.256 | 3600000.00 | 12970231.00 | 9318.80 | FFFFTFFFFFF?FFFF | 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.r261-smll-167863536600636.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 Peterson-PT-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600636
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K 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 Peterson-PT-6-LTLFireability-00
FORMULA_NAME Peterson-PT-6-LTLFireability-01
FORMULA_NAME Peterson-PT-6-LTLFireability-02
FORMULA_NAME Peterson-PT-6-LTLFireability-03
FORMULA_NAME Peterson-PT-6-LTLFireability-04
FORMULA_NAME Peterson-PT-6-LTLFireability-05
FORMULA_NAME Peterson-PT-6-LTLFireability-06
FORMULA_NAME Peterson-PT-6-LTLFireability-07
FORMULA_NAME Peterson-PT-6-LTLFireability-08
FORMULA_NAME Peterson-PT-6-LTLFireability-09
FORMULA_NAME Peterson-PT-6-LTLFireability-10
FORMULA_NAME Peterson-PT-6-LTLFireability-11
FORMULA_NAME Peterson-PT-6-LTLFireability-12
FORMULA_NAME Peterson-PT-6-LTLFireability-13
FORMULA_NAME Peterson-PT-6-LTLFireability-14
FORMULA_NAME Peterson-PT-6-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679071232763
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 16:40:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 16:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 16:40:35] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-17 16:40:35] [INFO ] Transformed 1330 places.
[2023-03-17 16:40:35] [INFO ] Transformed 2030 transitions.
[2023-03-17 16:40:35] [INFO ] Found NUPN structural information;
[2023-03-17 16:40:35] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-17 16:40:35] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:40:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-17 16:40:36] [INFO ] Computed 27 place invariants in 47 ms
[2023-03-17 16:40:37] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-17 16:40:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:40:37] [INFO ] Invariant cache hit.
[2023-03-17 16:40:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:40:38] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
[2023-03-17 16:40:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:40:38] [INFO ] Invariant cache hit.
[2023-03-17 16:40:41] [INFO ] Dead Transitions using invariants and state equation in 2312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4771 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1330 out of 1330 places after structural reductions.
[2023-03-17 16:40:41] [INFO ] Flatten gal took : 397 ms
[2023-03-17 16:40:42] [INFO ] Flatten gal took : 156 ms
[2023-03-17 16:40:42] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 37) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :1
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 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 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 16:40:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:40:43] [INFO ] Invariant cache hit.
[2023-03-17 16:40:44] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-17 16:40:44] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-17 16:40:44] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 16:40:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-17 16:40:45] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-17 16:40:46] [INFO ] After 1520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 16:40:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:40:47] [INFO ] After 905ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 16:40:48] [INFO ] Deduced a trap composed of 16 places in 954 ms of which 7 ms to minimize.
[2023-03-17 16:40:49] [INFO ] Deduced a trap composed of 46 places in 1015 ms of which 2 ms to minimize.
[2023-03-17 16:40:50] [INFO ] Deduced a trap composed of 132 places in 872 ms of which 2 ms to minimize.
[2023-03-17 16:40:51] [INFO ] Deduced a trap composed of 140 places in 955 ms of which 3 ms to minimize.
[2023-03-17 16:40:53] [INFO ] Deduced a trap composed of 77 places in 1039 ms of which 2 ms to minimize.
[2023-03-17 16:40:54] [INFO ] Deduced a trap composed of 77 places in 949 ms of which 2 ms to minimize.
[2023-03-17 16:40:55] [INFO ] Deduced a trap composed of 77 places in 962 ms of which 1 ms to minimize.
[2023-03-17 16:40:56] [INFO ] Deduced a trap composed of 75 places in 945 ms of which 3 ms to minimize.
[2023-03-17 16:40:57] [INFO ] Deduced a trap composed of 272 places in 959 ms of which 1 ms to minimize.
[2023-03-17 16:40:58] [INFO ] Deduced a trap composed of 173 places in 952 ms of which 2 ms to minimize.
[2023-03-17 16:40:59] [INFO ] Deduced a trap composed of 265 places in 893 ms of which 2 ms to minimize.
[2023-03-17 16:41:00] [INFO ] Deduced a trap composed of 293 places in 938 ms of which 1 ms to minimize.
[2023-03-17 16:41:01] [INFO ] Deduced a trap composed of 270 places in 874 ms of which 2 ms to minimize.
[2023-03-17 16:41:02] [INFO ] Deduced a trap composed of 169 places in 920 ms of which 1 ms to minimize.
[2023-03-17 16:41:03] [INFO ] Deduced a trap composed of 134 places in 989 ms of which 2 ms to minimize.
[2023-03-17 16:41:04] [INFO ] Deduced a trap composed of 195 places in 954 ms of which 1 ms to minimize.
[2023-03-17 16:41:05] [INFO ] Deduced a trap composed of 240 places in 948 ms of which 1 ms to minimize.
[2023-03-17 16:41:06] [INFO ] Deduced a trap composed of 243 places in 958 ms of which 1 ms to minimize.
[2023-03-17 16:41:07] [INFO ] Deduced a trap composed of 243 places in 1110 ms of which 1 ms to minimize.
[2023-03-17 16:41:09] [INFO ] Deduced a trap composed of 303 places in 1032 ms of which 1 ms to minimize.
[2023-03-17 16:41:10] [INFO ] Deduced a trap composed of 25 places in 1087 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-17 16:41:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:41:10] [INFO ] After 26035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 98 ms.
Support contains 59 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 575 transitions
Trivial Post-agglo rules discarded 575 transitions
Performed 575 trivial Post agglomeration. Transition count delta: 575
Iterating post reduction 0 with 575 rules applied. Total rules applied 575 place count 1330 transition count 1455
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 1 with 575 rules applied. Total rules applied 1150 place count 755 transition count 1455
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 1150 place count 755 transition count 1155
Deduced a syphon composed of 300 places in 2 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1750 place count 455 transition count 1155
Applied a total of 1750 rules in 196 ms. Remains 455 /1330 variables (removed 875) and now considering 1155/2030 (removed 875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 455/1330 places, 1155/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 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 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 16:41:11] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
// Phase 1: matrix 945 rows 455 cols
[2023-03-17 16:41:11] [INFO ] Computed 27 place invariants in 8 ms
[2023-03-17 16:41:11] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-17 16:41:11] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-17 16:41:12] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 16:41:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-17 16:41:12] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-17 16:41:12] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 16:41:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:41:13] [INFO ] After 352ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 16:41:13] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 1 ms to minimize.
[2023-03-17 16:41:13] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 1 ms to minimize.
[2023-03-17 16:41:14] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 1 ms to minimize.
[2023-03-17 16:41:14] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 0 ms to minimize.
[2023-03-17 16:41:14] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 1 ms to minimize.
[2023-03-17 16:41:15] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 0 ms to minimize.
[2023-03-17 16:41:15] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-17 16:41:15] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-17 16:41:15] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 1 ms to minimize.
[2023-03-17 16:41:16] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-17 16:41:16] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-17 16:41:16] [INFO ] Deduced a trap composed of 70 places in 290 ms of which 0 ms to minimize.
[2023-03-17 16:41:17] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 2 ms to minimize.
[2023-03-17 16:41:17] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 3 ms to minimize.
[2023-03-17 16:41:17] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 1 ms to minimize.
[2023-03-17 16:41:18] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2023-03-17 16:41:18] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 0 ms to minimize.
[2023-03-17 16:41:18] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 0 ms to minimize.
[2023-03-17 16:41:18] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2023-03-17 16:41:19] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 1 ms to minimize.
[2023-03-17 16:41:19] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2023-03-17 16:41:19] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2023-03-17 16:41:20] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2023-03-17 16:41:20] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 0 ms to minimize.
[2023-03-17 16:41:20] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 0 ms to minimize.
[2023-03-17 16:41:20] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 1 ms to minimize.
[2023-03-17 16:41:21] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 1 ms to minimize.
[2023-03-17 16:41:21] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 0 ms to minimize.
[2023-03-17 16:41:21] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 0 ms to minimize.
[2023-03-17 16:41:21] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 2 ms to minimize.
[2023-03-17 16:41:22] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 1 ms to minimize.
[2023-03-17 16:41:22] [INFO ] Deduced a trap composed of 82 places in 240 ms of which 1 ms to minimize.
[2023-03-17 16:41:22] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 0 ms to minimize.
[2023-03-17 16:41:22] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 1 ms to minimize.
[2023-03-17 16:41:23] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 0 ms to minimize.
[2023-03-17 16:41:23] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 5 ms to minimize.
[2023-03-17 16:41:23] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 0 ms to minimize.
[2023-03-17 16:41:23] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2023-03-17 16:41:24] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 1 ms to minimize.
[2023-03-17 16:41:25] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 1 ms to minimize.
[2023-03-17 16:41:25] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 0 ms to minimize.
[2023-03-17 16:41:26] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 0 ms to minimize.
[2023-03-17 16:41:26] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 2 ms to minimize.
[2023-03-17 16:41:26] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 3 ms to minimize.
[2023-03-17 16:41:27] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2023-03-17 16:41:27] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 2 ms to minimize.
[2023-03-17 16:41:27] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 6 ms to minimize.
[2023-03-17 16:41:27] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 0 ms to minimize.
[2023-03-17 16:41:28] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 0 ms to minimize.
[2023-03-17 16:41:28] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 0 ms to minimize.
[2023-03-17 16:41:28] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 0 ms to minimize.
[2023-03-17 16:41:29] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2023-03-17 16:41:29] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 1 ms to minimize.
[2023-03-17 16:41:29] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 1 ms to minimize.
[2023-03-17 16:41:30] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 0 ms to minimize.
[2023-03-17 16:41:30] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2023-03-17 16:41:30] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2023-03-17 16:41:31] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2023-03-17 16:41:31] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 1 ms to minimize.
[2023-03-17 16:41:31] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 1 ms to minimize.
[2023-03-17 16:41:31] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-03-17 16:41:32] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-03-17 16:41:32] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2023-03-17 16:41:32] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2023-03-17 16:41:33] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 0 ms to minimize.
[2023-03-17 16:41:33] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 19943 ms
[2023-03-17 16:41:33] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 1 ms to minimize.
[2023-03-17 16:41:34] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2023-03-17 16:41:34] [INFO ] Deduced a trap composed of 58 places in 308 ms of which 1 ms to minimize.
[2023-03-17 16:41:34] [INFO ] Deduced a trap composed of 70 places in 340 ms of which 1 ms to minimize.
[2023-03-17 16:41:35] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-17 16:41:35] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2023-03-17 16:41:35] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 2 ms to minimize.
[2023-03-17 16:41:35] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2023-03-17 16:41:36] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 1 ms to minimize.
[2023-03-17 16:41:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2794 ms
[2023-03-17 16:41:36] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 0 ms to minimize.
[2023-03-17 16:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-17 16:41:37] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2023-03-17 16:41:37] [INFO ] Deduced a trap composed of 11 places in 217 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-17 16:41:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:41:37] [INFO ] After 25157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 21 ms.
Support contains 57 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1155/1155 transitions.
Applied a total of 0 rules in 44 ms. Remains 455 /455 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 455/455 places, 1155/1155 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 379472 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379472 steps, saw 54811 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 16:41:41] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-17 16:41:41] [INFO ] Invariant cache hit.
[2023-03-17 16:41:41] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-17 16:41:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-17 16:41:41] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 16:41:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-17 16:41:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-17 16:41:42] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 16:41:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:41:42] [INFO ] After 346ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 16:41:43] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 1 ms to minimize.
[2023-03-17 16:41:43] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-17 16:41:43] [INFO ] Deduced a trap composed of 28 places in 440 ms of which 1 ms to minimize.
[2023-03-17 16:41:44] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2023-03-17 16:41:44] [INFO ] Deduced a trap composed of 65 places in 332 ms of which 0 ms to minimize.
[2023-03-17 16:41:45] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 1 ms to minimize.
[2023-03-17 16:41:45] [INFO ] Deduced a trap composed of 51 places in 336 ms of which 1 ms to minimize.
[2023-03-17 16:41:45] [INFO ] Deduced a trap composed of 22 places in 324 ms of which 1 ms to minimize.
[2023-03-17 16:41:46] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 1 ms to minimize.
[2023-03-17 16:41:46] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 1 ms to minimize.
[2023-03-17 16:41:46] [INFO ] Deduced a trap composed of 21 places in 383 ms of which 1 ms to minimize.
[2023-03-17 16:41:47] [INFO ] Deduced a trap composed of 21 places in 324 ms of which 0 ms to minimize.
[2023-03-17 16:41:47] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 0 ms to minimize.
[2023-03-17 16:41:48] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2023-03-17 16:41:48] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 0 ms to minimize.
[2023-03-17 16:41:48] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 1 ms to minimize.
[2023-03-17 16:41:48] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 0 ms to minimize.
[2023-03-17 16:41:49] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2023-03-17 16:41:49] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2023-03-17 16:41:49] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 0 ms to minimize.
[2023-03-17 16:41:50] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2023-03-17 16:41:50] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2023-03-17 16:41:50] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2023-03-17 16:41:51] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2023-03-17 16:41:51] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 5 ms to minimize.
[2023-03-17 16:41:51] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 0 ms to minimize.
[2023-03-17 16:41:52] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 1 ms to minimize.
[2023-03-17 16:41:52] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 1 ms to minimize.
[2023-03-17 16:41:52] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 0 ms to minimize.
[2023-03-17 16:41:53] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 1 ms to minimize.
[2023-03-17 16:41:53] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 0 ms to minimize.
[2023-03-17 16:41:53] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 1 ms to minimize.
[2023-03-17 16:41:54] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 0 ms to minimize.
[2023-03-17 16:41:54] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 1 ms to minimize.
[2023-03-17 16:41:54] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2023-03-17 16:41:54] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2023-03-17 16:41:55] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 0 ms to minimize.
[2023-03-17 16:41:55] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2023-03-17 16:41:55] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
[2023-03-17 16:41:56] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 1 ms to minimize.
[2023-03-17 16:41:56] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-17 16:41:56] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 0 ms to minimize.
[2023-03-17 16:41:56] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-17 16:41:57] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 1 ms to minimize.
[2023-03-17 16:41:57] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 1 ms to minimize.
[2023-03-17 16:41:57] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 14762 ms
[2023-03-17 16:41:57] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 0 ms to minimize.
[2023-03-17 16:41:58] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2023-03-17 16:41:58] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 0 ms to minimize.
[2023-03-17 16:41:58] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 1 ms to minimize.
[2023-03-17 16:41:59] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 1 ms to minimize.
[2023-03-17 16:41:59] [INFO ] Deduced a trap composed of 88 places in 203 ms of which 1 ms to minimize.
[2023-03-17 16:41:59] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 0 ms to minimize.
[2023-03-17 16:41:59] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 1 ms to minimize.
[2023-03-17 16:41:59] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 1 ms to minimize.
[2023-03-17 16:42:00] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2023-03-17 16:42:00] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 0 ms to minimize.
[2023-03-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2810 ms
[2023-03-17 16:42:00] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 1 ms to minimize.
[2023-03-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-17 16:42:00] [INFO ] After 18524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-17 16:42:01] [INFO ] After 19674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 3 ms.
Support contains 57 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1155/1155 transitions.
Applied a total of 0 rules in 32 ms. Remains 455 /455 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 455/455 places, 1155/1155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1155/1155 transitions.
Applied a total of 0 rules in 29 ms. Remains 455 /455 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
[2023-03-17 16:42:01] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-17 16:42:01] [INFO ] Invariant cache hit.
[2023-03-17 16:42:01] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-17 16:42:01] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-17 16:42:01] [INFO ] Invariant cache hit.
[2023-03-17 16:42:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:42:04] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 2948 ms to find 0 implicit places.
[2023-03-17 16:42:04] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-17 16:42:04] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-17 16:42:04] [INFO ] Invariant cache hit.
[2023-03-17 16:42:05] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4325 ms. Remains : 455/455 places, 1155/1155 transitions.
Graph (trivial) has 803 edges and 455 vertex of which 293 / 455 are part of one of the 42 SCC in 7 ms
Free SCC test removed 251 places
Drop transitions removed 502 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 712 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 197 transition count 479
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 51 place count 197 transition count 443
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 94 place count 197 transition count 443
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 99 place count 197 transition count 438
Applied a total of 99 rules in 62 ms. Remains 197 /455 variables (removed 258) and now considering 438/1155 (removed 717) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 438 rows 197 cols
[2023-03-17 16:42:05] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-17 16:42:05] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-17 16:42:05] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-17 16:42:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 16:42:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-17 16:42:06] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-17 16:42:06] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 16:42:06] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-17 16:42:06] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(X(G((F(p1)&&p0))))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 32 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:42:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-17 16:42:07] [INFO ] Computed 27 place invariants in 13 ms
[2023-03-17 16:42:08] [INFO ] Implicit Places using invariants in 871 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 875 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 936 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s911 0) (EQ s1106 0) (EQ s1033 0) (EQ s968 0) (EQ s1233 0) (EQ s903 0) (EQ s1114 0) (EQ s1241 0) (EQ s1025 0) (EQ s1155 0) (EQ s1090 0) (EQ s9...], 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]]
Entered a terminal (fully accepting) state of product in 661 steps with 45 reset in 73 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 1447 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(G((p1&&(p2||F(p3)))))||p0)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:42:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:08] [INFO ] Invariant cache hit.
[2023-03-17 16:42:09] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-17 16:42:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:09] [INFO ] Invariant cache hit.
[2023-03-17 16:42:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:42:17] [INFO ] Implicit Places using invariants and state equation in 7582 ms returned []
Implicit Place search using SMT with State Equation took 8285 ms to find 0 implicit places.
[2023-03-17 16:42:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:17] [INFO ] Invariant cache hit.
[2023-03-17 16:42:18] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10149 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (AND (EQ s943 1) (EQ s1182 1)) (AND (EQ s915 1) (EQ s1197 1)) (AND (EQ s914 1) (EQ s1184 1)) (AND (EQ s924 1) (EQ s1195 1)) (AND (EQ s938 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 928 reset in 2917 ms.
Stack based approach found an accepted trace after 392 steps with 2 reset with depth 355 and stack size 355 in 11 ms.
FORMULA Peterson-PT-6-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 13368 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((p0&&F(p1)))))'
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 42 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:42:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:22] [INFO ] Invariant cache hit.
[2023-03-17 16:42:22] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-17 16:42:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:22] [INFO ] Invariant cache hit.
[2023-03-17 16:42:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:42:27] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 5395 ms to find 0 implicit places.
[2023-03-17 16:42:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:27] [INFO ] Invariant cache hit.
[2023-03-17 16:42:30] [INFO ] Dead Transitions using invariants and state equation in 2617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8056 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(AND (OR (EQ s943 0) (EQ s1182 0)) (OR (EQ s915 0) (EQ s1197 0)) (OR (EQ s914 0) (EQ s1184 0)) (OR (EQ s924 0) (EQ s1195 0)) (OR (EQ s938 0) (EQ s1187 ...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 8250 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(p0))||(G(p2)&&p1))))'
Support contains 630 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:42:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:30] [INFO ] Invariant cache hit.
[2023-03-17 16:42:31] [INFO ] Implicit Places using invariants in 959 ms returned [1205, 1206, 1301, 1302, 1303]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 962 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1325/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 1325 /1325 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 997 ms. Remains : 1325/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 0) (EQ s131 0) (EQ s66 0) (EQ s196 0) (EQ s139 0) (EQ s9 0) (EQ s74 0) (EQ s204 0) (EQ s17 0) (EQ s147 0) (EQ s82 0) (EQ s212 0) (EQ s155 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 1384 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)||(X(G(p1))&&G(p2))))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 33 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:42:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:42:31] [INFO ] Invariant cache hit.
[2023-03-17 16:42:32] [INFO ] Implicit Places using invariants in 794 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 796 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 852 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s943 1) (EQ s1182 1)) (AND (EQ s915 1) (EQ s1197 1)) (AND (EQ s914 1) (EQ s1184 1)) (AND (EQ s924 1) (EQ s1195 1)) (AND (EQ s938 1) (EQ s1...], 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 19895 reset in 1629 ms.
Product exploration explored 100000 steps with 19914 reset in 1614 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-17 16:42:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2023-03-17 16:42:36] [INFO ] Computed 20 place invariants in 11 ms
[2023-03-17 16:42:40] [INFO ] [Real]Absence check using 20 positive place invariants in 68 ms returned sat
[2023-03-17 16:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 16:42:45] [INFO ] [Real]Absence check using state equation in 5411 ms returned sat
[2023-03-17 16:42:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 16:42:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 50 ms returned sat
[2023-03-17 16:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 16:42:54] [INFO ] [Nat]Absence check using state equation in 4972 ms returned sat
[2023-03-17 16:42:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:42:54] [INFO ] [Nat]Added 330 Read/Feed constraints in 373 ms returned sat
[2023-03-17 16:42:55] [INFO ] Deduced a trap composed of 41 places in 1167 ms of which 1 ms to minimize.
[2023-03-17 16:42:57] [INFO ] Deduced a trap composed of 12 places in 1035 ms of which 1 ms to minimize.
[2023-03-17 16:42:58] [INFO ] Deduced a trap composed of 16 places in 992 ms of which 1 ms to minimize.
[2023-03-17 16:42:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3754 ms
[2023-03-17 16:42:58] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 150 ms.
[2023-03-17 16:43:02] [INFO ] Deduced a trap composed of 2 places in 1275 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-17 16:43:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 84 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1323 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1317 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1023 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1023 transition count 1688
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 981 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 945 transition count 1652
Applied a total of 756 rules in 201 ms. Remains 945 /1323 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-17 16:43:02] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-17 16:43:02] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-17 16:43:03] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-17 16:43:03] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:43:03] [INFO ] Invariant cache hit.
[2023-03-17 16:43:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:43:07] [INFO ] Implicit Places using invariants and state equation in 4804 ms returned []
Implicit Place search using SMT with State Equation took 5388 ms to find 0 implicit places.
[2023-03-17 16:43:08] [INFO ] Redundant transitions in 191 ms returned []
[2023-03-17 16:43:08] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:43:08] [INFO ] Invariant cache hit.
[2023-03-17 16:43:09] [INFO ] Dead Transitions using invariants and state equation in 1565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 945/1323 places, 1652/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7355 ms. Remains : 945/1323 places, 1652/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-17 16:43:10] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:43:10] [INFO ] Invariant cache hit.
[2023-03-17 16:43:12] [INFO ] [Real]Absence check using 20 positive place invariants in 54 ms returned sat
[2023-03-17 16:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 16:43:15] [INFO ] [Real]Absence check using state equation in 2834 ms returned sat
[2023-03-17 16:43:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 16:43:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 41 ms returned sat
[2023-03-17 16:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 16:43:20] [INFO ] [Nat]Absence check using state equation in 2305 ms returned sat
[2023-03-17 16:43:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:43:21] [INFO ] [Nat]Added 330 Read/Feed constraints in 377 ms returned sat
[2023-03-17 16:43:21] [INFO ] Deduced a trap composed of 13 places in 649 ms of which 1 ms to minimize.
[2023-03-17 16:43:22] [INFO ] Deduced a trap composed of 58 places in 729 ms of which 1 ms to minimize.
[2023-03-17 16:43:23] [INFO ] Deduced a trap composed of 52 places in 696 ms of which 1 ms to minimize.
[2023-03-17 16:43:24] [INFO ] Deduced a trap composed of 64 places in 685 ms of which 1 ms to minimize.
[2023-03-17 16:43:25] [INFO ] Deduced a trap composed of 40 places in 730 ms of which 1 ms to minimize.
[2023-03-17 16:43:25] [INFO ] Deduced a trap composed of 64 places in 433 ms of which 1 ms to minimize.
[2023-03-17 16:43:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4597 ms
[2023-03-17 16:43:25] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 122 ms.
[2023-03-17 16:43:31] [INFO ] Deduced a trap composed of 2 places in 921 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-17 16:43:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19921 reset in 1007 ms.
Product exploration explored 100000 steps with 19932 reset in 969 ms.
Built C files in :
/tmp/ltsmin7762897703121105949
[2023-03-17 16:43:33] [INFO ] Too many transitions (1652) to apply POR reductions. Disabling POR matrices.
[2023-03-17 16:43:33] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7762897703121105949
Running compilation step : cd /tmp/ltsmin7762897703121105949;'/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/ltsmin7762897703121105949;'/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/ltsmin7762897703121105949;'/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 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 0 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 72 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-17 16:43:36] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-17 16:43:36] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-17 16:43:37] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-17 16:43:37] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-17 16:43:37] [INFO ] Invariant cache hit.
[2023-03-17 16:43:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:43:39] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-17 16:43:39] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-17 16:43:39] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-17 16:43:39] [INFO ] Invariant cache hit.
[2023-03-17 16:43:39] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3080 ms. Remains : 399/945 places, 1106/1652 transitions.
Built C files in :
/tmp/ltsmin16911879962819217591
[2023-03-17 16:43:39] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2023-03-17 16:43:39] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:43:39] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2023-03-17 16:43:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:43:40] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2023-03-17 16:43:40] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:43:40] [INFO ] Built C files in 304ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16911879962819217591
Running compilation step : cd /tmp/ltsmin16911879962819217591;'/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/ltsmin16911879962819217591;'/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/ltsmin16911879962819217591;'/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-17 16:43:43] [INFO ] Flatten gal took : 70 ms
[2023-03-17 16:43:43] [INFO ] Flatten gal took : 53 ms
[2023-03-17 16:43:43] [INFO ] Time to serialize gal into /tmp/LTL3533209353951757847.gal : 25 ms
[2023-03-17 16:43:43] [INFO ] Time to serialize properties into /tmp/LTL14736305219371580131.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/LTL3533209353951757847.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13244784539408745674.hoa' '-atoms' '/tmp/LTL14736305219371580131.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...319
Loading property file /tmp/LTL14736305219371580131.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13244784539408745674.hoa
Detected timeout of ITS tools.
[2023-03-17 16:43:58] [INFO ] Flatten gal took : 66 ms
[2023-03-17 16:43:58] [INFO ] Flatten gal took : 66 ms
[2023-03-17 16:43:58] [INFO ] Time to serialize gal into /tmp/LTL4426510537151654253.gal : 9 ms
[2023-03-17 16:43:58] [INFO ] Time to serialize properties into /tmp/LTL3187401252813147857.ltl : 7 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/LTL4426510537151654253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3187401252813147857.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("((((((((TestTurn_3_1==1)&&(Turn_1_3==1))||((TestTurn_5_5==1)&&(Turn_5_5==1)))||(((TestTurn_2_5==1)&&(Turn_5_2==1))||((TestTurn_...18272
Formula 0 simplified : G!"((((((((TestTurn_3_1==1)&&(Turn_1_3==1))||((TestTurn_5_5==1)&&(Turn_5_5==1)))||(((TestTurn_2_5==1)&&(Turn_5_2==1))||((TestTurn_3_...18260
Detected timeout of ITS tools.
[2023-03-17 16:44:14] [INFO ] Flatten gal took : 56 ms
[2023-03-17 16:44:14] [INFO ] Applying decomposition
[2023-03-17 16:44:14] [INFO ] Flatten gal took : 58 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/graph12220675414217170561.txt' '-o' '/tmp/graph12220675414217170561.bin' '-w' '/tmp/graph12220675414217170561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12220675414217170561.bin' '-l' '-1' '-v' '-w' '/tmp/graph12220675414217170561.weights' '-q' '0' '-e' '0.001'
[2023-03-17 16:44:14] [INFO ] Decomposing Gal with order
[2023-03-17 16:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 16:44:14] [INFO ] Removed a total of 2072 redundant transitions.
[2023-03-17 16:44:14] [INFO ] Flatten gal took : 211 ms
[2023-03-17 16:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 33 ms.
[2023-03-17 16:44:15] [INFO ] Time to serialize gal into /tmp/LTL7766589006216484645.gal : 23 ms
[2023-03-17 16:44:15] [INFO ] Time to serialize properties into /tmp/LTL12452288611512592436.ltl : 4 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/LTL7766589006216484645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12452288611512592436.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 : !(((F("((((((((i23.u337.TestTurn_3_1==1)&&(i23.u340.Turn_1_3==1))||((i21.i3.u102.TestTurn_5_5==1)&&(i21.i3.u326.Turn_5_5==1)))||(((i1....27504
Formula 0 simplified : G!"((((((((i23.u337.TestTurn_3_1==1)&&(i23.u340.Turn_1_3==1))||((i21.i3.u102.TestTurn_5_5==1)&&(i21.i3.u326.Turn_5_5==1)))||(((i1.i2...27492
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9993663646491748843
[2023-03-17 16:44:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9993663646491748843
Running compilation step : cd /tmp/ltsmin9993663646491748843;'/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/ltsmin9993663646491748843;'/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/ltsmin9993663646491748843;'/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 Peterson-PT-6-LTLFireability-04 finished in 121543 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((X(F((p1&&F(p2))))||p0))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:44:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-17 16:44:33] [INFO ] Computed 27 place invariants in 10 ms
[2023-03-17 16:44:34] [INFO ] Implicit Places using invariants in 760 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 767 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 842 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s260 1) (EQ s261 1) (EQ s262 1) (EQ s263 1) (EQ s256 1) (EQ s257 1) (EQ s258 1) (EQ s259 1) (EQ s268 1) (EQ s269 1) (EQ s270 1) (EQ s271 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 965 ms.
Stack based approach found an accepted trace after 491 steps with 0 reset with depth 492 and stack size 492 in 6 ms.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-05 finished in 2023 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((p0&&X(F(p1)))))'
Support contains 42 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:44:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:35] [INFO ] Invariant cache hit.
[2023-03-17 16:44:36] [INFO ] Implicit Places using invariants in 933 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 936 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1007 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s341 0) (EQ s324 0) (EQ s343 0) (EQ s342 0) (EQ s323 0) (EQ s322 0) (EQ s344 0)), p0:(OR (EQ s333 1) (EQ s335 1) (EQ s334 1) (EQ s340 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 1188 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(((p1 U X(G(!p2)))&&p0)))'
Support contains 350 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:44:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:36] [INFO ] Invariant cache hit.
[2023-03-17 16:44:37] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-17 16:44:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:37] [INFO ] Invariant cache hit.
[2023-03-17 16:44:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:44:47] [INFO ] Implicit Places using invariants and state equation in 9632 ms returned []
Implicit Place search using SMT with State Equation took 10539 ms to find 0 implicit places.
[2023-03-17 16:44:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:47] [INFO ] Invariant cache hit.
[2023-03-17 16:44:49] [INFO ] Dead Transitions using invariants and state equation in 2446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13021 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s260 1) (EQ s261 1) (EQ s262 1) (EQ s263 1) (EQ s256 1) (EQ s257 1) (EQ s258 1) (EQ s259 1) (EQ s268 1) (EQ s269 1) (EQ s270 1) (EQ s271 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 13217 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((G((p0||(p1 U X(p2))))&&F(G(p3))))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:44:49] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:49] [INFO ] Invariant cache hit.
[2023-03-17 16:44:50] [INFO ] Implicit Places using invariants in 913 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 915 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 993 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p3), (NOT p2), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s949 1) (EQ s1198 1)), p1:(EQ s337 1), p3:(AND (EQ s925 1) (EQ s1206 1)), p2:(AND (EQ s1196 1) (EQ s1274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 1313 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(((p0 U (G(p0)||(p0&&(p1||F(p2)))))&&(F(p4)||p3))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:44:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:44:51] [INFO ] Invariant cache hit.
[2023-03-17 16:44:52] [INFO ] Implicit Places using invariants in 907 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 910 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 993 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p3) (NOT p4))), true, (NOT p4), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p4) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s253 1), p3:(OR (EQ s599 0) (EQ s674 0)), p4:(OR (EQ s601 0) (EQ s1306 0)), p1:(AND (EQ s599 1) (EQ s674 1)), p2:(AND (EQ s601 1) (EQ s1306 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 304 reset in 349 ms.
Product exploration explored 100000 steps with 329 reset in 380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p3) (NOT p4) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p4))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 365 ms. Reduced automaton from 6 states, 9 edges and 5 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:44:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2023-03-17 16:44:53] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-17 16:44:54] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:44:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-17 16:44:55] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:44:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:44:55] [INFO ] After 136ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:44:55] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-17 16:44:55] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1323 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 737 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 737 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 443 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 402 transition count 1109
Applied a total of 1842 rules in 84 ms. Remains 402 /1323 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 402/1323 places, 1109/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 737880 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 737880 steps, saw 99875 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:44:58] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 402 cols
[2023-03-17 16:44:58] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-17 16:44:59] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:44:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-17 16:44:59] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:44:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:44:59] [INFO ] After 95ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:44:59] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-17 16:44:59] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 17 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 402/402 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 16 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-17 16:44:59] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:44:59] [INFO ] Invariant cache hit.
[2023-03-17 16:45:00] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-17 16:45:00] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:45:00] [INFO ] Invariant cache hit.
[2023-03-17 16:45:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:02] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
[2023-03-17 16:45:02] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-17 16:45:02] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:45:02] [INFO ] Invariant cache hit.
[2023-03-17 16:45:03] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3818 ms. Remains : 402/402 places, 1109/1109 transitions.
Graph (trivial) has 840 edges and 402 vertex of which 294 / 402 are part of one of the 42 SCC in 1 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 150 transition count 313
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 109 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 103 place count 96 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 115 place count 90 transition count 306
Graph (trivial) has 43 edges and 90 vertex of which 36 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 54 transition count 306
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 223 edges and 54 vertex of which 36 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 159 place count 24 transition count 270
Drop transitions removed 180 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 1 with 245 rules applied. Total rules applied 404 place count 24 transition count 25
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 422 place count 12 transition count 19
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 432 place count 12 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 435 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 435 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 439 place count 7 transition count 7
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 4 with 2 rules applied. Total rules applied 441 place count 6 transition count 6
Applied a total of 441 rules in 18 ms. Remains 6 /402 variables (removed 396) and now considering 6/1109 (removed 1103) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 16:45:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 16:45:03] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:45:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 16:45:03] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:03] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-17 16:45:03] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p3) (NOT p4) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p4))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 476 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:45:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2023-03-17 16:45:04] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-17 16:45:05] [INFO ] Implicit Places using invariants in 869 ms returned []
[2023-03-17 16:45:05] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:45:05] [INFO ] Invariant cache hit.
[2023-03-17 16:45:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:14] [INFO ] Implicit Places using invariants and state equation in 8818 ms returned []
Implicit Place search using SMT with State Equation took 9694 ms to find 0 implicit places.
[2023-03-17 16:45:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:45:14] [INFO ] Invariant cache hit.
[2023-03-17 16:45:16] [INFO ] Dead Transitions using invariants and state equation in 2649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12395 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 358 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:45:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:45:17] [INFO ] Invariant cache hit.
[2023-03-17 16:45:17] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:45:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2023-03-17 16:45:18] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:19] [INFO ] After 140ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:19] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-17 16:45:19] [INFO ] After 1649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1323 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 737 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 737 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 443 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 402 transition count 1109
Applied a total of 1842 rules in 67 ms. Remains 402 /1323 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 402/1323 places, 1109/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 743704 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 743704 steps, saw 100502 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:45:22] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 402 cols
[2023-03-17 16:45:22] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-17 16:45:22] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:45:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-17 16:45:22] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:23] [INFO ] After 91ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:23] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-17 16:45:23] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 16 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 402/402 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-17 16:45:23] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:45:23] [INFO ] Invariant cache hit.
[2023-03-17 16:45:23] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-17 16:45:23] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:45:23] [INFO ] Invariant cache hit.
[2023-03-17 16:45:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:26] [INFO ] Implicit Places using invariants and state equation in 2425 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
[2023-03-17 16:45:26] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-17 16:45:26] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-17 16:45:26] [INFO ] Invariant cache hit.
[2023-03-17 16:45:27] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4196 ms. Remains : 402/402 places, 1109/1109 transitions.
Graph (trivial) has 840 edges and 402 vertex of which 294 / 402 are part of one of the 42 SCC in 2 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 150 transition count 313
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 109 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 103 place count 96 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 115 place count 90 transition count 306
Graph (trivial) has 43 edges and 90 vertex of which 36 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 54 transition count 306
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 223 edges and 54 vertex of which 36 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 159 place count 24 transition count 270
Drop transitions removed 180 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 1 with 245 rules applied. Total rules applied 404 place count 24 transition count 25
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 422 place count 12 transition count 19
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 432 place count 12 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 435 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 435 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 439 place count 7 transition count 7
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 4 with 2 rules applied. Total rules applied 441 place count 6 transition count 6
Applied a total of 441 rules in 27 ms. Remains 6 /402 variables (removed 396) and now considering 6/1109 (removed 1103) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 16:45:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 16:45:27] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:45:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 16:45:27] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:45:27] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-17 16:45:27] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 324 reset in 316 ms.
Product exploration explored 100000 steps with 324 reset in 333 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 334 place count 1323 transition count 2210
Deduced a syphon composed of 593 places in 2 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 593 place count 1323 transition count 2210
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 742 place count 1174 transition count 2061
Deduced a syphon composed of 444 places in 1 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 891 place count 1174 transition count 2061
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 771 places in 1 ms
Iterating global reduction 1 with 327 rules applied. Total rules applied 1218 place count 1174 transition count 2061
Discarding 290 places :
Symmetric choice reduction at 1 with 290 rule applications. Total rules 1508 place count 884 transition count 1771
Deduced a syphon composed of 481 places in 1 ms
Iterating global reduction 1 with 290 rules applied. Total rules applied 1798 place count 884 transition count 1771
Deduced a syphon composed of 481 places in 1 ms
Applied a total of 1798 rules in 435 ms. Remains 884 /1323 variables (removed 439) and now considering 1771/2030 (removed 259) transitions.
[2023-03-17 16:45:29] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-17 16:45:29] [INFO ] Flow matrix only has 1561 transitions (discarded 210 similar events)
// Phase 1: matrix 1561 rows 884 cols
[2023-03-17 16:45:29] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 16:45:30] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 884/1323 places, 1771/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1657 ms. Remains : 884/1323 places, 1771/2030 transitions.
Built C files in :
/tmp/ltsmin8328249384720171063
[2023-03-17 16:45:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8328249384720171063
Running compilation step : cd /tmp/ltsmin8328249384720171063;'/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/ltsmin8328249384720171063;'/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/ltsmin8328249384720171063;'/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 5 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 49 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:45:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2023-03-17 16:45:33] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-17 16:45:34] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-17 16:45:34] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:45:34] [INFO ] Invariant cache hit.
[2023-03-17 16:45:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:45:43] [INFO ] Implicit Places using invariants and state equation in 8541 ms returned []
Implicit Place search using SMT with State Equation took 9398 ms to find 0 implicit places.
[2023-03-17 16:45:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-17 16:45:43] [INFO ] Invariant cache hit.
[2023-03-17 16:45:45] [INFO ] Dead Transitions using invariants and state equation in 2557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12005 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin18352096915297371900
[2023-03-17 16:45:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18352096915297371900
Running compilation step : cd /tmp/ltsmin18352096915297371900;'/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/ltsmin18352096915297371900;'/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/ltsmin18352096915297371900;'/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-17 16:45:48] [INFO ] Flatten gal took : 65 ms
[2023-03-17 16:45:48] [INFO ] Flatten gal took : 64 ms
[2023-03-17 16:45:49] [INFO ] Time to serialize gal into /tmp/LTL9818436063899192523.gal : 10 ms
[2023-03-17 16:45:49] [INFO ] Time to serialize properties into /tmp/LTL13342187457666128598.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/LTL9818436063899192523.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13290820771955843883.hoa' '-atoms' '/tmp/LTL13342187457666128598.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...319
Loading property file /tmp/LTL13342187457666128598.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13290820771955843883.hoa
Detected timeout of ITS tools.
[2023-03-17 16:46:04] [INFO ] Flatten gal took : 54 ms
[2023-03-17 16:46:04] [INFO ] Flatten gal took : 63 ms
[2023-03-17 16:46:04] [INFO ] Time to serialize gal into /tmp/LTL3590104336726688806.gal : 10 ms
[2023-03-17 16:46:04] [INFO ] Time to serialize properties into /tmp/LTL16390753004570888553.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/LTL3590104336726688806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16390753004570888553.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 : !((X((("(IsEndLoop_6_2_6==0)")U((G("(IsEndLoop_6_2_6==0)"))||(("(IsEndLoop_6_2_6==0)")&&(("((WantSection_0_T==1)&&(TestAlone_2_0_0==1)...301
Formula 0 simplified : X((!"((WantSection_0_T==0)||(TestAlone_2_0_0==0))" & G!"((WantSection_6_T==0)||(CS_6==0))") | ((!"((WantSection_0_T==1)&&(TestAlone_...235
Detected timeout of ITS tools.
[2023-03-17 16:46:19] [INFO ] Flatten gal took : 49 ms
[2023-03-17 16:46:19] [INFO ] Applying decomposition
[2023-03-17 16:46:19] [INFO ] Flatten gal took : 52 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/graph9162488027878985047.txt' '-o' '/tmp/graph9162488027878985047.bin' '-w' '/tmp/graph9162488027878985047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9162488027878985047.bin' '-l' '-1' '-v' '-w' '/tmp/graph9162488027878985047.weights' '-q' '0' '-e' '0.001'
[2023-03-17 16:46:19] [INFO ] Decomposing Gal with order
[2023-03-17 16:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 16:46:19] [INFO ] Removed a total of 1792 redundant transitions.
[2023-03-17 16:46:19] [INFO ] Flatten gal took : 127 ms
[2023-03-17 16:46:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-17 16:46:19] [INFO ] Time to serialize gal into /tmp/LTL10937354198302810751.gal : 20 ms
[2023-03-17 16:46:19] [INFO ] Time to serialize properties into /tmp/LTL9464629888388952859.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/LTL10937354198302810751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9464629888388952859.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 : !((X((("(i42.i0.i2.u123.IsEndLoop_6_2_6==0)")U((G("(i42.i0.i2.u123.IsEndLoop_6_2_6==0)"))||(("(i42.i0.i2.u123.IsEndLoop_6_2_6==0)")&&(...430
Formula 0 simplified : X((!"((i16.u319.WantSection_0_T==0)||(i17.i1.i0.u377.TestAlone_2_0_0==0))" & G!"((i44.u317.WantSection_6_T==0)||(i44.u138.CS_6==0))"...334
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11264645907678028274
[2023-03-17 16:46:35] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11264645907678028274
Running compilation step : cd /tmp/ltsmin11264645907678028274;'/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/ltsmin11264645907678028274;'/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/ltsmin11264645907678028274;'/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 Peterson-PT-6-LTLFireability-11 finished in 107032 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(F(p0)))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 77 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2023-03-17 16:46:38] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2023-03-17 16:46:38] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-17 16:46:38] [INFO ] Implicit Places using invariants in 591 ms returned [387, 390, 398, 399, 400, 401]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 594 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 400/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s307 1) (EQ s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 190 reset in 236 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 1067 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)) U (p1 U (!p0||G(p2)))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1330 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 61 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
[2023-03-17 16:46:39] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2023-03-17 16:46:39] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-17 16:46:39] [INFO ] Implicit Places using invariants in 554 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 556 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1109/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 402/1330 places, 1109/2030 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s211 1), p2:(AND (EQ s317 1) (EQ s378 1)), p1:(AND (EQ s298 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 983 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) U (p1&&G(p0)))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 46 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-17 16:46:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-17 16:46:40] [INFO ] Computed 27 place invariants in 8 ms
[2023-03-17 16:46:40] [INFO ] Implicit Places using invariants in 812 ms returned [1206, 1208, 1301, 1302, 1303, 1304]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 815 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 908 ms. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s296 1) (NOT (AND (EQ s681 1) (EQ s1205 1)))), p1:(OR (EQ s341 1) (AND (EQ s603 1) (EQ s1306 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-14 finished in 1043 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)||(X(G(p1))&&G(p2))))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-04
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1030 transition count 1688
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 988 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 952 transition count 1652
Applied a total of 756 rules in 120 ms. Remains 952 /1330 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-17 16:46:41] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 952 cols
[2023-03-17 16:46:41] [INFO ] Computed 27 place invariants in 14 ms
[2023-03-17 16:46:42] [INFO ] Implicit Places using invariants in 578 ms returned [933, 934, 936, 944, 945, 946, 947]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 580 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 945/1330 places, 1652/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 719 ms. Remains : 945/1330 places, 1652/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s882 1) (EQ s910 1)) (AND (EQ s854 1) (EQ s925 1)) (AND (EQ s853 1) (EQ s912 1)) (AND (EQ s863 1) (EQ s923 1)) (AND (EQ s877 1) (EQ s915 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19927 reset in 1438 ms.
Product exploration explored 100000 steps with 19903 reset in 1430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-17 16:46:45] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-17 16:46:45] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 16:46:48] [INFO ] [Real]Absence check using 20 positive place invariants in 47 ms returned sat
[2023-03-17 16:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 16:46:50] [INFO ] [Real]Absence check using state equation in 2726 ms returned sat
[2023-03-17 16:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 16:46:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-17 16:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 16:46:55] [INFO ] [Nat]Absence check using state equation in 2149 ms returned sat
[2023-03-17 16:46:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:46:56] [INFO ] [Nat]Added 330 Read/Feed constraints in 232 ms returned sat
[2023-03-17 16:46:56] [INFO ] Deduced a trap composed of 56 places in 660 ms of which 1 ms to minimize.
[2023-03-17 16:46:57] [INFO ] Deduced a trap composed of 13 places in 618 ms of which 1 ms to minimize.
[2023-03-17 16:46:58] [INFO ] Deduced a trap composed of 19 places in 628 ms of which 1 ms to minimize.
[2023-03-17 16:46:58] [INFO ] Deduced a trap composed of 14 places in 570 ms of which 1 ms to minimize.
[2023-03-17 16:46:59] [INFO ] Deduced a trap composed of 34 places in 694 ms of which 2 ms to minimize.
[2023-03-17 16:47:00] [INFO ] Deduced a trap composed of 31 places in 762 ms of which 2 ms to minimize.
[2023-03-17 16:47:01] [INFO ] Deduced a trap composed of 11 places in 796 ms of which 5 ms to minimize.
[2023-03-17 16:47:02] [INFO ] Deduced a trap composed of 34 places in 583 ms of which 1 ms to minimize.
[2023-03-17 16:47:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6134 ms
[2023-03-17 16:47:02] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 115 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-17 16:47:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 84 out of 945 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Applied a total of 0 rules in 23 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
[2023-03-17 16:47:06] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:47:06] [INFO ] Invariant cache hit.
[2023-03-17 16:47:06] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-17 16:47:06] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:47:06] [INFO ] Invariant cache hit.
[2023-03-17 16:47:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:47:11] [INFO ] Implicit Places using invariants and state equation in 4882 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
[2023-03-17 16:47:11] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-17 16:47:11] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:47:11] [INFO ] Invariant cache hit.
[2023-03-17 16:47:13] [INFO ] Dead Transitions using invariants and state equation in 1983 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7510 ms. Remains : 945/945 places, 1652/1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-17 16:47:14] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-17 16:47:14] [INFO ] Invariant cache hit.
[2023-03-17 16:47:16] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2023-03-17 16:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 16:47:19] [INFO ] [Real]Absence check using state equation in 2828 ms returned sat
[2023-03-17 16:47:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 16:47:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 42 ms returned sat
[2023-03-17 16:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 16:47:24] [INFO ] [Nat]Absence check using state equation in 2271 ms returned sat
[2023-03-17 16:47:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:47:24] [INFO ] [Nat]Added 330 Read/Feed constraints in 376 ms returned sat
[2023-03-17 16:47:25] [INFO ] Deduced a trap composed of 13 places in 715 ms of which 1 ms to minimize.
[2023-03-17 16:47:26] [INFO ] Deduced a trap composed of 58 places in 717 ms of which 1 ms to minimize.
[2023-03-17 16:47:27] [INFO ] Deduced a trap composed of 52 places in 639 ms of which 1 ms to minimize.
[2023-03-17 16:47:27] [INFO ] Deduced a trap composed of 64 places in 622 ms of which 1 ms to minimize.
[2023-03-17 16:47:28] [INFO ] Deduced a trap composed of 40 places in 676 ms of which 1 ms to minimize.
[2023-03-17 16:47:29] [INFO ] Deduced a trap composed of 64 places in 431 ms of which 1 ms to minimize.
[2023-03-17 16:47:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4466 ms
[2023-03-17 16:47:29] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 106 ms.
[2023-03-17 16:47:35] [INFO ] Deduced a trap composed of 2 places in 809 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-17 16:47:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19879 reset in 1100 ms.
Product exploration explored 100000 steps with 19922 reset in 973 ms.
Built C files in :
/tmp/ltsmin6071634063827180293
[2023-03-17 16:47:37] [INFO ] Too many transitions (1652) to apply POR reductions. Disabling POR matrices.
[2023-03-17 16:47:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6071634063827180293
Running compilation step : cd /tmp/ltsmin6071634063827180293;'/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/ltsmin6071634063827180293;'/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/ltsmin6071634063827180293;'/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 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 54 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-17 16:47:40] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-17 16:47:40] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-17 16:47:41] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-17 16:47:41] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-17 16:47:41] [INFO ] Invariant cache hit.
[2023-03-17 16:47:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-17 16:47:42] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2023-03-17 16:47:43] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-17 16:47:43] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-17 16:47:43] [INFO ] Invariant cache hit.
[2023-03-17 16:47:44] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3668 ms. Remains : 399/945 places, 1106/1652 transitions.
Built C files in :
/tmp/ltsmin14571863040572207704
[2023-03-17 16:47:44] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2023-03-17 16:47:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:47:44] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2023-03-17 16:47:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:47:44] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2023-03-17 16:47:44] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 16:47:44] [INFO ] Built C files in 300ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14571863040572207704
Running compilation step : cd /tmp/ltsmin14571863040572207704;'/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/ltsmin14571863040572207704;'/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/ltsmin14571863040572207704;'/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-17 16:47:47] [INFO ] Flatten gal took : 29 ms
[2023-03-17 16:47:47] [INFO ] Flatten gal took : 28 ms
[2023-03-17 16:47:47] [INFO ] Time to serialize gal into /tmp/LTL5085241847238600884.gal : 11 ms
[2023-03-17 16:47:47] [INFO ] Time to serialize properties into /tmp/LTL16836588183130296595.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/LTL5085241847238600884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2296055218806480257.hoa' '-atoms' '/tmp/LTL16836588183130296595.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/LTL16836588183130296595.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2296055218806480257.hoa
Detected timeout of ITS tools.
[2023-03-17 16:48:02] [INFO ] Flatten gal took : 41 ms
[2023-03-17 16:48:02] [INFO ] Flatten gal took : 42 ms
[2023-03-17 16:48:02] [INFO ] Time to serialize gal into /tmp/LTL3415761186371412142.gal : 8 ms
[2023-03-17 16:48:02] [INFO ] Time to serialize properties into /tmp/LTL3045207703825580760.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/LTL3415761186371412142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3045207703825580760.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("((((((((TestTurn_3_1==1)&&(Turn_1_3==1))||((TestTurn_5_5==1)&&(Turn_5_5==1)))||(((TestTurn_2_5==1)&&(Turn_5_2==1))||((TestTurn_...18272
Formula 0 simplified : G!"((((((((TestTurn_3_1==1)&&(Turn_1_3==1))||((TestTurn_5_5==1)&&(Turn_5_5==1)))||(((TestTurn_2_5==1)&&(Turn_5_2==1))||((TestTurn_3_...18260
Detected timeout of ITS tools.
[2023-03-17 16:48:17] [INFO ] Flatten gal took : 38 ms
[2023-03-17 16:48:17] [INFO ] Applying decomposition
[2023-03-17 16:48:18] [INFO ] Flatten gal took : 39 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/graph14376601450693425355.txt' '-o' '/tmp/graph14376601450693425355.bin' '-w' '/tmp/graph14376601450693425355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14376601450693425355.bin' '-l' '-1' '-v' '-w' '/tmp/graph14376601450693425355.weights' '-q' '0' '-e' '0.001'
[2023-03-17 16:48:18] [INFO ] Decomposing Gal with order
[2023-03-17 16:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 16:48:18] [INFO ] Removed a total of 2072 redundant transitions.
[2023-03-17 16:48:18] [INFO ] Flatten gal took : 101 ms
[2023-03-17 16:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-17 16:48:18] [INFO ] Time to serialize gal into /tmp/LTL4597811672354433724.gal : 15 ms
[2023-03-17 16:48:18] [INFO ] Time to serialize properties into /tmp/LTL13955738223341274980.ltl : 6 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/LTL4597811672354433724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13955738223341274980.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 : !(((F("((((((((i6.u335.TestTurn_3_1==1)&&(i6.u88.Turn_1_3==1))||((i13.i0.u92.TestTurn_5_5==1)&&(i13.i0.u104.Turn_5_5==1)))||(((i15.i1....27148
Formula 0 simplified : G!"((((((((i6.u335.TestTurn_3_1==1)&&(i6.u88.Turn_1_3==1))||((i13.i0.u92.TestTurn_5_5==1)&&(i13.i0.u104.Turn_5_5==1)))||(((i15.i1.u3...27136
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5336165241590969896
[2023-03-17 16:48:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5336165241590969896
Running compilation step : cd /tmp/ltsmin5336165241590969896;'/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/ltsmin5336165241590969896;'/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/ltsmin5336165241590969896;'/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 Peterson-PT-6-LTLFireability-04 finished in 115468 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(((p0 U (G(p0)||(p0&&(p1||F(p2)))))&&(F(p4)||p3))))'
[2023-03-17 16:48:36] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5877936573899763969
[2023-03-17 16:48:36] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2023-03-17 16:48:36] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5877936573899763969
Running compilation step : cd /tmp/ltsmin5877936573899763969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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-17 16:48:36] [INFO ] Applying decomposition
[2023-03-17 16:48:36] [INFO ] Flatten gal took : 68 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/graph8548401618830861547.txt' '-o' '/tmp/graph8548401618830861547.bin' '-w' '/tmp/graph8548401618830861547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8548401618830861547.bin' '-l' '-1' '-v' '-w' '/tmp/graph8548401618830861547.weights' '-q' '0' '-e' '0.001'
[2023-03-17 16:48:37] [INFO ] Decomposing Gal with order
[2023-03-17 16:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 16:48:37] [INFO ] Removed a total of 1787 redundant transitions.
[2023-03-17 16:48:37] [INFO ] Flatten gal took : 96 ms
[2023-03-17 16:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-17 16:48:37] [INFO ] Time to serialize gal into /tmp/LTLFireability15212592775734410884.gal : 33 ms
[2023-03-17 16:48:37] [INFO ] Time to serialize properties into /tmp/LTLFireability17474872435964020317.ltl : 6 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/LTLFireability15212592775734410884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17474872435964020317.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 2 LTL properties
Checking formula 0 : !(((F("((((((((i39.i0.i0.u62.TestTurn_3_1==1)&&(i39.i0.i0.u62.Turn_1_3==1))||((i38.u78.TestTurn_5_5==1)&&(i38.u78.Turn_5_5==1)))||(((i...28202
Formula 0 simplified : G!"((((((((i39.i0.i0.u62.TestTurn_3_1==1)&&(i39.i0.i0.u62.Turn_1_3==1))||((i38.u78.TestTurn_5_5==1)&&(i38.u78.Turn_5_5==1)))||(((i38...28190
Compilation finished in 7260 ms.
Running link step : cd /tmp/ltsmin5877936573899763969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin5877936573899763969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||(X([]((LTLAPp1==true)))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 1505 ms.
FORMULA Peterson-PT-6-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5877936573899763969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&((LTLAPp4==true)||<>((LTLAPp5==true))))))&&(<>((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 17:11:22] [INFO ] Applying decomposition
[2023-03-17 17:11:23] [INFO ] Flatten gal took : 693 ms
[2023-03-17 17:11:23] [INFO ] Decomposing Gal with order
[2023-03-17 17:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 17:11:25] [INFO ] Removed a total of 1380 redundant transitions.
[2023-03-17 17:11:26] [INFO ] Flatten gal took : 2148 ms
[2023-03-17 17:11:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 300 ms.
[2023-03-17 17:11:26] [INFO ] Time to serialize gal into /tmp/LTLFireability14717803583528128949.gal : 131 ms
[2023-03-17 17:11:26] [INFO ] Time to serialize properties into /tmp/LTLFireability2507489914074248052.ltl : 6 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/LTLFireability14717803583528128949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2507489914074248052.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...277
Read 1 LTL properties
Checking formula 0 : !((X((("(u2.IsEndLoop_6_2_6!=1)")U((G("(u2.IsEndLoop_6_2_6!=1)"))||(("(u2.IsEndLoop_6_2_6!=1)")&&(("((u19.WantSection_0_T==1)&&(u6.Tes...338
Formula 0 simplified : X((!"((u19.WantSection_0_T==0)||(u6.TestAlone_2_0_0==0))" & G!"((u20.WantSection_6_T==0)||(u2.CS_6==0))") | ((!"((u19.WantSection_0_...266
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5877936573899763969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&((LTLAPp4==true)||<>((LTLAPp5==true))))))&&(<>((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5877936573899763969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&((LTLAPp4==true)||<>((LTLAPp5==true))))))&&(<>((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 17:34:08] [INFO ] Flatten gal took : 577 ms
[2023-03-17 17:34:13] [INFO ] Input system was already deterministic with 2030 transitions.
[2023-03-17 17:34:13] [INFO ] Transformed 1330 places.
[2023-03-17 17:34:13] [INFO ] Transformed 2030 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-17 17:34:13] [INFO ] Time to serialize gal into /tmp/LTLFireability2628741189600047291.gal : 17 ms
[2023-03-17 17:34:13] [INFO ] Time to serialize properties into /tmp/LTLFireability17595506844101637971.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/LTLFireability2628741189600047291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17595506844101637971.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("(IsEndLoop_6_2_6!=1)")U((G("(IsEndLoop_6_2_6!=1)"))||(("(IsEndLoop_6_2_6!=1)")&&(("((WantSection_0_T==1)&&(TestAlone_2_0_0==1)...301
Formula 0 simplified : X((!"((WantSection_0_T==0)||(TestAlone_2_0_0==0))" & G!"((WantSection_6_T==0)||(CS_6==0))") | ((!"((WantSection_0_T==1)&&(TestAlone_...235
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10698624 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15609816 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Peterson-PT-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Peterson-PT-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536600636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;