About the Execution of ITS-Tools for Anderson-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10568.800 | 3600000.00 | 13668304.00 | 5328.60 | FTFTFFFTFTTFFF?F | 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.r517-tall-167987243300043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Anderson-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 927K Mar 31 16:48 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 Anderson-PT-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680844218178
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 05:10:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 05:10:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:10:19] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-04-07 05:10:19] [INFO ] Transformed 505 places.
[2023-04-07 05:10:19] [INFO ] Transformed 1845 transitions.
[2023-04-07 05:10:19] [INFO ] Found NUPN structural information;
[2023-04-07 05:10:19] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 381 transition count 681
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 381 transition count 681
Applied a total of 248 rules in 72 ms. Remains 381 /505 variables (removed 124) and now considering 681/1845 (removed 1164) transitions.
// Phase 1: matrix 681 rows 381 cols
[2023-04-07 05:10:20] [INFO ] Computed 21 invariants in 40 ms
[2023-04-07 05:10:20] [INFO ] Implicit Places using invariants in 514 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 539 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 380/505 places, 681/1845 transitions.
Applied a total of 0 rules in 15 ms. Remains 380 /380 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 626 ms. Remains : 380/505 places, 681/1845 transitions.
Support contains 41 out of 380 places after structural reductions.
[2023-04-07 05:10:20] [INFO ] Flatten gal took : 72 ms
[2023-04-07 05:10:20] [INFO ] Flatten gal took : 48 ms
[2023-04-07 05:10:20] [INFO ] Input system was already deterministic with 681 transitions.
Support contains 33 out of 380 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 681 rows 380 cols
[2023-04-07 05:10:24] [INFO ] Computed 20 invariants in 14 ms
[2023-04-07 05:10:24] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:10:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:10:24] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 15 ms returned sat
[2023-04-07 05:10:24] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:10:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:25] [INFO ] After 229ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:10:25] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-04-07 05:10:25] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 160 place count 300 transition count 533
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 296 place count 232 transition count 533
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 312 place count 216 transition count 421
Iterating global reduction 2 with 16 rules applied. Total rules applied 328 place count 216 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 213 transition count 418
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 213 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 336 place count 212 transition count 417
Applied a total of 336 rules in 66 ms. Remains 212 /380 variables (removed 168) and now considering 417/681 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 212/380 places, 417/681 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 417 rows 212 cols
[2023-04-07 05:10:25] [INFO ] Computed 20 invariants in 18 ms
[2023-04-07 05:10:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:10:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 05:10:25] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 05:10:26] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:10:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:26] [INFO ] After 96ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:10:26] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-04-07 05:10:26] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 417/417 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 416
Applied a total of 2 rules in 16 ms. Remains 211 /212 variables (removed 1) and now considering 416/417 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 211/212 places, 416/417 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 472899 steps, run visited all 2 properties in 1320 ms. (steps per millisecond=358 )
Probabilistic random walk after 472899 steps, saw 316535 distinct states, run finished after 1320 ms. (steps per millisecond=358 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 11 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 05:10:28] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 05:10:28] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-04-07 05:10:28] [INFO ] Invariant cache hit.
[2023-04-07 05:10:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:29] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2023-04-07 05:10:29] [INFO ] Invariant cache hit.
[2023-04-07 05:10:29] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 361/380 places, 550/681 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 1979 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-00 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 s125 1) (EQ s230 0) (EQ s84 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]]
Product exploration explored 100000 steps with 9 reset in 297 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-00 finished in 4045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 21 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 05:10:32] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 05:10:32] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-04-07 05:10:32] [INFO ] Invariant cache hit.
[2023-04-07 05:10:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:33] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2023-04-07 05:10:33] [INFO ] Invariant cache hit.
[2023-04-07 05:10:33] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1614 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 357 ms.
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-01 finished in 2467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 14 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 05:10:34] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:10:34] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-04-07 05:10:34] [INFO ] Invariant cache hit.
[2023-04-07 05:10:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:35] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2023-04-07 05:10:35] [INFO ] Invariant cache hit.
[2023-04-07 05:10:36] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s298 0) (EQ s89 1)), p1:(OR (EQ s36 0) (EQ s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 2556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(F(p1) U p2)))))'
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 380 transition count 604
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 303 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 302 transition count 603
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 156 place count 302 transition count 534
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 294 place count 233 transition count 534
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 309 place count 218 transition count 455
Iterating global reduction 3 with 15 rules applied. Total rules applied 324 place count 218 transition count 455
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 328 place count 216 transition count 453
Applied a total of 328 rules in 39 ms. Remains 216 /380 variables (removed 164) and now considering 453/681 (removed 228) transitions.
// Phase 1: matrix 453 rows 216 cols
[2023-04-07 05:10:37] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:10:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-04-07 05:10:37] [INFO ] Invariant cache hit.
[2023-04-07 05:10:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:37] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-04-07 05:10:37] [INFO ] Redundant transitions in 28 ms returned []
[2023-04-07 05:10:37] [INFO ] Invariant cache hit.
[2023-04-07 05:10:38] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 216/380 places, 453/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 924 ms. Remains : 216/380 places, 453/681 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (OR (EQ s38 0) (EQ s101 1))), p2:(AND (OR (EQ s125 0) (EQ s163 1)) (OR (EQ s56 0) (EQ s30 1))), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 37 reset in 183 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-05 finished in 1254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((F(p2)&&p1))))))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 16 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 05:10:38] [INFO ] Computed 20 invariants in 8 ms
[2023-04-07 05:10:38] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-04-07 05:10:38] [INFO ] Invariant cache hit.
[2023-04-07 05:10:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:39] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2023-04-07 05:10:39] [INFO ] Invariant cache hit.
[2023-04-07 05:10:40] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1874 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s31 1)), p1:(AND (EQ s46 0) (EQ s31 1)), p2:(EQ s46 0)], 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 7 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-08 finished in 2066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 320 place count 210 transition count 399
Iterating global reduction 2 with 20 rules applied. Total rules applied 340 place count 210 transition count 399
Applied a total of 340 rules in 25 ms. Remains 210 /380 variables (removed 170) and now considering 399/681 (removed 282) transitions.
// Phase 1: matrix 399 rows 210 cols
[2023-04-07 05:10:40] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 05:10:40] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-04-07 05:10:40] [INFO ] Invariant cache hit.
[2023-04-07 05:10:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:41] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-04-07 05:10:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 05:10:41] [INFO ] Invariant cache hit.
[2023-04-07 05:10:41] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/380 places, 399/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 857 ms. Remains : 210/380 places, 399/681 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s119 1)), p1:(OR (EQ s126 0) (EQ s119 1)), p2:(EQ s209 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 85 reset in 140 ms.
Product exploration explored 100000 steps with 87 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:10:41] [INFO ] Invariant cache hit.
[2023-04-07 05:10:41] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:10:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 05:10:42] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 05:10:42] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 210 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 : 210/210 places, 399/399 transitions.
Applied a total of 0 rules in 7 ms. Remains 210 /210 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-04-07 05:10:42] [INFO ] Invariant cache hit.
[2023-04-07 05:10:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-04-07 05:10:42] [INFO ] Invariant cache hit.
[2023-04-07 05:10:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:42] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-04-07 05:10:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 05:10:42] [INFO ] Invariant cache hit.
[2023-04-07 05:10:43] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 827 ms. Remains : 210/210 places, 399/399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 530 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 88 reset in 130 ms.
Product exploration explored 100000 steps with 110 reset in 144 ms.
Built C files in :
/tmp/ltsmin9601716616220677454
[2023-04-07 05:10:44] [INFO ] Computing symmetric may disable matrix : 399 transitions.
[2023-04-07 05:10:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:10:44] [INFO ] Computing symmetric may enable matrix : 399 transitions.
[2023-04-07 05:10:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:10:44] [INFO ] Computing Do-Not-Accords matrix : 399 transitions.
[2023-04-07 05:10:44] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:10:44] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9601716616220677454
Running compilation step : cd /tmp/ltsmin9601716616220677454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin9601716616220677454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9601716616220677454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased969679765815101013.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 209 transition count 398
Applied a total of 2 rules in 15 ms. Remains 209 /210 variables (removed 1) and now considering 398/399 (removed 1) transitions.
// Phase 1: matrix 398 rows 209 cols
[2023-04-07 05:10:59] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:10:59] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-04-07 05:10:59] [INFO ] Invariant cache hit.
[2023-04-07 05:10:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:10:59] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2023-04-07 05:10:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 05:10:59] [INFO ] Invariant cache hit.
[2023-04-07 05:11:00] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/210 places, 398/399 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 885 ms. Remains : 209/210 places, 398/399 transitions.
Built C files in :
/tmp/ltsmin4931143051737935489
[2023-04-07 05:11:00] [INFO ] Computing symmetric may disable matrix : 398 transitions.
[2023-04-07 05:11:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:11:00] [INFO ] Computing symmetric may enable matrix : 398 transitions.
[2023-04-07 05:11:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:11:00] [INFO ] Computing Do-Not-Accords matrix : 398 transitions.
[2023-04-07 05:11:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:11:00] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4931143051737935489
Running compilation step : cd /tmp/ltsmin4931143051737935489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin4931143051737935489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4931143051737935489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3317397241289041482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:11:15] [INFO ] Flatten gal took : 27 ms
[2023-04-07 05:11:15] [INFO ] Flatten gal took : 24 ms
[2023-04-07 05:11:15] [INFO ] Time to serialize gal into /tmp/LTL17547217015020803869.gal : 5 ms
[2023-04-07 05:11:15] [INFO ] Time to serialize properties into /tmp/LTL9127854333381834932.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17547217015020803869.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9301553297641815815.hoa' '-atoms' '/tmp/LTL9127854333381834932.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9127854333381834932.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9301553297641815815.hoa
Detected timeout of ITS tools.
[2023-04-07 05:11:30] [INFO ] Flatten gal took : 39 ms
[2023-04-07 05:11:30] [INFO ] Flatten gal took : 21 ms
[2023-04-07 05:11:30] [INFO ] Time to serialize gal into /tmp/LTL17318070220973309217.gal : 4 ms
[2023-04-07 05:11:30] [INFO ] Time to serialize properties into /tmp/LTL12413490123687518503.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17318070220973309217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12413490123687518503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((G("((p2_8_2==0)||(p2_2_5==1))"))||(F(("((p2_8_2==0)||(p2_2_5==1))")||(G("(cs_8_1==1)")))))))
Formula 0 simplified : G(F!"(cs_8_1==1)" & FG!"((p2_8_2==0)||(p2_2_5==1))")
Detected timeout of ITS tools.
[2023-04-07 05:11:45] [INFO ] Flatten gal took : 19 ms
[2023-04-07 05:11:45] [INFO ] Applying decomposition
[2023-04-07 05:11:45] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9273027000898879955.txt' '-o' '/tmp/graph9273027000898879955.bin' '-w' '/tmp/graph9273027000898879955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9273027000898879955.bin' '-l' '-1' '-v' '-w' '/tmp/graph9273027000898879955.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:11:45] [INFO ] Decomposing Gal with order
[2023-04-07 05:11:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:11:45] [INFO ] Removed a total of 706 redundant transitions.
[2023-04-07 05:11:45] [INFO ] Flatten gal took : 67 ms
[2023-04-07 05:11:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 14 ms.
[2023-04-07 05:11:45] [INFO ] Time to serialize gal into /tmp/LTL9603668868056827723.gal : 6 ms
[2023-04-07 05:11:45] [INFO ] Time to serialize properties into /tmp/LTL237613135581597539.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9603668868056827723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL237613135581597539.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((G("((i10.i1.u31.p2_8_2==0)||(i7.u34.p2_2_5==1))"))||(F(("((i10.i1.u31.p2_8_2==0)||(i7.u34.p2_2_5==1))")||(G("(i10.i1.u53.cs_8_1=...166
Formula 0 simplified : G(F!"(i10.i1.u53.cs_8_1==1)" & FG!"((i10.i1.u31.p2_8_2==0)||(i7.u34.p2_2_5==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11904589221682115916
[2023-04-07 05:12:00] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11904589221682115916
Running compilation step : cd /tmp/ltsmin11904589221682115916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin11904589221682115916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11904589221682115916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true))||<>(([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLCardinality-09 finished in 95502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 300 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 299 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 162 place count 299 transition count 528
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 306 place count 227 transition count 528
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 326 place count 207 transition count 396
Iterating global reduction 3 with 20 rules applied. Total rules applied 346 place count 207 transition count 396
Applied a total of 346 rules in 27 ms. Remains 207 /380 variables (removed 173) and now considering 396/681 (removed 285) transitions.
// Phase 1: matrix 396 rows 207 cols
[2023-04-07 05:12:16] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 05:12:16] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-04-07 05:12:16] [INFO ] Invariant cache hit.
[2023-04-07 05:12:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:12:17] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-04-07 05:12:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:12:17] [INFO ] Invariant cache hit.
[2023-04-07 05:12:17] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/380 places, 396/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1276 ms. Remains : 207/380 places, 396/681 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s162 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 113 reset in 203 ms.
Product exploration explored 100000 steps with 87 reset in 170 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5163 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=322 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 332 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 22 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 05:12:18] [INFO ] Invariant cache hit.
[2023-04-07 05:12:18] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-04-07 05:12:18] [INFO ] Invariant cache hit.
[2023-04-07 05:12:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:12:19] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-04-07 05:12:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 05:12:19] [INFO ] Invariant cache hit.
[2023-04-07 05:12:19] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 955 ms. Remains : 207/207 places, 396/396 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 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 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 878 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=292 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 80 reset in 121 ms.
Product exploration explored 100000 steps with 66 reset in 127 ms.
Built C files in :
/tmp/ltsmin17202294018703519309
[2023-04-07 05:12:20] [INFO ] Computing symmetric may disable matrix : 396 transitions.
[2023-04-07 05:12:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:20] [INFO ] Computing symmetric may enable matrix : 396 transitions.
[2023-04-07 05:12:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:20] [INFO ] Computing Do-Not-Accords matrix : 396 transitions.
[2023-04-07 05:12:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:20] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17202294018703519309
Running compilation step : cd /tmp/ltsmin17202294018703519309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 769 ms.
Running link step : cd /tmp/ltsmin17202294018703519309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17202294018703519309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7298572311883348780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 11 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 05:12:35] [INFO ] Invariant cache hit.
[2023-04-07 05:12:35] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-04-07 05:12:35] [INFO ] Invariant cache hit.
[2023-04-07 05:12:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:12:36] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-04-07 05:12:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 05:12:36] [INFO ] Invariant cache hit.
[2023-04-07 05:12:36] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 789 ms. Remains : 207/207 places, 396/396 transitions.
Built C files in :
/tmp/ltsmin17715032084043675504
[2023-04-07 05:12:36] [INFO ] Computing symmetric may disable matrix : 396 transitions.
[2023-04-07 05:12:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:36] [INFO ] Computing symmetric may enable matrix : 396 transitions.
[2023-04-07 05:12:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:36] [INFO ] Computing Do-Not-Accords matrix : 396 transitions.
[2023-04-07 05:12:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:12:36] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17715032084043675504
Running compilation step : cd /tmp/ltsmin17715032084043675504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 766 ms.
Running link step : cd /tmp/ltsmin17715032084043675504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17715032084043675504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3394788252387553260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:12:51] [INFO ] Flatten gal took : 18 ms
[2023-04-07 05:12:51] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:12:51] [INFO ] Time to serialize gal into /tmp/LTL15292739673023803683.gal : 3 ms
[2023-04-07 05:12:51] [INFO ] Time to serialize properties into /tmp/LTL3497016044605061312.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15292739673023803683.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4200260280722237604.hoa' '-atoms' '/tmp/LTL3497016044605061312.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3497016044605061312.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4200260280722237604.hoa
Detected timeout of ITS tools.
[2023-04-07 05:13:06] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:13:06] [INFO ] Flatten gal took : 13 ms
[2023-04-07 05:13:06] [INFO ] Time to serialize gal into /tmp/LTL11684615163753044646.gal : 2 ms
[2023-04-07 05:13:06] [INFO ] Time to serialize properties into /tmp/LTL15444414098246114540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11684615163753044646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15444414098246114540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p3_4_0==0)"))))
Formula 0 simplified : FG!"(p3_4_0==0)"
Detected timeout of ITS tools.
[2023-04-07 05:13:21] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:13:21] [INFO ] Applying decomposition
[2023-04-07 05:13:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12137987422967623827.txt' '-o' '/tmp/graph12137987422967623827.bin' '-w' '/tmp/graph12137987422967623827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12137987422967623827.bin' '-l' '-1' '-v' '-w' '/tmp/graph12137987422967623827.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:13:21] [INFO ] Decomposing Gal with order
[2023-04-07 05:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:13:21] [INFO ] Removed a total of 652 redundant transitions.
[2023-04-07 05:13:21] [INFO ] Flatten gal took : 34 ms
[2023-04-07 05:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 18 ms.
[2023-04-07 05:13:21] [INFO ] Time to serialize gal into /tmp/LTL6586235549824504003.gal : 9 ms
[2023-04-07 05:13:21] [INFO ] Time to serialize properties into /tmp/LTL5647592598385256840.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6586235549824504003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5647592598385256840.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(i0.i1.u18.p3_4_0==0)"))))
Formula 0 simplified : FG!"(i0.i1.u18.p3_4_0==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17599765148297025924
[2023-04-07 05:13:36] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17599765148297025924
Running compilation step : cd /tmp/ltsmin17599765148297025924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin17599765148297025924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17599765148297025924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLCardinality-10 finished in 95905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(((!p1&&X(p2))||G(p2)))))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 360 transition count 549
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 360 transition count 549
Applied a total of 40 rules in 14 ms. Remains 360 /380 variables (removed 20) and now considering 549/681 (removed 132) transitions.
// Phase 1: matrix 549 rows 360 cols
[2023-04-07 05:13:51] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:13:52] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-04-07 05:13:52] [INFO ] Invariant cache hit.
[2023-04-07 05:13:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:13:53] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
[2023-04-07 05:13:53] [INFO ] Invariant cache hit.
[2023-04-07 05:13:53] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/380 places, 549/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1467 ms. Remains : 360/380 places, 549/681 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s170 0) (EQ s305 1)), p2:(OR (EQ s270 0) (EQ s144 1)), p0:(AND (EQ s144 0) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 146 ms.
Stack based approach found an accepted trace after 1536 steps with 1 reset with depth 1373 and stack size 757 in 2 ms.
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-11 finished in 1966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 551
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 551
Applied a total of 36 rules in 12 ms. Remains 362 /380 variables (removed 18) and now considering 551/681 (removed 130) transitions.
// Phase 1: matrix 551 rows 362 cols
[2023-04-07 05:13:53] [INFO ] Computed 20 invariants in 4 ms
[2023-04-07 05:13:54] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-04-07 05:13:54] [INFO ] Invariant cache hit.
[2023-04-07 05:13:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:13:55] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-04-07 05:13:55] [INFO ] Invariant cache hit.
[2023-04-07 05:13:55] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 551/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 362/380 places, 551/681 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s277 0) (EQ s288 1)), p0:(AND (EQ s109 0) (EQ s48 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-13 finished in 1652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 13 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 05:13:55] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 05:13:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-04-07 05:13:55] [INFO ] Invariant cache hit.
[2023-04-07 05:13:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:13:56] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-04-07 05:13:56] [INFO ] Invariant cache hit.
[2023-04-07 05:13:56] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s119 1)), p1:(OR (EQ s35 0) (EQ s119 1) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:13:57] [INFO ] Invariant cache hit.
[2023-04-07 05:13:57] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:13:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 05:13:57] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 05:13:58] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:13:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:13:58] [INFO ] After 153ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:13:58] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 05:13:58] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 32 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1154 ms. (steps per millisecond=408 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1154 ms. (steps per millisecond=408 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 05:13:59] [INFO ] Invariant cache hit.
[2023-04-07 05:14:00] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-07 05:14:00] [INFO ] Invariant cache hit.
[2023-04-07 05:14:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:01] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2023-04-07 05:14:01] [INFO ] Invariant cache hit.
[2023-04-07 05:14:01] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1790 ms. Remains : 362/362 places, 567/567 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 72 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:14:01] [INFO ] Invariant cache hit.
[2023-04-07 05:14:01] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 05:14:01] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 05:14:02] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:02] [INFO ] After 153ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:14:02] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 05:14:02] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 24 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1283 ms. (steps per millisecond=367 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1283 ms. (steps per millisecond=367 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 223 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 567
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 70 Pre rules applied. Total rules applied 80 place count 362 transition count 567
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 150 place count 362 transition count 567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 362 transition count 567
Deduced a syphon composed of 151 places in 0 ms
Applied a total of 151 rules in 35 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 05:14:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 05:14:04] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 05:14:05] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/362 places, 567/567 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 362/362 places, 567/567 transitions.
Built C files in :
/tmp/ltsmin3301995774548347299
[2023-04-07 05:14:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3301995774548347299
Running compilation step : cd /tmp/ltsmin3301995774548347299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 823 ms.
Running link step : cd /tmp/ltsmin3301995774548347299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3301995774548347299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15836362955358130393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 15 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 05:14:20] [INFO ] Computed 20 invariants in 7 ms
[2023-04-07 05:14:20] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-07 05:14:20] [INFO ] Invariant cache hit.
[2023-04-07 05:14:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:14:21] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-04-07 05:14:21] [INFO ] Invariant cache hit.
[2023-04-07 05:14:21] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1371 ms. Remains : 362/362 places, 567/567 transitions.
Built C files in :
/tmp/ltsmin3249983821127997384
[2023-04-07 05:14:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3249983821127997384
Running compilation step : cd /tmp/ltsmin3249983821127997384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 811 ms.
Running link step : cd /tmp/ltsmin3249983821127997384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3249983821127997384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16052732645390547893.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:14:36] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:14:36] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:14:36] [INFO ] Time to serialize gal into /tmp/LTL14613939709362467671.gal : 3 ms
[2023-04-07 05:14:36] [INFO ] Time to serialize properties into /tmp/LTL13042838663904056969.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14613939709362467671.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16667031411673688699.hoa' '-atoms' '/tmp/LTL13042838663904056969.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13042838663904056969.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16667031411673688699.hoa
Detected timeout of ITS tools.
[2023-04-07 05:14:51] [INFO ] Flatten gal took : 16 ms
[2023-04-07 05:14:51] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:14:51] [INFO ] Time to serialize gal into /tmp/LTL1786850337797812165.gal : 3 ms
[2023-04-07 05:14:51] [INFO ] Time to serialize properties into /tmp/LTL5861848512237823324.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1786850337797812165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5861848512237823324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((ncs_7_4==0)||(p2_0_0==1))")||(X(G("(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))"))))))
Formula 0 simplified : F(!"((ncs_7_4==0)||(p2_0_0==1))" & XF!"(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))")
Detected timeout of ITS tools.
[2023-04-07 05:15:07] [INFO ] Flatten gal took : 20 ms
[2023-04-07 05:15:07] [INFO ] Applying decomposition
[2023-04-07 05:15:07] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2849413624827937940.txt' '-o' '/tmp/graph2849413624827937940.bin' '-w' '/tmp/graph2849413624827937940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2849413624827937940.bin' '-l' '-1' '-v' '-w' '/tmp/graph2849413624827937940.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:15:07] [INFO ] Decomposing Gal with order
[2023-04-07 05:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:15:07] [INFO ] Removed a total of 928 redundant transitions.
[2023-04-07 05:15:07] [INFO ] Flatten gal took : 32 ms
[2023-04-07 05:15:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 11 ms.
[2023-04-07 05:15:07] [INFO ] Time to serialize gal into /tmp/LTL12717041537497416339.gal : 6 ms
[2023-04-07 05:15:07] [INFO ] Time to serialize properties into /tmp/LTL1674635707302037219.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12717041537497416339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1674635707302037219.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.i1.u47.ncs_7_4==0)||(i9.u8.p2_0_0==1))")||(X(G("(((i1.i1.u47.ncs_7_4==0)||(i9.u8.p2_0_0==1))||(i7.i1.u80.p1_4_14==0))"))))...157
Formula 0 simplified : F(!"((i1.i1.u47.ncs_7_4==0)||(i9.u8.p2_0_0==1))" & XF!"(((i1.i1.u47.ncs_7_4==0)||(i9.u8.p2_0_0==1))||(i7.i1.u80.p1_4_14==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17190187992386861352
[2023-04-07 05:15:22] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17190187992386861352
Running compilation step : cd /tmp/ltsmin17190187992386861352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 808 ms.
Running link step : cd /tmp/ltsmin17190187992386861352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17190187992386861352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 101846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 24 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 05:15:37] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 05:15:37] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-07 05:15:37] [INFO ] Invariant cache hit.
[2023-04-07 05:15:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:38] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-04-07 05:15:38] [INFO ] Invariant cache hit.
[2023-04-07 05:15:39] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1723 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-15 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 s58 0) (EQ s336 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 11746 steps with 0 reset in 20 ms.
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-15 finished in 1850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Found a Lengthening insensitive property : Anderson-PT-09-LTLCardinality-14
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 318 place count 212 transition count 417
Iterating global reduction 2 with 18 rules applied. Total rules applied 336 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 211 transition count 416
Applied a total of 338 rules in 32 ms. Remains 211 /380 variables (removed 169) and now considering 416/681 (removed 265) transitions.
// Phase 1: matrix 416 rows 211 cols
[2023-04-07 05:15:39] [INFO ] Computed 20 invariants in 6 ms
[2023-04-07 05:15:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 05:15:39] [INFO ] Invariant cache hit.
[2023-04-07 05:15:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:40] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-04-07 05:15:40] [INFO ] Invariant cache hit.
[2023-04-07 05:15:40] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/380 places, 416/681 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 853 ms. Remains : 211/380 places, 416/681 transitions.
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s118 1)), p1:(OR (EQ s35 0) (EQ s118 1) (EQ s81 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 1540 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:15:42] [INFO ] Invariant cache hit.
[2023-04-07 05:15:42] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:15:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 05:15:42] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:15:42] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:42] [INFO ] After 40ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:42] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-07 05:15:42] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 16 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 210/211 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1185 ms. (steps per millisecond=398 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1185 ms. (steps per millisecond=398 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 05:15:44] [INFO ] Invariant cache hit.
[2023-04-07 05:15:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-04-07 05:15:44] [INFO ] Invariant cache hit.
[2023-04-07 05:15:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:44] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-04-07 05:15:44] [INFO ] Invariant cache hit.
[2023-04-07 05:15:45] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 797 ms. Remains : 211/211 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:15:45] [INFO ] Invariant cache hit.
[2023-04-07 05:15:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:15:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 05:15:45] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:15:45] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:15:45] [INFO ] After 41ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:15:45] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 05:15:45] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 13 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 210/211 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1249 ms. (steps per millisecond=377 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1249 ms. (steps per millisecond=377 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 9 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 05:15:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:15:47] [INFO ] Invariant cache hit.
[2023-04-07 05:15:48] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 211/211 places, 416/416 transitions.
Built C files in :
/tmp/ltsmin12389505702920667221
[2023-04-07 05:15:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12389505702920667221
Running compilation step : cd /tmp/ltsmin12389505702920667221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 590 ms.
Running link step : cd /tmp/ltsmin12389505702920667221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12389505702920667221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1766524299245307373.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 05:16:03] [INFO ] Invariant cache hit.
[2023-04-07 05:16:03] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-07 05:16:03] [INFO ] Invariant cache hit.
[2023-04-07 05:16:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 05:16:03] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-04-07 05:16:03] [INFO ] Invariant cache hit.
[2023-04-07 05:16:03] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 211/211 places, 416/416 transitions.
Built C files in :
/tmp/ltsmin3146855599139058115
[2023-04-07 05:16:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3146855599139058115
Running compilation step : cd /tmp/ltsmin3146855599139058115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 594 ms.
Running link step : cd /tmp/ltsmin3146855599139058115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3146855599139058115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9390542041478380631.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:16:19] [INFO ] Flatten gal took : 13 ms
[2023-04-07 05:16:19] [INFO ] Flatten gal took : 11 ms
[2023-04-07 05:16:19] [INFO ] Time to serialize gal into /tmp/LTL18145676209236836085.gal : 2 ms
[2023-04-07 05:16:19] [INFO ] Time to serialize properties into /tmp/LTL3675038082211489106.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18145676209236836085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7326471920204222147.hoa' '-atoms' '/tmp/LTL3675038082211489106.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3675038082211489106.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7326471920204222147.hoa
Detected timeout of ITS tools.
[2023-04-07 05:16:34] [INFO ] Flatten gal took : 12 ms
[2023-04-07 05:16:34] [INFO ] Flatten gal took : 11 ms
[2023-04-07 05:16:34] [INFO ] Time to serialize gal into /tmp/LTL3557300703899735336.gal : 2 ms
[2023-04-07 05:16:34] [INFO ] Time to serialize properties into /tmp/LTL4530398246455431720.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3557300703899735336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4530398246455431720.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((ncs_7_4==0)||(p2_0_0==1))")||(X(G("(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))"))))))
Formula 0 simplified : F(!"((ncs_7_4==0)||(p2_0_0==1))" & XF!"(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))")
Detected timeout of ITS tools.
[2023-04-07 05:16:49] [INFO ] Flatten gal took : 15 ms
[2023-04-07 05:16:49] [INFO ] Applying decomposition
[2023-04-07 05:16:49] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph975795128484689527.txt' '-o' '/tmp/graph975795128484689527.bin' '-w' '/tmp/graph975795128484689527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph975795128484689527.bin' '-l' '-1' '-v' '-w' '/tmp/graph975795128484689527.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:16:49] [INFO ] Decomposing Gal with order
[2023-04-07 05:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:16:49] [INFO ] Removed a total of 747 redundant transitions.
[2023-04-07 05:16:49] [INFO ] Flatten gal took : 22 ms
[2023-04-07 05:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 7 ms.
[2023-04-07 05:16:49] [INFO ] Time to serialize gal into /tmp/LTL4182137629345543028.gal : 4 ms
[2023-04-07 05:16:49] [INFO ] Time to serialize properties into /tmp/LTL11905268905913187521.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4182137629345543028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11905268905913187521.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((u53.ncs_7_4==0)||(i4.u29.p2_0_0==1))")||(X(G("(((u53.ncs_7_4==0)||(i4.u29.p2_0_0==1))||(i8.u23.p1_4_14==0))"))))))
Formula 0 simplified : F(!"((u53.ncs_7_4==0)||(i4.u29.p2_0_0==1))" & XF!"(((u53.ncs_7_4==0)||(i4.u29.p2_0_0==1))||(i8.u23.p1_4_14==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6104485070616138498
[2023-04-07 05:17:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6104485070616138498
Running compilation step : cd /tmp/ltsmin6104485070616138498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 591 ms.
Running link step : cd /tmp/ltsmin6104485070616138498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6104485070616138498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 100141 ms.
[2023-04-07 05:17:19] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6070209900674595328
[2023-04-07 05:17:19] [INFO ] Computing symmetric may disable matrix : 681 transitions.
[2023-04-07 05:17:19] [INFO ] Applying decomposition
[2023-04-07 05:17:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:19] [INFO ] Computing symmetric may enable matrix : 681 transitions.
[2023-04-07 05:17:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:19] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1258733039922000039.txt' '-o' '/tmp/graph1258733039922000039.bin' '-w' '/tmp/graph1258733039922000039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1258733039922000039.bin' '-l' '-1' '-v' '-w' '/tmp/graph1258733039922000039.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:17:19] [INFO ] Decomposing Gal with order
[2023-04-07 05:17:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:17:19] [INFO ] Computing Do-Not-Accords matrix : 681 transitions.
[2023-04-07 05:17:19] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:17:19] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6070209900674595328
Running compilation step : cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 05:17:19] [INFO ] Removed a total of 1234 redundant transitions.
[2023-04-07 05:17:19] [INFO ] Flatten gal took : 35 ms
[2023-04-07 05:17:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 9 ms.
[2023-04-07 05:17:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality17302510810892328315.gal : 7 ms
[2023-04-07 05:17:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality15278357739532364601.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17302510810892328315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15278357739532364601.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((G((G("((i1.u93.p2_8_2==0)||(i3.u69.p2_2_5==1))"))||(F(("((i1.u93.p2_8_2==0)||(i3.u69.p2_2_5==1))")||(G("(i1.u92.cs_8_1==1)")))))))
Formula 0 simplified : G(F!"(i1.u92.cs_8_1==1)" & FG!"((i1.u93.p2_8_2==0)||(i3.u69.p2_2_5==1))")
Compilation finished in 1550 ms.
Running link step : cd /tmp/ltsmin6070209900674595328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](([]((LTLAPp0==true))||<>(([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](([]((LTLAPp0==true))||<>(([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 05:39:39] [INFO ] Applying decomposition
[2023-04-07 05:39:39] [INFO ] Flatten gal took : 30 ms
[2023-04-07 05:39:39] [INFO ] Decomposing Gal with order
[2023-04-07 05:39:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:39:39] [INFO ] Removed a total of 723 redundant transitions.
[2023-04-07 05:39:39] [INFO ] Flatten gal took : 135 ms
[2023-04-07 05:39:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 5 ms.
[2023-04-07 05:39:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality13718596427714715623.gal : 3 ms
[2023-04-07 05:39:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality9180864088234125956.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13718596427714715623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9180864088234125956.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G((G("((u5.p2_8_2==0)||(u8.p2_2_5==1))"))||(F(("((u5.p2_8_2==0)||(u8.p2_2_5==1))")||(G("(u5.cs_8_1==1)")))))))
Formula 0 simplified : G(F!"(u5.cs_8_1==1)" & FG!"((u5.p2_8_2==0)||(u8.p2_2_5==1))")
Reverse transition relation is NOT exact ! Due to transitions t40, t41, t42, t51, t52, t53, t54, t55, t56, t60, t61, t62, t63, t64, t65, t70, t71, t72, t79...1348
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
37786 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,377.906,3571288,1,0,5.0819e+06,2.27941e+06,3527,4.78823e+06,1486,1.62566e+07,26703417
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(u1.p3_4_0==0)"))))
Formula 1 simplified : FG!"(u1.p3_4_0==0)"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2126 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,399.163,3762708,1,0,5.80787e+06,2.27941e+06,4375,5.47736e+06,1629,1.62566e+07,30779580
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(("((u4.ncs_7_4==0)||(u6.p2_0_0==1))")||(X(G("(((u4.ncs_7_4==0)||(u6.p2_0_0==1))||(u1.p1_4_14==0))"))))))
Formula 2 simplified : F(!"((u4.ncs_7_4==0)||(u6.p2_0_0==1))" & XF!"(((u4.ncs_7_4==0)||(u6.p2_0_0==1))||(u1.p1_4_14==0))")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6070209900674595328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp5==true)))||(LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 06:01:59] [INFO ] Flatten gal took : 62 ms
[2023-04-07 06:01:59] [INFO ] Input system was already deterministic with 681 transitions.
[2023-04-07 06:01:59] [INFO ] Transformed 380 places.
[2023-04-07 06:01:59] [INFO ] Transformed 681 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-04-07 06:02:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality7814890260733900705.gal : 3 ms
[2023-04-07 06:02:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality1033754240438393414.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7814890260733900705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1033754240438393414.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((ncs_7_4==0)||(p2_0_0==1))")||(X(G("(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))"))))))
Formula 0 simplified : F(!"((ncs_7_4==0)||(p2_0_0==1))" & XF!"(((ncs_7_4==0)||(p2_0_0==1))||(p1_4_14==0))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8459104 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039460 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-09, 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 r517-tall-167987243300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 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 ;