About the Execution of LTSMin+red for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 496.939 | 85817.00 | 118754.00 | 573.50 | TF??FFFFFF?FTFFF | 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.r105-tall-167814481200459.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 ltsminxred
Input is DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200459
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678303830959
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 19:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:30:32] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 19:30:32] [INFO ] Transformed 274 places.
[2023-03-08 19:30:32] [INFO ] Transformed 231 transitions.
[2023-03-08 19:30:32] [INFO ] Found NUPN structural information;
[2023-03-08 19:30:32] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-40a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 32 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 19:30:32] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-08 19:30:33] [INFO ] Implicit Places using invariants in 536 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 561 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 15 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 609 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 42 out of 273 places after structural reductions.
[2023-03-08 19:30:33] [INFO ] Flatten gal took : 48 ms
[2023-03-08 19:30:33] [INFO ] Flatten gal took : 24 ms
[2023-03-08 19:30:33] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 36 out of 273 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 19:30:34] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 19:30:34] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 19:30:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 19:30:34] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 19:30:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 19:30:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 212 ms returned sat
[2023-03-08 19:30:46] [INFO ] After 10735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 19:30:46] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
[2023-03-08 19:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 19:30:46] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-08 19:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 19:30:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-08 19:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 19:30:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-08 19:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 19:30:47] [INFO ] After 12361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4055 ms.
[2023-03-08 19:30:51] [INFO ] After 16932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 4 properties in 616 ms.
Support contains 13 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 272 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 272 transition count 215
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 272 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 214
Applied a total of 9 rules in 54 ms. Remains 271 /273 variables (removed 2) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 271/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 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 33 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 32 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 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 827087 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 827087 steps, saw 112638 distinct states, run finished after 3002 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 271 cols
[2023-03-08 19:30:56] [INFO ] Computed 59 place invariants in 13 ms
[2023-03-08 19:30:56] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 19:30:56] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 19:30:56] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 19:30:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:30:56] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-08 19:30:57] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 19:30:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:30:57] [INFO ] After 252ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 19:30:57] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-08 19:30:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-08 19:30:57] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-08 19:30:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2023-03-08 19:30:57] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-08 19:30:57] [INFO ] After 1694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 264 ms.
Support contains 7 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 19:30:58] [INFO ] Invariant cache hit.
[2023-03-08 19:30:58] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 19:30:58] [INFO ] Invariant cache hit.
[2023-03-08 19:30:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:30:58] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-08 19:30:58] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 19:30:58] [INFO ] Invariant cache hit.
[2023-03-08 19:30:58] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 271/271 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 19:30:58] [INFO ] Invariant cache hit.
[2023-03-08 19:30:58] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:30:58] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 19:30:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:30:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:30:58] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 46 ms returned sat
[2023-03-08 19:30:59] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:30:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-08 19:30:59] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-08 19:30:59] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-08 19:30:59] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-08 19:30:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2023-03-08 19:30:59] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 19:30:59] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 176 stabilizing places and 171 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 16 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:00] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 19:31:00] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 19:31:00] [INFO ] Invariant cache hit.
[2023-03-08 19:31:00] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-08 19:31:00] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 19:31:00] [INFO ] Invariant cache hit.
[2023-03-08 19:31:00] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s148 0) (NEQ s18 1)) (EQ s30 0) (EQ s121 1)), p1:(AND (NEQ s235 0) (NEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2295 reset in 297 ms.
Product exploration explored 100000 steps with 2291 reset in 267 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:31:01] [INFO ] Invariant cache hit.
[2023-03-08 19:31:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:01] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-08 19:31:02] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:02] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 19:31:02] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1785896 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :{}
Probabilistic random walk after 1785896 steps, saw 248149 distinct states, run finished after 3001 ms. (steps per millisecond=595 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:05] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 19:31:05] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 19:31:05] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:05] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2023-03-08 19:31:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 19:31:05] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 19:31:05] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:31:05] [INFO ] Invariant cache hit.
[2023-03-08 19:31:05] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-08 19:31:05] [INFO ] Invariant cache hit.
[2023-03-08 19:31:06] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-08 19:31:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 19:31:06] [INFO ] Invariant cache hit.
[2023-03-08 19:31:06] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 667 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:06] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 19:31:06] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:31:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 19:31:06] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:06] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 19:31:06] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:07] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:31:07] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 19:31:07] [INFO ] Invariant cache hit.
[2023-03-08 19:31:07] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-08 19:31:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:31:07] [INFO ] Invariant cache hit.
[2023-03-08 19:31:07] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:31:08] [INFO ] Invariant cache hit.
[2023-03-08 19:31:08] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:08] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-08 19:31:08] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:08] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 19:31:08] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1718651 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :{}
Probabilistic random walk after 1718651 steps, saw 238989 distinct states, run finished after 3001 ms. (steps per millisecond=572 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:11] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 19:31:11] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 19:31:11] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:11] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-08 19:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 19:31:11] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 19:31:11] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:31:12] [INFO ] Invariant cache hit.
[2023-03-08 19:31:12] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 19:31:12] [INFO ] Invariant cache hit.
[2023-03-08 19:31:12] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-08 19:31:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:31:12] [INFO ] Invariant cache hit.
[2023-03-08 19:31:12] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:12] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 19:31:12] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 19:31:12] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:12] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 19:31:13] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2234 reset in 203 ms.
Product exploration explored 100000 steps with 2283 reset in 278 ms.
Support contains 6 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:13] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:31:14] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 19:31:14] [INFO ] Invariant cache hit.
[2023-03-08 19:31:14] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-08 19:31:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:31:14] [INFO ] Invariant cache hit.
[2023-03-08 19:31:14] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-02 finished in 14631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 25 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
[2023-03-08 19:31:14] [INFO ] Invariant cache hit.
[2023-03-08 19:31:14] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-08 19:31:14] [INFO ] Invariant cache hit.
[2023-03-08 19:31:15] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-08 19:31:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:31:15] [INFO ] Invariant cache hit.
[2023-03-08 19:31:15] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s86 1)), p1:(AND (NEQ s80 0) (NEQ s138 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2300 reset in 219 ms.
Product exploration explored 100000 steps with 2279 reset in 279 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 499 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 846893 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 846893 steps, saw 125760 distinct states, run finished after 3002 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 19:31:19] [INFO ] Invariant cache hit.
[2023-03-08 19:31:19] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 19:31:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2023-03-08 19:31:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 19:31:20] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 19:31:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-08 19:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 19:31:20] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-08 19:31:20] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 271 transition count 213
Applied a total of 3 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1137538 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 1137538 steps, saw 159590 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:23] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 19:31:23] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:31:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:31:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2023-03-08 19:31:23] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:31:23] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-08 19:31:23] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:31:24] [INFO ] Invariant cache hit.
[2023-03-08 19:31:24] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 19:31:24] [INFO ] Invariant cache hit.
[2023-03-08 19:31:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-08 19:31:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:31:24] [INFO ] Invariant cache hit.
[2023-03-08 19:31:24] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 19:31:24] [INFO ] Invariant cache hit.
[2023-03-08 19:31:24] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:31:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-08 19:31:25] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:31:25] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-08 19:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 19:31:25] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-08 19:31:25] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 408 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 271 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:25] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:31:25] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 19:31:25] [INFO ] Invariant cache hit.
[2023-03-08 19:31:26] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-08 19:31:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:26] [INFO ] Invariant cache hit.
[2023-03-08 19:31:26] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1744925 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1744925 steps, saw 237144 distinct states, run finished after 3001 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:31:29] [INFO ] Invariant cache hit.
[2023-03-08 19:31:29] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 66 ms returned sat
[2023-03-08 19:31:29] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:29] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 19:31:29] [INFO ] After 253ms 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 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1688630 steps, run timeout after 3001 ms. (steps per millisecond=562 ) properties seen :{}
Probabilistic random walk after 1688630 steps, saw 235561 distinct states, run finished after 3001 ms. (steps per millisecond=562 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:32] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 19:31:32] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 107 ms returned sat
[2023-03-08 19:31:33] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:33] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 19:31:33] [INFO ] After 391ms 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 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:31:33] [INFO ] Invariant cache hit.
[2023-03-08 19:31:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 19:31:33] [INFO ] Invariant cache hit.
[2023-03-08 19:31:33] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 19:31:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:33] [INFO ] Invariant cache hit.
[2023-03-08 19:31:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:31:33] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 19:31:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:31:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 19:31:34] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:34] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 19:31:34] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2266 reset in 229 ms.
Product exploration explored 100000 steps with 2287 reset in 228 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:35] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 19:31:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 19:31:35] [INFO ] Invariant cache hit.
[2023-03-08 19:31:35] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 19:31:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:35] [INFO ] Invariant cache hit.
[2023-03-08 19:31:35] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-03 finished in 21065 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' '!(((p0 U !p1) U X(!p2)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 10 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:31:35] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:31:35] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 19:31:35] [INFO ] Invariant cache hit.
[2023-03-08 19:31:36] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-08 19:31:36] [INFO ] Invariant cache hit.
[2023-03-08 19:31:36] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 210 ms :[p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : DES-PT-40a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s165 0) (EQ s39 1)), p0:(OR (EQ s54 0) (EQ s89 1)), p2:(OR (EQ s145 0) (EQ s119 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5332 steps with 862 reset in 27 ms.
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-04 finished in 808 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 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 5 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:31:36] [INFO ] Invariant cache hit.
[2023-03-08 19:31:36] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 19:31:36] [INFO ] Invariant cache hit.
[2023-03-08 19:31:36] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-08 19:31:36] [INFO ] Invariant cache hit.
[2023-03-08 19:31:37] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-05 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 s192 0) (EQ s153 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-05 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p1)&&p0)))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:31:37] [INFO ] Invariant cache hit.
[2023-03-08 19:31:37] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 19:31:37] [INFO ] Invariant cache hit.
[2023-03-08 19:31:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-08 19:31:37] [INFO ] Invariant cache hit.
[2023-03-08 19:31:37] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s15 1)), p1:(AND (EQ s49 0) (EQ s15 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 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-06 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 11 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:31:37] [INFO ] Invariant cache hit.
[2023-03-08 19:31:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 19:31:37] [INFO ] Invariant cache hit.
[2023-03-08 19:31:38] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 19:31:38] [INFO ] Invariant cache hit.
[2023-03-08 19:31:38] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s231 0) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-07 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p0||X((G(p2)||p1))))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 19:31:38] [INFO ] Invariant cache hit.
[2023-03-08 19:31:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 19:31:38] [INFO ] Invariant cache hit.
[2023-03-08 19:31:38] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-08 19:31:38] [INFO ] Invariant cache hit.
[2023-03-08 19:31:38] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s119 1), p1:(OR (EQ s139 0) (EQ s185 1)), p2:(AND (OR (EQ s197 0) (EQ s251 1)) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23913 reset in 309 ms.
Product exploration explored 100000 steps with 23763 reset in 301 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-08 19:31:40] [INFO ] Invariant cache hit.
[2023-03-08 19:31:40] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 19:31:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 19:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:31:40] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-08 19:31:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:31:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:31:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 19:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:31:41] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-08 19:31:41] [INFO ] Computed and/alt/rep : 208/624/208 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 19:31:42] [INFO ] Added : 147 causal constraints over 30 iterations in 891 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:42] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:31:42] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 19:31:42] [INFO ] Invariant cache hit.
[2023-03-08 19:31:42] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 19:31:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:31:43] [INFO ] Invariant cache hit.
[2023-03-08 19:31:43] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 544 ms. Remains : 271/272 places, 215/216 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-08 19:31:43] [INFO ] Invariant cache hit.
[2023-03-08 19:31:43] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 19:31:43] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 19:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:31:44] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2023-03-08 19:31:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:31:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:31:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 19:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:31:45] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2023-03-08 19:31:45] [INFO ] Computed and/alt/rep : 208/325/208 causal constraints (skipped 4 transitions) in 12 ms.
[2023-03-08 19:31:46] [INFO ] Added : 161 causal constraints over 33 iterations in 798 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22857 reset in 209 ms.
Product exploration explored 100000 steps with 22861 reset in 226 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-08 19:31:46] [INFO ] Invariant cache hit.
[2023-03-08 19:31:46] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 19:31:46] [INFO ] Invariant cache hit.
[2023-03-08 19:31:46] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-08 19:31:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:46] [INFO ] Invariant cache hit.
[2023-03-08 19:31:47] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 556 ms. Remains : 271/271 places, 215/215 transitions.
Treatment of property DES-PT-40a-LTLCardinality-10 finished in 8718 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)||G(p1)))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 11 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 19:31:47] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:31:47] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 19:31:47] [INFO ] Invariant cache hit.
[2023-03-08 19:31:47] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 19:31:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:47] [INFO ] Invariant cache hit.
[2023-03-08 19:31:47] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s267 0) (NEQ s221 1)), p1:(OR (EQ s271 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-12 finished in 1675 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))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 15 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:31:48] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 19:31:48] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 19:31:48] [INFO ] Invariant cache hit.
[2023-03-08 19:31:49] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-08 19:31:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:31:49] [INFO ] Invariant cache hit.
[2023-03-08 19:31:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2273 reset in 190 ms.
Product exploration explored 100000 steps with 2286 reset in 215 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 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 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1746494 steps, run timeout after 3003 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1746494 steps, saw 237320 distinct states, run finished after 3003 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:31:53] [INFO ] Invariant cache hit.
[2023-03-08 19:31:53] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:31:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 19:31:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-08 19:31:53] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:31:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-08 19:31:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 19:31:53] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 19:31:53] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1706 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=243 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-13 finished in 4823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 19:31:53] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:31:53] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 19:31:53] [INFO ] Invariant cache hit.
[2023-03-08 19:31:54] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-08 19:31:54] [INFO ] Invariant cache hit.
[2023-03-08 19:31:54] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1317 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) 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:(AND (NEQ s80 0) (NEQ s261 1)), p0:(AND (EQ s265 0) (EQ s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-15 finished in 1475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p0||X((G(p2)||p1))))))'
[2023-03-08 19:31:55] [INFO ] Flatten gal took : 18 ms
[2023-03-08 19:31:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 19:31:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 217 transitions and 1049 arcs took 3 ms.
Total runtime 83040 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1488/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1488/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1488/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-40a-LTLCardinality-02
Could not compute solution for formula : DES-PT-40a-LTLCardinality-03
Could not compute solution for formula : DES-PT-40a-LTLCardinality-10
BK_STOP 1678303916776
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
ltl formula name DES-PT-40a-LTLCardinality-02
ltl formula formula --ltl=/tmp/1488/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1488/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1488/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1488/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1488/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DES-PT-40a-LTLCardinality-03
ltl formula formula --ltl=/tmp/1488/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1488/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1488/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1488/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1488/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-40a-LTLCardinality-10
ltl formula formula --ltl=/tmp/1488/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 217 transitions and 1049 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1488/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1488/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1488/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1488/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-40a, 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 r105-tall-167814481200459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;