About the Execution of LoLa+red for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 838.436 | 480366.00 | 543703.00 | 2153.30 | TFFFFTFTF?FFTFFF | 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.r263-smll-167863538500635.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 lolaxred
Input is Peterson-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500635
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME Peterson-PT-6-LTLCardinality-01
FORMULA_NAME Peterson-PT-6-LTLCardinality-02
FORMULA_NAME Peterson-PT-6-LTLCardinality-03
FORMULA_NAME Peterson-PT-6-LTLCardinality-04
FORMULA_NAME Peterson-PT-6-LTLCardinality-05
FORMULA_NAME Peterson-PT-6-LTLCardinality-06
FORMULA_NAME Peterson-PT-6-LTLCardinality-07
FORMULA_NAME Peterson-PT-6-LTLCardinality-08
FORMULA_NAME Peterson-PT-6-LTLCardinality-09
FORMULA_NAME Peterson-PT-6-LTLCardinality-10
FORMULA_NAME Peterson-PT-6-LTLCardinality-11
FORMULA_NAME Peterson-PT-6-LTLCardinality-12
FORMULA_NAME Peterson-PT-6-LTLCardinality-13
FORMULA_NAME Peterson-PT-6-LTLCardinality-14
FORMULA_NAME Peterson-PT-6-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678872559949
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 09:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 09:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:29:24] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2023-03-15 09:29:24] [INFO ] Transformed 1330 places.
[2023-03-15 09:29:24] [INFO ] Transformed 2030 transitions.
[2023-03-15 09:29:24] [INFO ] Found NUPN structural information;
[2023-03-15 09:29:24] [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-15 09:29:24] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-6-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1234 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 49 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:29:24] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:29:24] [INFO ] Computed 27 place invariants in 40 ms
[2023-03-15 09:29:25] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-15 09:29:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:29:25] [INFO ] Invariant cache hit.
[2023-03-15 09:29:26] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2023-03-15 09:29:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:29:26] [INFO ] Invariant cache hit.
[2023-03-15 09:29:29] [INFO ] Dead Transitions using invariants and state equation in 2772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4781 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1234 out of 1330 places after structural reductions.
[2023-03-15 09:29:30] [INFO ] Flatten gal took : 292 ms
[2023-03-15 09:29:30] [INFO ] Flatten gal took : 182 ms
[2023-03-15 09:29:30] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=9 ) properties (out of 26) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 09:29:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:29:32] [INFO ] Invariant cache hit.
[2023-03-15 09:29:33] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2023-03-15 09:29:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 09:29:36] [INFO ] After 3672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 09:29:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-15 09:29:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:29:39] [INFO ] After 2745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 09:29:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:29:42] [INFO ] After 2484ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 09:29:44] [INFO ] Deduced a trap composed of 114 places in 1560 ms of which 8 ms to minimize.
[2023-03-15 09:29:46] [INFO ] Deduced a trap composed of 112 places in 1671 ms of which 4 ms to minimize.
[2023-03-15 09:29:47] [INFO ] Deduced a trap composed of 114 places in 1434 ms of which 2 ms to minimize.
[2023-03-15 09:29:49] [INFO ] Deduced a trap composed of 79 places in 1397 ms of which 5 ms to minimize.
[2023-03-15 09:29:50] [INFO ] Deduced a trap composed of 105 places in 1008 ms of which 2 ms to minimize.
[2023-03-15 09:29:51] [INFO ] Deduced a trap composed of 12 places in 1107 ms of which 1 ms to minimize.
[2023-03-15 09:29:52] [INFO ] Deduced a trap composed of 48 places in 1219 ms of which 1 ms to minimize.
[2023-03-15 09:29:54] [INFO ] Deduced a trap composed of 12 places in 1285 ms of which 2 ms to minimize.
[2023-03-15 09:29:55] [INFO ] Deduced a trap composed of 40 places in 1234 ms of which 2 ms to minimize.
[2023-03-15 09:29:56] [INFO ] Deduced a trap composed of 31 places in 1346 ms of which 2 ms to minimize.
[2023-03-15 09:29:58] [INFO ] Deduced a trap composed of 12 places in 1046 ms of which 1 ms to minimize.
[2023-03-15 09:29:59] [INFO ] Deduced a trap composed of 12 places in 1157 ms of which 1 ms to minimize.
[2023-03-15 09:30:00] [INFO ] Deduced a trap composed of 12 places in 1095 ms of which 2 ms to minimize.
[2023-03-15 09:30:01] [INFO ] Deduced a trap composed of 12 places in 1167 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.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-15 09:30:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:30:01] [INFO ] After 25491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 336 ms.
Support contains 347 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 1330 transition count 1781
Reduce places removed 249 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 501 rules applied. Total rules applied 750 place count 1081 transition count 1529
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1002 place count 829 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1002 place count 829 transition count 1488
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1084 place count 788 transition count 1488
Applied a total of 1084 rules in 476 ms. Remains 788 /1330 variables (removed 542) and now considering 1488/2030 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 788/1330 places, 1488/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 223856 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223856 steps, saw 42049 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 09:30:06] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
// Phase 1: matrix 1278 rows 788 cols
[2023-03-15 09:30:06] [INFO ] Computed 27 place invariants in 16 ms
[2023-03-15 09:30:06] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 09:30:06] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 09:30:08] [INFO ] After 2126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 09:30:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 09:30:09] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 09:30:11] [INFO ] After 1987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 09:30:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:30:12] [INFO ] After 1410ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 09:30:13] [INFO ] Deduced a trap composed of 12 places in 601 ms of which 2 ms to minimize.
[2023-03-15 09:30:14] [INFO ] Deduced a trap composed of 134 places in 770 ms of which 2 ms to minimize.
[2023-03-15 09:30:15] [INFO ] Deduced a trap composed of 149 places in 786 ms of which 1 ms to minimize.
[2023-03-15 09:30:15] [INFO ] Deduced a trap composed of 143 places in 776 ms of which 2 ms to minimize.
[2023-03-15 09:30:16] [INFO ] Deduced a trap composed of 159 places in 777 ms of which 1 ms to minimize.
[2023-03-15 09:30:17] [INFO ] Deduced a trap composed of 177 places in 772 ms of which 2 ms to minimize.
[2023-03-15 09:30:18] [INFO ] Deduced a trap composed of 177 places in 757 ms of which 1 ms to minimize.
[2023-03-15 09:30:19] [INFO ] Deduced a trap composed of 177 places in 766 ms of which 1 ms to minimize.
[2023-03-15 09:30:20] [INFO ] Deduced a trap composed of 177 places in 802 ms of which 1 ms to minimize.
[2023-03-15 09:30:21] [INFO ] Deduced a trap composed of 104 places in 829 ms of which 2 ms to minimize.
[2023-03-15 09:30:21] [INFO ] Deduced a trap composed of 126 places in 795 ms of which 2 ms to minimize.
[2023-03-15 09:30:22] [INFO ] Deduced a trap composed of 87 places in 799 ms of which 1 ms to minimize.
[2023-03-15 09:30:23] [INFO ] Deduced a trap composed of 102 places in 830 ms of which 1 ms to minimize.
[2023-03-15 09:30:24] [INFO ] Deduced a trap composed of 75 places in 832 ms of which 2 ms to minimize.
[2023-03-15 09:30:25] [INFO ] Deduced a trap composed of 10 places in 773 ms of which 2 ms to minimize.
[2023-03-15 09:30:26] [INFO ] Deduced a trap composed of 70 places in 805 ms of which 2 ms to minimize.
[2023-03-15 09:30:27] [INFO ] Deduced a trap composed of 10 places in 715 ms of which 1 ms to minimize.
[2023-03-15 09:30:28] [INFO ] Deduced a trap composed of 28 places in 728 ms of which 2 ms to minimize.
[2023-03-15 09:30:28] [INFO ] Deduced a trap composed of 28 places in 703 ms of which 1 ms to minimize.
[2023-03-15 09:30:29] [INFO ] Deduced a trap composed of 18 places in 813 ms of which 1 ms to minimize.
[2023-03-15 09:30:30] [INFO ] Deduced a trap composed of 149 places in 685 ms of which 2 ms to minimize.
[2023-03-15 09:30:31] [INFO ] Deduced a trap composed of 136 places in 635 ms of which 1 ms to minimize.
[2023-03-15 09:30:31] [INFO ] Deduced a trap composed of 10 places in 616 ms of which 1 ms to minimize.
[2023-03-15 09:30:32] [INFO ] Deduced a trap composed of 10 places in 669 ms of which 1 ms to minimize.
[2023-03-15 09:30:33] [INFO ] Deduced a trap composed of 188 places in 764 ms of which 1 ms to minimize.
[2023-03-15 09:30:34] [INFO ] Deduced a trap composed of 2 places in 809 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-15 09:30:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:30:34] [INFO ] After 25841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 239 ms.
Support contains 347 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1488/1488 transitions.
Applied a total of 0 rules in 74 ms. Remains 788 /788 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 788/788 places, 1488/1488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1488/1488 transitions.
Applied a total of 0 rules in 72 ms. Remains 788 /788 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
[2023-03-15 09:30:34] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
[2023-03-15 09:30:34] [INFO ] Invariant cache hit.
[2023-03-15 09:30:35] [INFO ] Implicit Places using invariants in 637 ms returned [717, 718, 720, 759, 760, 761, 762]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 643 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 781/788 places, 1488/1488 transitions.
Applied a total of 0 rules in 66 ms. Remains 781 /781 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 783 ms. Remains : 781/788 places, 1488/1488 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 238448 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238448 steps, saw 43829 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 09:30:39] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
// Phase 1: matrix 1278 rows 781 cols
[2023-03-15 09:30:39] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-15 09:30:39] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 09:30:41] [INFO ] After 1842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 09:30:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 09:30:43] [INFO ] After 1409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 09:30:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:30:45] [INFO ] After 1633ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 09:30:45] [INFO ] Deduced a trap composed of 35 places in 748 ms of which 1 ms to minimize.
[2023-03-15 09:30:46] [INFO ] Deduced a trap composed of 14 places in 712 ms of which 1 ms to minimize.
[2023-03-15 09:30:47] [INFO ] Deduced a trap composed of 18 places in 633 ms of which 2 ms to minimize.
[2023-03-15 09:30:48] [INFO ] Deduced a trap composed of 12 places in 814 ms of which 2 ms to minimize.
[2023-03-15 09:30:49] [INFO ] Deduced a trap composed of 16 places in 749 ms of which 1 ms to minimize.
[2023-03-15 09:30:49] [INFO ] Deduced a trap composed of 22 places in 832 ms of which 1 ms to minimize.
[2023-03-15 09:30:50] [INFO ] Deduced a trap composed of 16 places in 848 ms of which 1 ms to minimize.
[2023-03-15 09:30:51] [INFO ] Deduced a trap composed of 16 places in 707 ms of which 1 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 14 places in 518 ms of which 1 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 23 places in 707 ms of which 1 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 23 places in 787 ms of which 2 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 12 places in 696 ms of which 0 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 10 places in 670 ms of which 1 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 40 places in 756 ms of which 2 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 40 places in 784 ms of which 2 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 46 places in 756 ms of which 2 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 43 places in 771 ms of which 1 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 33 places in 527 ms of which 1 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 80 places in 716 ms of which 2 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 82 places in 750 ms of which 1 ms to minimize.
[2023-03-15 09:31:01] [INFO ] Deduced a trap composed of 102 places in 748 ms of which 2 ms to minimize.
[2023-03-15 09:31:02] [INFO ] Deduced a trap composed of 102 places in 767 ms of which 1 ms to minimize.
[2023-03-15 09:31:03] [INFO ] Deduced a trap composed of 102 places in 754 ms of which 2 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 82 places in 743 ms of which 2 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 97 places in 750 ms of which 4 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 29 places in 734 ms of which 1 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 33 places in 752 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.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-15 09:31:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:31:06] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 195 ms.
Support contains 347 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1488/1488 transitions.
Applied a total of 0 rules in 65 ms. Remains 781 /781 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 781/781 places, 1488/1488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1488/1488 transitions.
Applied a total of 0 rules in 55 ms. Remains 781 /781 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
[2023-03-15 09:31:07] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
[2023-03-15 09:31:07] [INFO ] Invariant cache hit.
[2023-03-15 09:31:08] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-15 09:31:08] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
[2023-03-15 09:31:08] [INFO ] Invariant cache hit.
[2023-03-15 09:31:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:31:12] [INFO ] Implicit Places using invariants and state equation in 4671 ms returned []
Implicit Place search using SMT with State Equation took 5541 ms to find 0 implicit places.
[2023-03-15 09:31:12] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-15 09:31:12] [INFO ] Flow matrix only has 1278 transitions (discarded 210 similar events)
[2023-03-15 09:31:12] [INFO ] Invariant cache hit.
[2023-03-15 09:31:14] [INFO ] Dead Transitions using invariants and state equation in 1792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7513 ms. Remains : 781/781 places, 1488/1488 transitions.
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(F((p0||X(F(p1))))))'
Support contains 588 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 24 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:31:14] [INFO ] Computed 27 place invariants in 10 ms
[2023-03-15 09:31:15] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-15 09:31:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:15] [INFO ] Invariant cache hit.
[2023-03-15 09:31:16] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
[2023-03-15 09:31:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:16] [INFO ] Invariant cache hit.
[2023-03-15 09:31:18] [INFO ] Dead Transitions using invariants and state equation in 2076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3765 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-00 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}]], initial=0, aps=[p0:(GT 6 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s310 s311 s312 s313 s314 s315 s316 s322 s323 s324 s333 s334 ...], 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 50000 reset in 1842 ms.
Product exploration explored 100000 steps with 50000 reset in 1948 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 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-00 finished in 7974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(X((X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))))))'
Support contains 259 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 37 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:22] [INFO ] Invariant cache hit.
[2023-03-15 09:31:23] [INFO ] Implicit Places using invariants in 754 ms returned []
[2023-03-15 09:31:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:23] [INFO ] Invariant cache hit.
[2023-03-15 09:31:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:31:28] [INFO ] Implicit Places using invariants and state equation in 4590 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 5350 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 37 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 5426 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), true, p1, p1, p1]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s1302 s1303 s1304 s1305 s1306 s1313 s1314)), p1:(LEQ 1 (ADD s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2038 steps with 332 reset in 102 ms.
FORMULA Peterson-PT-6-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-01 finished in 5753 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&&F(p1))))'
Support contains 630 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 98 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:28] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:28] [INFO ] Invariant cache hit.
[2023-03-15 09:31:29] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2023-03-15 09:31:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:29] [INFO ] Invariant cache hit.
[2023-03-15 09:31:30] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2023-03-15 09:31:31] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-15 09:31:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:31] [INFO ] Invariant cache hit.
[2023-03-15 09:31:33] [INFO ] Dead Transitions using invariants and state equation in 2487 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4935 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 6 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 948 ms.
Stack based approach found an accepted trace after 253 steps with 0 reset with depth 254 and stack size 254 in 3 ms.
FORMULA Peterson-PT-6-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-02 finished in 5986 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)&&F((G(p1)||G(F(p2))))))'
Support contains 301 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 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1330 transition count 1700
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 1000 transition count 1700
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 660 place count 1000 transition count 1442
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 93 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
[2023-03-15 09:31:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2023-03-15 09:31:34] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 09:31:35] [INFO ] Implicit Places using invariants in 427 ms returned [681, 682, 684, 713, 714, 715, 716]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 430 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 735/1330 places, 1442/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 568 ms. Remains : 735/1330 places, 1442/2030 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 (ADD s714 s715 s716 s717 s718 s725 s726)), p1:(GT (ADD s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1459 ms.
Stack based approach found an accepted trace after 151 steps with 0 reset with depth 152 and stack size 152 in 1 ms.
FORMULA Peterson-PT-6-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-03 finished in 2276 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 301 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 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 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 600 place count 1030 transition count 1695
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 670 place count 995 transition count 1695
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 742 place count 959 transition count 1659
Applied a total of 742 rules in 129 ms. Remains 959 /1330 variables (removed 371) and now considering 1659/2030 (removed 371) transitions.
[2023-03-15 09:31:36] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 959 cols
[2023-03-15 09:31:37] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-15 09:31:37] [INFO ] Implicit Places using invariants in 797 ms returned [933, 934, 936, 944, 945, 946, 947]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 801 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 952/1330 places, 1659/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 961 ms. Remains : 952/1330 places, 1659/2030 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s275 s276 s277 s278 s279 s283 s284 s285 s286 s287 s288 s289 s290 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 ...], 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 8805 reset in 1237 ms.
Product exploration explored 100000 steps with 8909 reset in 1145 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-15 09:31:40] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
// Phase 1: matrix 1449 rows 952 cols
[2023-03-15 09:31:40] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 09:31:44] [INFO ] [Real]Absence check using 20 positive place invariants in 79 ms returned sat
[2023-03-15 09:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:31:49] [INFO ] [Real]Absence check using state equation in 5263 ms returned sat
[2023-03-15 09:31:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:31:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 44 ms returned sat
[2023-03-15 09:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:31:57] [INFO ] [Nat]Absence check using state equation in 3344 ms returned sat
[2023-03-15 09:31:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:31:57] [INFO ] [Nat]Added 330 Read/Feed constraints in 298 ms returned sat
[2023-03-15 09:31:58] [INFO ] Deduced a trap composed of 105 places in 660 ms of which 1 ms to minimize.
[2023-03-15 09:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 870 ms
[2023-03-15 09:31:58] [INFO ] Computed and/alt/rep : 1358/3381/1358 causal constraints (skipped 84 transitions) in 178 ms.
[2023-03-15 09:32:04] [INFO ] Added : 215 causal constraints over 43 iterations in 6297 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 301 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 1659/1659 transitions.
Applied a total of 0 rules in 30 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-15 09:32:04] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:04] [INFO ] Invariant cache hit.
[2023-03-15 09:32:05] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-15 09:32:05] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:05] [INFO ] Invariant cache hit.
[2023-03-15 09:32:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:11] [INFO ] Implicit Places using invariants and state equation in 5882 ms returned []
Implicit Place search using SMT with State Equation took 6717 ms to find 0 implicit places.
[2023-03-15 09:32:11] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-15 09:32:11] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:11] [INFO ] Invariant cache hit.
[2023-03-15 09:32:13] [INFO ] Dead Transitions using invariants and state equation in 1865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8763 ms. Remains : 952/952 places, 1659/1659 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-15 09:32:13] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:13] [INFO ] Invariant cache hit.
[2023-03-15 09:32:17] [INFO ] [Real]Absence check using 20 positive place invariants in 66 ms returned sat
[2023-03-15 09:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:23] [INFO ] [Real]Absence check using state equation in 5597 ms returned sat
[2023-03-15 09:32:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:32:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 63 ms returned sat
[2023-03-15 09:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:30] [INFO ] [Nat]Absence check using state equation in 3954 ms returned sat
[2023-03-15 09:32:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:31] [INFO ] [Nat]Added 330 Read/Feed constraints in 318 ms returned sat
[2023-03-15 09:32:31] [INFO ] Deduced a trap composed of 25 places in 859 ms of which 2 ms to minimize.
[2023-03-15 09:32:33] [INFO ] Deduced a trap composed of 11 places in 980 ms of which 2 ms to minimize.
[2023-03-15 09:32:33] [INFO ] Deduced a trap composed of 126 places in 699 ms of which 2 ms to minimize.
[2023-03-15 09:32:34] [INFO ] Deduced a trap composed of 210 places in 664 ms of which 1 ms to minimize.
[2023-03-15 09:32:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3878 ms
[2023-03-15 09:32:35] [INFO ] Computed and/alt/rep : 1358/3381/1358 causal constraints (skipped 84 transitions) in 192 ms.
[2023-03-15 09:32:39] [INFO ] Deduced a trap composed of 2 places in 981 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.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-15 09:32:39] [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 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8882 reset in 1264 ms.
Product exploration explored 100000 steps with 8762 reset in 1030 ms.
Support contains 301 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 1659/1659 transitions.
Applied a total of 0 rules in 25 ms. Remains 952 /952 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-15 09:32:41] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:41] [INFO ] Invariant cache hit.
[2023-03-15 09:32:42] [INFO ] Implicit Places using invariants in 687 ms returned []
[2023-03-15 09:32:42] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:42] [INFO ] Invariant cache hit.
[2023-03-15 09:32:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:48] [INFO ] Implicit Places using invariants and state equation in 6135 ms returned []
Implicit Place search using SMT with State Equation took 6824 ms to find 0 implicit places.
[2023-03-15 09:32:48] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-15 09:32:48] [INFO ] Flow matrix only has 1449 transitions (discarded 210 similar events)
[2023-03-15 09:32:48] [INFO ] Invariant cache hit.
[2023-03-15 09:32:49] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8305 ms. Remains : 952/952 places, 1659/1659 transitions.
Treatment of property Peterson-PT-6-LTLCardinality-04 finished in 73363 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||(G(p1) U p2))))'
Support contains 924 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 15 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:32:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:32:50] [INFO ] Computed 27 place invariants in 13 ms
[2023-03-15 09:32:50] [INFO ] Implicit Places using invariants in 746 ms returned [1205, 1206, 1301, 1302, 1303]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 749 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 12 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 780 ms. Remains : 1325/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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]]
Product exploration explored 100000 steps with 50000 reset in 2929 ms.
Product exploration explored 100000 steps with 50000 reset in 2651 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 p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-05 finished in 6752 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)))))'
Support contains 42 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 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 55 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2023-03-15 09:32:57] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2023-03-15 09:32:57] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 09:32:57] [INFO ] Implicit Places using invariants in 683 ms returned [429, 430, 432, 461, 462, 463, 464]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 685 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 759 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 7 (ADD s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s268 s269 s270 s271 s272 s273 s274 s280 s281 s282 s291 s292...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 537 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 1 ms.
FORMULA Peterson-PT-6-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-06 finished in 1399 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||F(p1)||X(X(G(p2))))))'
Support contains 595 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 29 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:32:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:32:58] [INFO ] Computed 27 place invariants in 19 ms
[2023-03-15 09:32:59] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-15 09:32:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:32:59] [INFO ] Invariant cache hit.
[2023-03-15 09:33:00] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2023-03-15 09:33:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:00] [INFO ] Invariant cache hit.
[2023-03-15 09:33:02] [INFO ] Dead Transitions using invariants and state equation in 2093 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3789 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LEQ 7 (ADD s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 ...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1973 ms.
Product exploration explored 100000 steps with 50000 reset in 1911 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 p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-07 finished in 7951 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)))'
Support contains 2 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 38 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:06] [INFO ] Invariant cache hit.
[2023-03-15 09:33:07] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-15 09:33:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:07] [INFO ] Invariant cache hit.
[2023-03-15 09:33:08] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2023-03-15 09:33:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:08] [INFO ] Invariant cache hit.
[2023-03-15 09:33:10] [INFO ] Dead Transitions using invariants and state equation in 2365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4395 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s606 0) (EQ s911 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 262 ms.
Product exploration explored 100000 steps with 0 reset in 495 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312144 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312144 steps, saw 193606 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:14] [INFO ] Invariant cache hit.
[2023-03-15 09:33:15] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-15 09:33:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:33:16] [INFO ] After 1499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-15 09:33:16] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:33:17] [INFO ] After 1081ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:18] [INFO ] After 176ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:18] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-15 09:33:18] [INFO ] After 2153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1172 place count 744 transition count 1152
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1756 place count 452 transition count 1152
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 3 with 84 rules applied. Total rules applied 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 112 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 410/1330 places, 1110/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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 663856 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 663856 steps, saw 90218 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:21] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2023-03-15 09:33:21] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-15 09:33:21] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 09:33:21] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 09:33:22] [INFO ] After 451ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:22] [INFO ] After 118ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:22] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 09:33:22] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 09:33:23] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:23] [INFO ] After 116ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:23] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-15 09:33:23] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 410/410 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:33:23] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:23] [INFO ] Invariant cache hit.
[2023-03-15 09:33:24] [INFO ] Implicit Places using invariants in 861 ms returned [391, 392, 394, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 864 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 26 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 916 ms. Remains : 403/410 places, 1110/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 702704 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 702704 steps, saw 95015 distinct states, run finished after 3003 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:27] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2023-03-15 09:33:27] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 09:33:27] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 09:33:27] [INFO ] After 425ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:28] [INFO ] After 109ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:28] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 09:33:28] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:28] [INFO ] After 106ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:28] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 09:33:28] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:33:29] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:29] [INFO ] Invariant cache hit.
[2023-03-15 09:33:29] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-15 09:33:29] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:29] [INFO ] Invariant cache hit.
[2023-03-15 09:33:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:32] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 3510 ms to find 0 implicit places.
[2023-03-15 09:33:32] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 09:33:32] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:32] [INFO ] Invariant cache hit.
[2023-03-15 09:33:33] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4624 ms. Remains : 403/403 places, 1110/1110 transitions.
Graph (trivial) has 840 edges and 403 vertex of which 285 / 403 are part of one of the 41 SCC in 3 ms
Free SCC test removed 244 places
Drop transitions removed 488 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 738 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 159 transition count 332
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 119 transition count 332
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 97 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 181 place count 12 transition count 152
Drop transitions removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 309 place count 12 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 6 transition count 14
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 324 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 324 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 328 place count 4 transition count 4
Applied a total of 328 rules in 31 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-15 09:33:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:33:33] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:33] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 09:33:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 78 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:34] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:33:34] [INFO ] Computed 27 place invariants in 10 ms
[2023-03-15 09:33:35] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2023-03-15 09:33:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:35] [INFO ] Invariant cache hit.
[2023-03-15 09:33:36] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2023-03-15 09:33:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:36] [INFO ] Invariant cache hit.
[2023-03-15 09:33:38] [INFO ] Dead Transitions using invariants and state equation in 2150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4551 ms. Remains : 1330/1330 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 314752 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314752 steps, saw 195021 distinct states, run finished after 3005 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:41] [INFO ] Invariant cache hit.
[2023-03-15 09:33:42] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-15 09:33:42] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:33:43] [INFO ] After 1691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 09:33:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 09:33:45] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:45] [INFO ] After 146ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:45] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-15 09:33:45] [INFO ] After 2016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1172 place count 744 transition count 1152
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1756 place count 452 transition count 1152
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 3 with 84 rules applied. Total rules applied 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 120 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 410/1330 places, 1110/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 729768 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 729768 steps, saw 97691 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:48] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2023-03-15 09:33:48] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-15 09:33:48] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 09:33:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 09:33:49] [INFO ] After 394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:49] [INFO ] After 113ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:49] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 09:33:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 09:33:50] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:50] [INFO ] After 100ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:50] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 09:33:50] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 410/410 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:33:50] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:50] [INFO ] Invariant cache hit.
[2023-03-15 09:33:51] [INFO ] Implicit Places using invariants in 761 ms returned [391, 392, 394, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 764 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/410 places, 1110/1110 transitions.
Applied a total of 0 rules in 23 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 815 ms. Remains : 403/410 places, 1110/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697336 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697336 steps, saw 94345 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:54] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2023-03-15 09:33:54] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 09:33:54] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 09:33:54] [INFO ] After 283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:54] [INFO ] After 68ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:54] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 09:33:55] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:55] [INFO ] After 67ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:55] [INFO ] After 121ms 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-15 09:33:55] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:33:55] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:55] [INFO ] Invariant cache hit.
[2023-03-15 09:33:55] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-15 09:33:55] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:55] [INFO ] Invariant cache hit.
[2023-03-15 09:33:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:58] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2023-03-15 09:33:58] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 09:33:58] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:33:58] [INFO ] Invariant cache hit.
[2023-03-15 09:33:59] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3940 ms. Remains : 403/403 places, 1110/1110 transitions.
Graph (trivial) has 840 edges and 403 vertex of which 285 / 403 are part of one of the 41 SCC in 0 ms
Free SCC test removed 244 places
Drop transitions removed 488 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 738 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 159 transition count 332
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 119 transition count 332
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 97 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 181 place count 12 transition count 152
Drop transitions removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 309 place count 12 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 6 transition count 14
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 324 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 324 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 328 place count 4 transition count 4
Applied a total of 328 rules in 18 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-15 09:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:33:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:33:59] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:33:59] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 09:33:59] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 356 ms.
Product exploration explored 100000 steps with 0 reset in 470 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT 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.
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1330 transition count 2030
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 258 Pre rules applied. Total rules applied 335 place count 1330 transition count 2209
Deduced a syphon composed of 593 places in 2 ms
Iterating global reduction 1 with 258 rules applied. Total rules applied 593 place count 1330 transition count 2209
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 743 place count 1180 transition count 2059
Deduced a syphon composed of 443 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 893 place count 1180 transition count 2059
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 770 places in 1 ms
Iterating global reduction 1 with 327 rules applied. Total rules applied 1220 place count 1180 transition count 2059
Discarding 291 places :
Symmetric choice reduction at 1 with 291 rule applications. Total rules 1511 place count 889 transition count 1768
Deduced a syphon composed of 479 places in 1 ms
Iterating global reduction 1 with 291 rules applied. Total rules applied 1802 place count 889 transition count 1768
Deduced a syphon composed of 479 places in 0 ms
Applied a total of 1802 rules in 709 ms. Remains 889 /1330 variables (removed 441) and now considering 1768/2030 (removed 262) transitions.
[2023-03-15 09:34:01] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-15 09:34:01] [INFO ] Flow matrix only has 1558 transitions (discarded 210 similar events)
// Phase 1: matrix 1558 rows 889 cols
[2023-03-15 09:34:01] [INFO ] Computed 27 place invariants in 13 ms
[2023-03-15 09:34:02] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 889/1330 places, 1768/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2071 ms. Remains : 889/1330 places, 1768/2030 transitions.
Support contains 2 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 64 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:34:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:34:03] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-15 09:34:03] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-15 09:34:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:03] [INFO ] Invariant cache hit.
[2023-03-15 09:34:04] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-03-15 09:34:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:04] [INFO ] Invariant cache hit.
[2023-03-15 09:34:07] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4194 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Treatment of property Peterson-PT-6-LTLCardinality-09 finished in 60960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 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-15 09:34:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:07] [INFO ] Invariant cache hit.
[2023-03-15 09:34:08] [INFO ] Implicit Places using invariants in 797 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 802 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 67 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 916 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s888 0) (NEQ s1175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 335 ms.
Stack based approach found an accepted trace after 682 steps with 0 reset with depth 683 and stack size 683 in 3 ms.
FORMULA Peterson-PT-6-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-11 finished in 1414 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((G(p0) U (X(p1) U p2))))'
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 68 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:34:08] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:08] [INFO ] Invariant cache hit.
[2023-03-15 09:34:09] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2023-03-15 09:34:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:09] [INFO ] Invariant cache hit.
[2023-03-15 09:34:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:18] [INFO ] Implicit Places using invariants and state equation in 8110 ms returned [1205, 1206, 1301, 1302, 1303]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 9319 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 40 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 9427 ms. Remains : 1325/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s684 1) (OR (EQ s1306 0) (EQ s1206 1))), p0:(OR (EQ s1315 0) (EQ s1299 1)), p1:(OR (EQ s375 0) (EQ s1304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 497 steps with 1 reset in 1 ms.
FORMULA Peterson-PT-6-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-13 finished in 9621 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)&&F(G(p1)))))'
Support contains 4 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 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 1 with 585 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 292 Pre rules applied. Total rules applied 1170 place count 745 transition count 1153
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 2 with 584 rules applied. Total rules applied 1754 place count 453 transition count 1153
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 1836 place count 412 transition count 1112
Applied a total of 1836 rules in 60 ms. Remains 412 /1330 variables (removed 918) and now considering 1112/2030 (removed 918) transitions.
[2023-03-15 09:34:18] [INFO ] Flow matrix only has 902 transitions (discarded 210 similar events)
// Phase 1: matrix 902 rows 412 cols
[2023-03-15 09:34:18] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-15 09:34:19] [INFO ] Implicit Places using invariants in 762 ms returned [391, 392, 394, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 764 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/1330 places, 1112/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 405 /405 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 850 ms. Remains : 405/1330 places, 1112/2030 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s256 0) (EQ s403 1)), p1:(AND (EQ s353 0) (EQ s309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Peterson-PT-6-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-15 finished in 1379 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)))'
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)))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLCardinality-09
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1172 place count 744 transition count 1152
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1756 place count 452 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
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 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 103 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
[2023-03-15 09:34:20] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2023-03-15 09:34:20] [INFO ] Computed 27 place invariants in 17 ms
[2023-03-15 09:34:21] [INFO ] Implicit Places using invariants in 819 ms returned [391, 392, 394, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 822 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 403/1330 places, 1110/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 940 ms. Remains : 403/1330 places, 1110/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s301 0) (EQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 288 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 731904 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 731904 steps, saw 97927 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:34:24] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2023-03-15 09:34:24] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 09:34:24] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 09:34:25] [INFO ] After 314ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:25] [INFO ] After 81ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:25] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 09:34:25] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:26] [INFO ] After 108ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:26] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 09:34:26] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 26 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 403/403 places, 1110/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650336 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650336 steps, saw 88976 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:34:29] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:29] [INFO ] Invariant cache hit.
[2023-03-15 09:34:29] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 09:34:29] [INFO ] After 350ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:29] [INFO ] After 112ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:29] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 09:34:30] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:30] [INFO ] After 136ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:31] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 1 ms to minimize.
[2023-03-15 09:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-15 09:34:31] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-15 09:34:31] [INFO ] After 1337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 25 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:34:31] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:31] [INFO ] Invariant cache hit.
[2023-03-15 09:34:32] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-15 09:34:32] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:32] [INFO ] Invariant cache hit.
[2023-03-15 09:34:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:34] [INFO ] Implicit Places using invariants and state equation in 2392 ms returned []
Implicit Place search using SMT with State Equation took 3195 ms to find 0 implicit places.
[2023-03-15 09:34:34] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 09:34:34] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:34] [INFO ] Invariant cache hit.
[2023-03-15 09:34:35] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4191 ms. Remains : 403/403 places, 1110/1110 transitions.
Graph (trivial) has 840 edges and 403 vertex of which 285 / 403 are part of one of the 41 SCC in 1 ms
Free SCC test removed 244 places
Drop transitions removed 488 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 738 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 159 transition count 332
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 119 transition count 332
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 97 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 181 place count 12 transition count 152
Drop transitions removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 309 place count 12 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 6 transition count 14
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 324 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 324 place count 6 transition count 4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 328 place count 4 transition count 4
Applied a total of 328 rules in 18 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-15 09:34:35] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:34:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:34:35] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:35] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 09:34:35] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:34:35] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2023-03-15 09:34:35] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 09:34:36] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-15 09:34:36] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:36] [INFO ] Invariant cache hit.
[2023-03-15 09:34:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:39] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
[2023-03-15 09:34:39] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:39] [INFO ] Invariant cache hit.
[2023-03-15 09:34:40] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4291 ms. Remains : 403/403 places, 1110/1110 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 685552 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685552 steps, saw 92801 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:34:43] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:43] [INFO ] Invariant cache hit.
[2023-03-15 09:34:43] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 09:34:43] [INFO ] After 281ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:44] [INFO ] After 79ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:44] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 09:34:44] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:44] [INFO ] After 104ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:44] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-15 09:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-15 09:34:45] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 09:34:45] [INFO ] After 1003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 23 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 403/403 places, 1110/1110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 695296 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695296 steps, saw 94137 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:34:48] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:48] [INFO ] Invariant cache hit.
[2023-03-15 09:34:48] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 09:34:48] [INFO ] After 297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:48] [INFO ] After 112ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:48] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 09:34:49] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:49] [INFO ] After 141ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:49] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2023-03-15 09:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2023-03-15 09:34:49] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 09:34:50] [INFO ] After 1363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 23 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:34:50] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:50] [INFO ] Invariant cache hit.
[2023-03-15 09:34:50] [INFO ] Implicit Places using invariants in 795 ms returned []
[2023-03-15 09:34:50] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:50] [INFO ] Invariant cache hit.
[2023-03-15 09:34:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:54] [INFO ] Implicit Places using invariants and state equation in 3212 ms returned []
Implicit Place search using SMT with State Equation took 4009 ms to find 0 implicit places.
[2023-03-15 09:34:54] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 09:34:54] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:54] [INFO ] Invariant cache hit.
[2023-03-15 09:34:55] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5114 ms. Remains : 403/403 places, 1110/1110 transitions.
Graph (trivial) has 840 edges and 403 vertex of which 285 / 403 are part of one of the 41 SCC in 1 ms
Free SCC test removed 244 places
Drop transitions removed 488 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 738 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 159 transition count 332
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 119 transition count 332
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 97 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 181 place count 12 transition count 152
Drop transitions removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 309 place count 12 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 315 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 6 transition count 14
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 324 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 324 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 328 place count 4 transition count 4
Applied a total of 328 rules in 11 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-15 09:34:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 09:34:55] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:34:55] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 09:34:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 359 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 23 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:34:56] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 09:34:56] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2023-03-15 09:34:56] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 09:34:57] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1217 ms. Remains : 403/403 places, 1110/1110 transitions.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2023-03-15 09:34:57] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:57] [INFO ] Invariant cache hit.
[2023-03-15 09:34:58] [INFO ] Implicit Places using invariants in 776 ms returned []
[2023-03-15 09:34:58] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:34:58] [INFO ] Invariant cache hit.
[2023-03-15 09:34:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:35:02] [INFO ] Implicit Places using invariants and state equation in 3588 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2023-03-15 09:35:02] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2023-03-15 09:35:02] [INFO ] Invariant cache hit.
[2023-03-15 09:35:03] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5431 ms. Remains : 403/403 places, 1110/1110 transitions.
Treatment of property Peterson-PT-6-LTLCardinality-09 finished in 43586 ms.
[2023-03-15 09:35:03] [INFO ] Flatten gal took : 88 ms
[2023-03-15 09:35:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-15 09:35:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 27 ms.
Total runtime 339917 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-6
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA Peterson-PT-6-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678873040315
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-PT-6-LTLCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Peterson-PT-6-LTLCardinality-04
lola: result : false
lola: markings : 239
lola: fired transitions : 239
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-PT-6-LTLCardinality-09
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3599 3/32 Peterson-PT-6-LTLCardinality-09 211476 m, 42295 m/sec, 454251 t fired, .
Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3599 6/32 Peterson-PT-6-LTLCardinality-09 426992 m, 43103 m/sec, 989735 t fired, .
Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3599 9/32 Peterson-PT-6-LTLCardinality-09 624211 m, 39443 m/sec, 1528957 t fired, .
Time elapsed: 16 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3599 11/32 Peterson-PT-6-LTLCardinality-09 803986 m, 35955 m/sec, 2067839 t fired, .
Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3599 12/32 Peterson-PT-6-LTLCardinality-09 934206 m, 26044 m/sec, 2624880 t fired, .
Time elapsed: 26 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3599 13/32 Peterson-PT-6-LTLCardinality-09 1014757 m, 16110 m/sec, 3194446 t fired, .
Time elapsed: 31 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3599 14/32 Peterson-PT-6-LTLCardinality-09 1098628 m, 16774 m/sec, 3779070 t fired, .
Time elapsed: 36 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3599 15/32 Peterson-PT-6-LTLCardinality-09 1181205 m, 16515 m/sec, 4362961 t fired, .
Time elapsed: 41 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3599 16/32 Peterson-PT-6-LTLCardinality-09 1265122 m, 16783 m/sec, 4950173 t fired, .
Time elapsed: 46 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3599 17/32 Peterson-PT-6-LTLCardinality-09 1350421 m, 17059 m/sec, 5536369 t fired, .
Time elapsed: 51 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3599 18/32 Peterson-PT-6-LTLCardinality-09 1431687 m, 16253 m/sec, 6122376 t fired, .
Time elapsed: 56 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3599 19/32 Peterson-PT-6-LTLCardinality-09 1515203 m, 16703 m/sec, 6695786 t fired, .
Time elapsed: 61 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3599 20/32 Peterson-PT-6-LTLCardinality-09 1596347 m, 16228 m/sec, 7277877 t fired, .
Time elapsed: 66 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3599 21/32 Peterson-PT-6-LTLCardinality-09 1679808 m, 16692 m/sec, 7861705 t fired, .
Time elapsed: 71 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3599 22/32 Peterson-PT-6-LTLCardinality-09 1762142 m, 16466 m/sec, 8439234 t fired, .
Time elapsed: 76 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3599 23/32 Peterson-PT-6-LTLCardinality-09 1845268 m, 16625 m/sec, 9021419 t fired, .
Time elapsed: 81 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3599 24/32 Peterson-PT-6-LTLCardinality-09 1930053 m, 16957 m/sec, 9611187 t fired, .
Time elapsed: 86 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/3599 25/32 Peterson-PT-6-LTLCardinality-09 2008598 m, 15709 m/sec, 10161377 t fired, .
Time elapsed: 91 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/3599 26/32 Peterson-PT-6-LTLCardinality-09 2091846 m, 16649 m/sec, 10745445 t fired, .
Time elapsed: 96 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/3599 27/32 Peterson-PT-6-LTLCardinality-09 2175475 m, 16725 m/sec, 11325751 t fired, .
Time elapsed: 101 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/3599 27/32 Peterson-PT-6-LTLCardinality-09 2257504 m, 16405 m/sec, 11906552 t fired, .
Time elapsed: 106 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/3599 28/32 Peterson-PT-6-LTLCardinality-09 2341185 m, 16736 m/sec, 12476859 t fired, .
Time elapsed: 111 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/3599 29/32 Peterson-PT-6-LTLCardinality-09 2422467 m, 16256 m/sec, 13058129 t fired, .
Time elapsed: 116 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/3599 30/32 Peterson-PT-6-LTLCardinality-09 2506134 m, 16733 m/sec, 13643578 t fired, .
Time elapsed: 121 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/3599 31/32 Peterson-PT-6-LTLCardinality-09 2588220 m, 16417 m/sec, 14219454 t fired, .
Time elapsed: 126 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/3599 32/32 Peterson-PT-6-LTLCardinality-09 2669906 m, 16337 m/sec, 14789571 t fired, .
Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Peterson-PT-6-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLCardinality-04: LTL false LTL model checker
Peterson-PT-6-LTLCardinality-09: LTL unknown AGGR
Time elapsed: 136 secs. Pages in use: 32
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="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Peterson-PT-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538500635"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;