About the Execution of ITS-Tools for UtilityControlRoom-COL-Z2T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4597.075 | 747307.00 | 2727972.00 | 549.50 | FFFFFFFFFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r276-smll-165307352900035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-COL-Z2T3N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 8.4K Apr 29 18:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 18:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653117218226
Running Version 202205111006
[2022-05-21 07:13:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:13:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:13:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:13:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1202 ms
[2022-05-21 07:13:41] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:13:41] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2022-05-21 07:13:41] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 13 cols
[2022-05-21 07:13:42] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-21 07:13:42] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-21 07:13:42] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2022-05-21 07:13:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 07:13:42] [INFO ] Flatten gal took : 34 ms
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:13:42] [INFO ] Flatten gal took : 7 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:13:43] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 32 ms.
[2022-05-21 07:13:43] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 164 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 16 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:13:43] [INFO ] Computed 23 place invariants in 22 ms
[2022-05-21 07:13:43] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:13:43] [INFO ] Computed 23 place invariants in 18 ms
[2022-05-21 07:13:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:13:43] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-21 07:13:43] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 230/230 transitions.
Support contains 164 out of 174 places after structural reductions.
[2022-05-21 07:13:43] [INFO ] Flatten gal took : 44 ms
[2022-05-21 07:13:43] [INFO ] Flatten gal took : 33 ms
[2022-05-21 07:13:44] [INFO ] Input system was already deterministic with 230 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:13:44] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 07:13:44] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-21 07:13:44] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((false U F(p0)))||F(X(G(p1)))))'
Support contains 53 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 174 transition count 210
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 30 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:13:45] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:13:45] [INFO ] Implicit Places using invariants in 170 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LEQ s102 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28262 reset in 907 ms.
Product exploration explored 100000 steps with 28149 reset in 502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:13:47] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:13:47] [INFO ] After 44ms SMT Verify possible using all constraints in real 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:13:47] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:13:48] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00 finished in 3184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:13:48] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 07:13:48] [INFO ] Implicit Places using invariants in 156 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86...], 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 1290 reset in 316 ms.
Stack based approach found an accepted trace after 59133 steps with 791 reset with depth 130 and stack size 130 in 267 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-01 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((p0 U !p0)))))'
Support contains 40 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 143 place count 112 transition count 130
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 164 place count 101 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 184 place count 91 transition count 110
Applied a total of 184 rules in 111 ms. Remains 91 /174 variables (removed 83) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:49] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:13:49] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:49] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-21 07:13:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-21 07:13:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:49] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-21 07:13:49] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/174 places, 110/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/174 places, 110/230 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 ...], 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 0 reset in 424 ms.
Product exploration explored 100000 steps with 2 reset in 629 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]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:51] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:13:51] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-21 07:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:13:51] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-21 07:13:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:13:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2022-05-21 07:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:13:51] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-21 07:13:51] [INFO ] Computed and/alt/rep : 80/100/80 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-21 07:13:51] [INFO ] Added : 4 causal constraints over 1 iterations in 64 ms. Result :sat
Could not prove EG p0
Support contains 40 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 110/110 transitions.
Applied a total of 0 rules in 18 ms. Remains 91 /91 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:51] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-21 07:13:52] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:52] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-21 07:13:52] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-05-21 07:13:52] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:52] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-21 07:13:52] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 110/110 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]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:13:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:13:53] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-05-21 07:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:13:53] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-21 07:13:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:13:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2022-05-21 07:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:13:53] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-21 07:13:53] [INFO ] Computed and/alt/rep : 80/100/80 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-21 07:13:53] [INFO ] Added : 4 causal constraints over 1 iterations in 73 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 3 reset in 576 ms.
Built C files in :
/tmp/ltsmin14382189422331102816
[2022-05-21 07:13:54] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2022-05-21 07:13:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:13:54] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2022-05-21 07:13:54] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:13:54] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2022-05-21 07:13:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:13:54] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14382189422331102816
Running compilation step : cd /tmp/ltsmin14382189422331102816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 512 ms.
Running link step : cd /tmp/ltsmin14382189422331102816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14382189422331102816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10349784834511507592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 110/110 transitions.
Applied a total of 0 rules in 19 ms. Remains 91 /91 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:14:09] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:14:09] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:14:09] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:14:09] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-05-21 07:14:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 110 rows 91 cols
[2022-05-21 07:14:09] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-21 07:14:09] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin15759375145012687174
[2022-05-21 07:14:09] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2022-05-21 07:14:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:09] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2022-05-21 07:14:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:09] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2022-05-21 07:14:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15759375145012687174
Running compilation step : cd /tmp/ltsmin15759375145012687174;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin15759375145012687174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15759375145012687174;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17241342531374672945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:14:25] [INFO ] Flatten gal took : 10 ms
[2022-05-21 07:14:25] [INFO ] Flatten gal took : 9 ms
[2022-05-21 07:14:25] [INFO ] Time to serialize gal into /tmp/LTL3971844797582633611.gal : 3 ms
[2022-05-21 07:14:25] [INFO ] Time to serialize properties into /tmp/LTL16823089345451538881.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3971844797582633611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16823089345451538881.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3971844...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G(("((((((OpenRequests_0+OpenRequests_1)+(OpenRequests_2+OpenRequests_3))+((OpenRequests_4+OpenRequests_5)+(OpenRequests_6+Open...1479
Formula 0 simplified : !GFG("((((((OpenRequests_0+OpenRequests_1)+(OpenRequests_2+OpenRequests_3))+((OpenRequests_4+OpenRequests_5)+(OpenRequests_6+OpenReq...1471
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
164 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,1.68516,40936,1,0,55,89775,25,35,8457,85207,229
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02 finished in 37855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 83 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 83 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 83 transition count 70
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 73 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 252 place count 63 transition count 60
Applied a total of 252 rules in 27 ms. Remains 63 /174 variables (removed 111) and now considering 60/230 (removed 170) transitions.
// Phase 1: matrix 60 rows 63 cols
[2022-05-21 07:14:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:14:27] [INFO ] Implicit Places using invariants in 63 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/174 places, 60/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/174 places, 60/230 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03 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:(LEQ s21 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 8323 reset in 205 ms.
Stack based approach found an accepted trace after 37708 steps with 3129 reset with depth 5 and stack size 5 in 82 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (F(p0)&&p1)) U G(p2))&&X(p3)&&F(p1)))'
Support contains 41 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 8 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:14:27] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:14:27] [INFO ] Implicit Places using invariants in 130 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p3), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ 1 s102), p1:(LEQ (ADD s113 s114 s115 s116 s117 s118 s119 s120 s121 s122) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04 finished in 613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((G(p0)&&X(p1)))||F(p2)))))'
Support contains 41 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 142 place count 113 transition count 130
Applied a total of 142 rules in 25 ms. Remains 113 /174 variables (removed 61) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 113 cols
[2022-05-21 07:14:28] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 07:14:28] [INFO ] Implicit Places using invariants in 72 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/174 places, 130/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 102 transition count 120
Applied a total of 20 rules in 7 ms. Remains 102 /112 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 102 cols
[2022-05-21 07:14:28] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:14:28] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 120 rows 102 cols
[2022-05-21 07:14:28] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-21 07:14:28] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/174 places, 120/230 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/174 places, 120/230 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) s71), p2:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], 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 2546 reset in 360 ms.
Product exploration explored 100000 steps with 2546 reset in 348 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 p2 p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 41 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 102 cols
[2022-05-21 07:14:30] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:14:30] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 120 rows 102 cols
[2022-05-21 07:14:30] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:30] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-05-21 07:14:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 120 rows 102 cols
[2022-05-21 07:14:30] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:14:30] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 120/120 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 p2 p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2528 reset in 321 ms.
Product exploration explored 100000 steps with 2541 reset in 347 ms.
Built C files in :
/tmp/ltsmin16114386215449821905
[2022-05-21 07:14:32] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2022-05-21 07:14:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:32] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2022-05-21 07:14:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:32] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2022-05-21 07:14:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:14:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16114386215449821905
Running compilation step : cd /tmp/ltsmin16114386215449821905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 380 ms.
Running link step : cd /tmp/ltsmin16114386215449821905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16114386215449821905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4252724465658638281.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-05 finished in 4754 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(!p0)))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:14:32] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:14:32] [INFO ] Implicit Places using invariants in 128 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, p0, (NOT p0), false, p0, false, false]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s113 s114 s115 s116 s117 s118 s119 s120 s121 s122) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51))], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-06 finished in 408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((false U !X(G(p0))))) U p1))'
Support contains 32 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:14:33] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:14:33] [INFO ] Implicit Places using invariants in 160 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=1, aps=[p0:(LEQ 1 (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)), p1:(LEQ (ADD s0 s1) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3595 reset in 247 ms.
Product exploration explored 100000 steps with 3580 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 137 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:34] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2022-05-21 07:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:35] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-21 07:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:14:35] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2022-05-21 07:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:35] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-21 07:14:35] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-21 07:14:35] [INFO ] Added : 21 causal constraints over 5 iterations in 108 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:35] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:14:35] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:35] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:14:35] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:35] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:36] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 176 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:37] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2022-05-21 07:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:37] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-05-21 07:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:14:37] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2022-05-21 07:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:37] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-05-21 07:14:37] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-21 07:14:38] [INFO ] Added : 21 causal constraints over 5 iterations in 136 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 199 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 3610 reset in 428 ms.
Product exploration explored 100000 steps with 3619 reset in 271 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 153 transition count 210
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-05-21 07:14:39] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:39] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:14:39] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 210/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Product exploration explored 100000 steps with 3582 reset in 425 ms.
Product exploration explored 100000 steps with 3602 reset in 465 ms.
Built C files in :
/tmp/ltsmin10155707590718496166
[2022-05-21 07:14:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10155707590718496166
Running compilation step : cd /tmp/ltsmin10155707590718496166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin10155707590718496166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10155707590718496166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4575445202806766484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:55] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:55] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:55] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:56] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:14:56] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:14:56] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin17389001532832743739
[2022-05-21 07:14:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17389001532832743739
Running compilation step : cd /tmp/ltsmin17389001532832743739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin17389001532832743739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17389001532832743739;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased733227948272302103.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:15:11] [INFO ] Flatten gal took : 17 ms
[2022-05-21 07:15:11] [INFO ] Flatten gal took : 17 ms
[2022-05-21 07:15:11] [INFO ] Time to serialize gal into /tmp/LTL7004315124297792976.gal : 4 ms
[2022-05-21 07:15:11] [INFO ] Time to serialize properties into /tmp/LTL8529339676593247179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7004315124297792976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8529339676593247179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7004315...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(!(X(G("(((((ControlRoomDispatch_0+ControlRoomDispatch_1)+(ControlRoomDispatch_2+ControlRoomDispatch_3))+((ControlRoomDispatch_...588
Formula 0 simplified : !(XX!XG"(((((ControlRoomDispatch_0+ControlRoomDispatch_1)+(ControlRoomDispatch_2+ControlRoomDispatch_3))+((ControlRoomDispatch_4+Con...576
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 07:15:26] [INFO ] Flatten gal took : 29 ms
[2022-05-21 07:15:26] [INFO ] Applying decomposition
[2022-05-21 07:15:26] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3847821811112876589.txt' '-o' '/tmp/graph3847821811112876589.bin' '-w' '/tmp/graph3847821811112876589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3847821811112876589.bin' '-l' '-1' '-v' '-w' '/tmp/graph3847821811112876589.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:15:26] [INFO ] Decomposing Gal with order
[2022-05-21 07:15:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:15:26] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-21 07:15:26] [INFO ] Flatten gal took : 98 ms
[2022-05-21 07:15:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 11 ms.
[2022-05-21 07:15:27] [INFO ] Time to serialize gal into /tmp/LTL16035417867522287212.gal : 21 ms
[2022-05-21 07:15:27] [INFO ] Time to serialize properties into /tmp/LTL2488513016369547085.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16035417867522287212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2488513016369547085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1603541...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(!(X(G("(((((gu19.ControlRoomDispatch_0+gu19.ControlRoomDispatch_1)+(gu19.ControlRoomDispatch_2+gu19.ControlRoomDispatch_3))+((...726
Formula 0 simplified : !(XX!XG"(((((gu19.ControlRoomDispatch_0+gu19.ControlRoomDispatch_1)+(gu19.ControlRoomDispatch_2+gu19.ControlRoomDispatch_3))+((gu19....714
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14030476703587169528
[2022-05-21 07:15:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14030476703587169528
Running compilation step : cd /tmp/ltsmin14030476703587169528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin14030476703587169528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14030476703587169528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((false U !X([]((LTLAPp0==true)))))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 finished in 83977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(p1 U p2)))))'
Support contains 90 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:15:57] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:15:57] [INFO ] Implicit Places using invariants in 128 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 (ADD s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172)), p2:(AND (LEQ (ADD s92 s93 s94 s95 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(((G(F(p1))||!p1)&&!p0))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 203 place count 82 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 224 place count 71 transition count 80
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 61 transition count 70
Applied a total of 244 rules in 23 ms. Remains 61 /174 variables (removed 113) and now considering 70/230 (removed 160) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:57] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:15:57] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:57] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:15:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-21 07:15:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:57] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-21 07:15:57] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/174 places, 70/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/174 places, 70/230 transitions.
Stuttering acceptance computed with spot in 125 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60)), p1:(GT (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 ...], 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 9078 reset in 286 ms.
Product exploration explored 100000 steps with 9140 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 448 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 30 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:15:59] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:15:59] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-21 07:15:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:15:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:00] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 70/70 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 (NOT p1)), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 17 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 495 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9144 reset in 309 ms.
Product exploration explored 100000 steps with 9109 reset in 336 ms.
Built C files in :
/tmp/ltsmin12095614707803511719
[2022-05-21 07:16:02] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2022-05-21 07:16:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:02] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2022-05-21 07:16:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:02] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2022-05-21 07:16:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12095614707803511719
Running compilation step : cd /tmp/ltsmin12095614707803511719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin12095614707803511719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12095614707803511719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6125127399743647387.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:16:17] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:17] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:16:17] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-21 07:16:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-21 07:16:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-05-21 07:16:17] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:17] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 70/70 transitions.
Built C files in :
/tmp/ltsmin14201630673139374825
[2022-05-21 07:16:17] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2022-05-21 07:16:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:17] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2022-05-21 07:16:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:17] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2022-05-21 07:16:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:16:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14201630673139374825
Running compilation step : cd /tmp/ltsmin14201630673139374825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin14201630673139374825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14201630673139374825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12952123001949387227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:16:32] [INFO ] Flatten gal took : 6 ms
[2022-05-21 07:16:32] [INFO ] Flatten gal took : 5 ms
[2022-05-21 07:16:32] [INFO ] Time to serialize gal into /tmp/LTL5506603182856915885.gal : 2 ms
[2022-05-21 07:16:32] [INFO ] Time to serialize properties into /tmp/LTL16500957443346577083.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5506603182856915885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16500957443346577083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5506603...267
Read 1 LTL properties
Checking formula 0 : !(((G("(((((ClientsTimeout_0+ClientsTimeout_1)+(ClientsTimeout_2+ClientsTimeout_3))+((ClientsTimeout_4+ClientsTimeout_5)+(ClientsTimeo...1522
Formula 0 simplified : !(G"(((((ClientsTimeout_0+ClientsTimeout_1)+(ClientsTimeout_2+ClientsTimeout_3))+((ClientsTimeout_4+ClientsTimeout_5)+(ClientsTimeou...1509
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
643 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,6.45719,114012,1,0,67,286186,50,29,29662,493327,180
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-09 finished in 42146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:16:39] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:16:39] [INFO ] Implicit Places using invariants in 129 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101))], 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 26724 reset in 408 ms.
Product exploration explored 100000 steps with 26680 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:16:41] [INFO ] Computed 22 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-11 finished in 1717 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 33 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:16:41] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:16:41] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:16:41] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:16:41] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:16:41] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:16:41] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT (ADD s114 s115 s116 s117 s118 s119 s120 s121 s122 s123) (ADD s0 s1)), p0:(OR (GT (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 315 ms.
Product exploration explored 100000 steps with 33333 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13 finished in 1454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((F((X(X(p0)) U p0)) U p1) U p0))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:16:42] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:16:43] [INFO ] Implicit Places using invariants in 206 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, p0, p0, p0, p0, p1, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(LEQ (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) (ADD s103 s104 s105 s106 s107 s108 s109 s110 s111 s112)), p1:(LEQ 2 (ADD s113 s114 s115 s116 s117 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((false U !X(G(p0))))) U p1))'
Found a CL insensitive property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07
Stuttering acceptance computed with spot in 142 ms :[p0, (NOT p1), (OR (NOT p1) p0), p0]
Support contains 32 out of 174 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 144 transition count 200
Applied a total of 60 rules in 15 ms. Remains 144 /174 variables (removed 30) and now considering 200/230 (removed 30) transitions.
// Phase 1: matrix 200 rows 144 cols
[2022-05-21 07:16:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:16:43] [INFO ] Implicit Places using invariants in 240 ms returned [102, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 142/174 places, 200/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/174 places, 200/230 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=1, aps=[p0:(LEQ 1 (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)), p1:(LEQ (ADD s0 s1) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3575 reset in 407 ms.
Product exploration explored 100000 steps with 3576 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:45] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:45] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-05-21 07:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:46] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-21 07:16:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:16:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2022-05-21 07:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:46] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-05-21 07:16:46] [INFO ] Computed and/alt/rep : 190/290/190 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-21 07:16:46] [INFO ] Added : 29 causal constraints over 7 iterations in 203 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 32 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 200/200 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:46] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:46] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:46] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-21 07:16:47] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:47] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-21 07:16:47] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 180 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:48] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:48] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-05-21 07:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:48] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-21 07:16:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:16:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-05-21 07:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:48] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-21 07:16:48] [INFO ] Computed and/alt/rep : 190/290/190 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-21 07:16:49] [INFO ] Added : 29 causal constraints over 7 iterations in 169 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 189 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 3599 reset in 239 ms.
Product exploration explored 100000 steps with 3595 reset in 255 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Support contains 32 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2022-05-21 07:16:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:16:50] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:16:50] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 200/200 transitions.
Product exploration explored 100000 steps with 3592 reset in 294 ms.
Product exploration explored 100000 steps with 3628 reset in 312 ms.
Built C files in :
/tmp/ltsmin480121591238619330
[2022-05-21 07:16:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin480121591238619330
Running compilation step : cd /tmp/ltsmin480121591238619330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 528 ms.
Running link step : cd /tmp/ltsmin480121591238619330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin480121591238619330;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5834093279150912958.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 200/200 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:17:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:17:06] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:17:06] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-21 07:17:06] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 142 cols
[2022-05-21 07:17:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:17:06] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin17406489444264620268
[2022-05-21 07:17:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17406489444264620268
Running compilation step : cd /tmp/ltsmin17406489444264620268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 455 ms.
Running link step : cd /tmp/ltsmin17406489444264620268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17406489444264620268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18012379292880191666.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:17:21] [INFO ] Flatten gal took : 23 ms
[2022-05-21 07:17:21] [INFO ] Flatten gal took : 12 ms
[2022-05-21 07:17:21] [INFO ] Time to serialize gal into /tmp/LTL2164585844418758897.gal : 2 ms
[2022-05-21 07:17:21] [INFO ] Time to serialize properties into /tmp/LTL459942779878997058.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2164585844418758897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL459942779878997058.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2164585...265
Read 1 LTL properties
Checking formula 0 : !(((X(X(!(X(G("(((((ControlRoomDispatch_0+ControlRoomDispatch_1)+(ControlRoomDispatch_2+ControlRoomDispatch_3))+((ControlRoomDispatch_...588
Formula 0 simplified : !(XX!XG"(((((ControlRoomDispatch_0+ControlRoomDispatch_1)+(ControlRoomDispatch_2+ControlRoomDispatch_3))+((ControlRoomDispatch_4+Con...576
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
425 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,4.28573,120504,1,0,116,558349,26,38,3777,537386,216
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 finished in 43382 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-21 07:17:26] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12461190819130391082
[2022-05-21 07:17:26] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2022-05-21 07:17:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:17:26] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2022-05-21 07:17:26] [INFO ] Applying decomposition
[2022-05-21 07:17:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:17:26] [INFO ] Flatten gal took : 15 ms
[2022-05-21 07:17:26] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2022-05-21 07:17:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:17:26] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12461190819130391082
Running compilation step : cd /tmp/ltsmin12461190819130391082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16920454316061898873.txt' '-o' '/tmp/graph16920454316061898873.bin' '-w' '/tmp/graph16920454316061898873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16920454316061898873.bin' '-l' '-1' '-v' '-w' '/tmp/graph16920454316061898873.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:17:26] [INFO ] Decomposing Gal with order
[2022-05-21 07:17:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:17:26] [INFO ] Removed a total of 230 redundant transitions.
[2022-05-21 07:17:26] [INFO ] Flatten gal took : 65 ms
[2022-05-21 07:17:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 21 ms.
[2022-05-21 07:17:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality11752304026175210944.gal : 5 ms
[2022-05-21 07:17:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality6818654702999540796.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11752304026175210944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6818654702999540796.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !(((X(X(!(X(G("(((((gu16.ControlRoomDispatch_0+gu16.ControlRoomDispatch_1)+(gu16.ControlRoomDispatch_2+gu16.ControlRoomDispatch_3))+((...726
Formula 0 simplified : !(XX!XG"(((((gu16.ControlRoomDispatch_0+gu16.ControlRoomDispatch_1)+(gu16.ControlRoomDispatch_2+gu16.ControlRoomDispatch_3))+((gu16....714
Compilation finished in 660 ms.
Running link step : cd /tmp/ltsmin12461190819130391082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12461190819130391082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((false U !X([]((LTLAPp0==true)))))) U (LTLAPp1==true))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
21231 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,212.364,2220220,1,0,107,1.26191e+07,16,34,2845,8.00292e+06,50
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 745308 ms.
BK_STOP 1653117965533
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="UtilityControlRoom-COL-Z2T3N10"
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-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z2T3N10, 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 r276-smll-165307352900035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N10.tgz
mv UtilityControlRoom-COL-Z2T3N10 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 ;