About the Execution of ITS-Tools for StigmergyCommit-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16194.027 | 3600000.00 | 12592056.00 | 4386.70 | F?T??T?FTFFFFT?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872500164.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 StigmergyCommit-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 9.5K May 30 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 30 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 30 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 30 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K May 30 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 12:20 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 StigmergyCommit-PT-06b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654786806931
Running Version 202205111006
[2022-06-09 15:00:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-06-09 15:00:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:00:09] [INFO ] Load time of PNML (sax parser for PT used): 785 ms
[2022-06-09 15:00:09] [INFO ] Transformed 2140 places.
[2022-06-09 15:00:09] [INFO ] Transformed 6760 transitions.
[2022-06-09 15:00:09] [INFO ] Found NUPN structural information;
[2022-06-09 15:00:09] [INFO ] Parsed PT model containing 2140 places and 6760 transitions in 1028 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-06b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Discarding 171 places :
Symmetric choice reduction at 0 with 171 rule applications. Total rules 171 place count 1969 transition count 6589
Iterating global reduction 0 with 171 rules applied. Total rules applied 342 place count 1969 transition count 6589
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 447 place count 1864 transition count 6484
Iterating global reduction 0 with 105 rules applied. Total rules applied 552 place count 1864 transition count 6484
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 613 place count 1803 transition count 6423
Iterating global reduction 0 with 61 rules applied. Total rules applied 674 place count 1803 transition count 6423
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 728 place count 1749 transition count 6369
Iterating global reduction 0 with 54 rules applied. Total rules applied 782 place count 1749 transition count 6369
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 829 place count 1702 transition count 6322
Iterating global reduction 0 with 47 rules applied. Total rules applied 876 place count 1702 transition count 6322
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 923 place count 1655 transition count 6275
Iterating global reduction 0 with 47 rules applied. Total rules applied 970 place count 1655 transition count 6275
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 1017 place count 1608 transition count 6228
Iterating global reduction 0 with 47 rules applied. Total rules applied 1064 place count 1608 transition count 6228
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 1111 place count 1561 transition count 6181
Iterating global reduction 0 with 47 rules applied. Total rules applied 1158 place count 1561 transition count 6181
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1198 place count 1521 transition count 6141
Iterating global reduction 0 with 40 rules applied. Total rules applied 1238 place count 1521 transition count 6141
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 1271 place count 1488 transition count 6108
Iterating global reduction 0 with 33 rules applied. Total rules applied 1304 place count 1488 transition count 6108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1311 place count 1488 transition count 6101
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1323 place count 1476 transition count 6089
Iterating global reduction 1 with 12 rules applied. Total rules applied 1335 place count 1476 transition count 6089
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 1347 place count 1464 transition count 6077
Iterating global reduction 1 with 12 rules applied. Total rules applied 1359 place count 1464 transition count 6077
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1365 place count 1458 transition count 6071
Iterating global reduction 1 with 6 rules applied. Total rules applied 1371 place count 1458 transition count 6071
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1377 place count 1452 transition count 6065
Iterating global reduction 1 with 6 rules applied. Total rules applied 1383 place count 1452 transition count 6065
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1389 place count 1446 transition count 6059
Iterating global reduction 1 with 6 rules applied. Total rules applied 1395 place count 1446 transition count 6059
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1401 place count 1440 transition count 6053
Iterating global reduction 1 with 6 rules applied. Total rules applied 1407 place count 1440 transition count 6053
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1413 place count 1434 transition count 6047
Iterating global reduction 1 with 6 rules applied. Total rules applied 1419 place count 1434 transition count 6047
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1425 place count 1428 transition count 6041
Iterating global reduction 1 with 6 rules applied. Total rules applied 1431 place count 1428 transition count 6041
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1436 place count 1423 transition count 6036
Iterating global reduction 1 with 5 rules applied. Total rules applied 1441 place count 1423 transition count 6036
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1445 place count 1419 transition count 6032
Iterating global reduction 1 with 4 rules applied. Total rules applied 1449 place count 1419 transition count 6032
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1453 place count 1415 transition count 6028
Iterating global reduction 1 with 4 rules applied. Total rules applied 1457 place count 1415 transition count 6028
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1461 place count 1411 transition count 6024
Iterating global reduction 1 with 4 rules applied. Total rules applied 1465 place count 1411 transition count 6024
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1469 place count 1411 transition count 6020
Applied a total of 1469 rules in 3845 ms. Remains 1411 /2140 variables (removed 729) and now considering 6020/6760 (removed 740) transitions.
// Phase 1: matrix 6020 rows 1411 cols
[2022-06-09 15:00:14] [INFO ] Computed 8 place invariants in 162 ms
[2022-06-09 15:00:15] [INFO ] Implicit Places using invariants in 1265 ms returned []
// Phase 1: matrix 6020 rows 1411 cols
[2022-06-09 15:00:15] [INFO ] Computed 8 place invariants in 122 ms
[2022-06-09 15:00:17] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
// Phase 1: matrix 6020 rows 1411 cols
[2022-06-09 15:00:17] [INFO ] Computed 8 place invariants in 102 ms
[2022-06-09 15:00:23] [INFO ] Dead Transitions using invariants and state equation in 6445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1411/2140 places, 6020/6760 transitions.
Finished structural reductions, in 1 iterations. Remains : 1411/2140 places, 6020/6760 transitions.
Support contains 47 out of 1411 places after structural reductions.
[2022-06-09 15:00:25] [INFO ] Flatten gal took : 993 ms
[2022-06-09 15:00:25] [INFO ] Flatten gal took : 564 ms
[2022-06-09 15:00:27] [INFO ] Input system was already deterministic with 6020 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 6020 rows 1411 cols
[2022-06-09 15:00:28] [INFO ] Computed 8 place invariants in 90 ms
[2022-06-09 15:00:30] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2022-06-09 15:00:33] [INFO ] After 2903ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2022-06-09 15:00:33] [INFO ] After 3323ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:20
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-06-09 15:00:34] [INFO ] After 4585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:20
[2022-06-09 15:00:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 15:00:41] [INFO ] After 6138ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2022-06-09 15:00:45] [INFO ] Deduced a trap composed of 300 places in 2694 ms of which 2 ms to minimize.
[2022-06-09 15:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3150 ms
[2022-06-09 15:00:51] [INFO ] Deduced a trap composed of 297 places in 2824 ms of which 3 ms to minimize.
[2022-06-09 15:00:54] [INFO ] Deduced a trap composed of 301 places in 2529 ms of which 3 ms to minimize.
[2022-06-09 15:00:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6028 ms
[2022-06-09 15:00:57] [INFO ] After 21947ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 1750 ms.
[2022-06-09 15:00:59] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 18 different solutions.
Parikh walk visited 13 properties in 480 ms.
Support contains 12 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1392 edges and 1411 vertex of which 118 / 1411 are part of one of the 21 SCC in 12 ms
Free SCC test removed 97 places
Drop transitions removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Graph (complete) has 2567 edges and 1314 vertex of which 1307 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.65 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 974 transitions
Trivial Post-agglo rules discarded 974 transitions
Performed 974 trivial Post agglomeration. Transition count delta: 974
Iterating post reduction 0 with 981 rules applied. Total rules applied 983 place count 1307 transition count 4908
Reduce places removed 974 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 995 rules applied. Total rules applied 1978 place count 333 transition count 4887
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1985 place count 326 transition count 4887
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1985 place count 326 transition count 4803
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 2153 place count 242 transition count 4803
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2154 place count 242 transition count 4802
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2254 place count 192 transition count 4752
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2267 place count 192 transition count 4739
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 2302 place count 157 transition count 2639
Iterating global reduction 5 with 35 rules applied. Total rules applied 2337 place count 157 transition count 2639
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2351 place count 157 transition count 2625
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2371 place count 137 transition count 2605
Iterating global reduction 6 with 20 rules applied. Total rules applied 2391 place count 137 transition count 2605
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2405 place count 123 transition count 2591
Iterating global reduction 6 with 14 rules applied. Total rules applied 2419 place count 123 transition count 2591
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2426 place count 123 transition count 2584
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2442 place count 115 transition count 2576
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2448 place count 112 transition count 2584
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2449 place count 112 transition count 2583
Free-agglomeration rule applied 47 times.
Iterating global reduction 7 with 47 rules applied. Total rules applied 2496 place count 112 transition count 2536
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 7 with 112 rules applied. Total rules applied 2608 place count 65 transition count 2471
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2615 place count 58 transition count 2464
Iterating global reduction 8 with 7 rules applied. Total rules applied 2622 place count 58 transition count 2464
Drop transitions removed 1813 transitions
Redundant transition composition rules discarded 1813 transitions
Iterating global reduction 8 with 1813 rules applied. Total rules applied 4435 place count 58 transition count 651
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4437 place count 57 transition count 650
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4441 place count 55 transition count 668
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4442 place count 55 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4443 place count 54 transition count 667
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 4450 place count 54 transition count 667
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4454 place count 54 transition count 663
Applied a total of 4454 rules in 3400 ms. Remains 54 /1411 variables (removed 1357) and now considering 663/6020 (removed 5357) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/1411 places, 663/6020 transitions.
Finished random walk after 450 steps, including 0 resets, run visited all 6 properties in 34 ms. (steps per millisecond=13 )
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 287 stabilizing places and 301 stable transitions
FORMULA StigmergyCommit-PT-06b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((p0 U p1) U p2))))'
Support contains 11 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1396 edges and 1411 vertex of which 118 / 1411 are part of one of the 21 SCC in 5 ms
Free SCC test removed 97 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 965 transitions
Trivial Post-agglo rules discarded 965 transitions
Performed 965 trivial Post agglomeration. Transition count delta: 965
Iterating post reduction 0 with 965 rules applied. Total rules applied 966 place count 1313 transition count 4944
Reduce places removed 965 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 988 rules applied. Total rules applied 1954 place count 348 transition count 4921
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1962 place count 340 transition count 4921
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1962 place count 340 transition count 4847
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2110 place count 266 transition count 4847
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2118 place count 258 transition count 4839
Iterating global reduction 3 with 8 rules applied. Total rules applied 2126 place count 258 transition count 4839
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2128 place count 256 transition count 4837
Iterating global reduction 3 with 2 rules applied. Total rules applied 2130 place count 256 transition count 4837
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2131 place count 255 transition count 4836
Iterating global reduction 3 with 1 rules applied. Total rules applied 2132 place count 255 transition count 4836
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2133 place count 254 transition count 4835
Iterating global reduction 3 with 1 rules applied. Total rules applied 2134 place count 254 transition count 4835
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2244 place count 199 transition count 4780
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 2278 place count 165 transition count 2688
Iterating global reduction 3 with 34 rules applied. Total rules applied 2312 place count 165 transition count 2688
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2326 place count 165 transition count 2674
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 2346 place count 145 transition count 2648
Iterating global reduction 4 with 20 rules applied. Total rules applied 2366 place count 145 transition count 2648
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 2386 place count 125 transition count 2622
Iterating global reduction 4 with 20 rules applied. Total rules applied 2406 place count 125 transition count 2622
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2414 place count 125 transition count 2614
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 2438 place count 113 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2439 place count 112 transition count 2605
Iterating global reduction 5 with 1 rules applied. Total rules applied 2440 place count 112 transition count 2605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2441 place count 112 transition count 2604
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 2449 place count 112 transition count 2596
Applied a total of 2449 rules in 1450 ms. Remains 112 /1411 variables (removed 1299) and now considering 2596/6020 (removed 3424) transitions.
[2022-06-09 15:01:04] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:05] [INFO ] Computed 2 place invariants in 42 ms
[2022-06-09 15:01:05] [INFO ] Implicit Places using invariants in 616 ms returned []
[2022-06-09 15:01:05] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:05] [INFO ] Computed 2 place invariants in 52 ms
[2022-06-09 15:01:06] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:07] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 2895 ms to find 0 implicit places.
[2022-06-09 15:01:08] [INFO ] Redundant transitions in 339 ms returned []
[2022-06-09 15:01:08] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:08] [INFO ] Computed 2 place invariants in 42 ms
[2022-06-09 15:01:10] [INFO ] Dead Transitions using invariants and state equation in 2282 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1411 places, 2596/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/1411 places, 2596/6020 transitions.
Stuttering acceptance computed with spot in 478 ms :[p2, p2, (AND p1 p2)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s5 1) (EQ s23 1) (EQ s38 1) (EQ s52 1) (EQ s70 1) (EQ s85 1) (EQ s100 1)) (EQ s61 1)), p2:(EQ s19 1), p0:(AND (EQ s7 1) (EQ s23 1) (EQ s38...], nbAcceptance=2, 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 7593 reset in 943 ms.
Product exploration explored 100000 steps with 7628 reset in 729 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[p2, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 756 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 157326 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 157326 steps, saw 46984 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :2
Running SMT prover for 4 properties.
[2022-06-09 15:01:17] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:17] [INFO ] Computed 2 place invariants in 32 ms
[2022-06-09 15:01:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:01:17] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-09 15:01:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:01:18] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-09 15:01:18] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:19] [INFO ] After 869ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-09 15:01:20] [INFO ] Deduced a trap composed of 26 places in 1275 ms of which 1 ms to minimize.
[2022-06-09 15:01:22] [INFO ] Deduced a trap composed of 25 places in 1275 ms of which 1 ms to minimize.
[2022-06-09 15:01:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2746 ms
[2022-06-09 15:01:22] [INFO ] After 3875ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2022-06-09 15:01:22] [INFO ] After 5156ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 2596/2596 transitions.
Graph (complete) has 723 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 111 transition count 2579
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 104 transition count 2572
Free-agglomeration rule applied 44 times.
Iterating global reduction 1 with 44 rules applied. Total rules applied 75 place count 104 transition count 2528
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 69 rules applied. Total rules applied 144 place count 59 transition count 2504
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 151 place count 52 transition count 2504
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 158 place count 45 transition count 2497
Iterating global reduction 3 with 7 rules applied. Total rules applied 165 place count 45 transition count 2497
Performed 15 Post agglomeration using F-continuation condition with reduction of 1082 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 195 place count 30 transition count 1400
Drop transitions removed 7 transitions
Ensure Unique test removed 810 transitions
Reduce isomorphic transitions removed 817 transitions.
Iterating post reduction 3 with 817 rules applied. Total rules applied 1012 place count 30 transition count 583
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1015 place count 27 transition count 580
Iterating global reduction 4 with 3 rules applied. Total rules applied 1018 place count 27 transition count 580
Performed 6 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1030 place count 21 transition count 460
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1042 place count 21 transition count 448
Drop transitions removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 5 with 144 rules applied. Total rules applied 1186 place count 21 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1187 place count 20 transition count 303
Applied a total of 1187 rules in 441 ms. Remains 20 /112 variables (removed 92) and now considering 303/2596 (removed 2293) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/112 places, 303/2596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 303 rows 20 cols
[2022-06-09 15:01:23] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-09 15:01:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-09 15:01:23] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:01:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-06-09 15:01:23] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:01:23] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-06-09 15:01:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 95 ms
[2022-06-09 15:01:23] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 15:01:23] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (OR p1 p2)), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 571 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 2596/2596 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
[2022-06-09 15:01:24] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:24] [INFO ] Computed 2 place invariants in 31 ms
[2022-06-09 15:01:24] [INFO ] Implicit Places using invariants in 509 ms returned []
[2022-06-09 15:01:24] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:24] [INFO ] Computed 2 place invariants in 32 ms
[2022-06-09 15:01:25] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:26] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
[2022-06-09 15:01:26] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:26] [INFO ] Computed 2 place invariants in 29 ms
[2022-06-09 15:01:28] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 2596/2596 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2)))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 555 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Incomplete random walk after 10000 steps, including 762 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 149658 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 149658 steps, saw 45507 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :2
Running SMT prover for 5 properties.
[2022-06-09 15:01:33] [INFO ] Flow matrix only has 2587 transitions (discarded 9 similar events)
// Phase 1: matrix 2587 rows 112 cols
[2022-06-09 15:01:33] [INFO ] Computed 2 place invariants in 30 ms
[2022-06-09 15:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 15:01:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-09 15:01:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:01:34] [INFO ] After 1063ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-06-09 15:01:34] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:35] [INFO ] After 947ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-06-09 15:01:35] [INFO ] After 1395ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2022-06-09 15:01:36] [INFO ] After 2819ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 2596/2596 transitions.
Graph (complete) has 723 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 111 transition count 2579
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 104 transition count 2572
Free-agglomeration rule applied 44 times.
Iterating global reduction 1 with 44 rules applied. Total rules applied 75 place count 104 transition count 2528
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 69 rules applied. Total rules applied 144 place count 59 transition count 2504
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 151 place count 52 transition count 2504
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 158 place count 45 transition count 2497
Iterating global reduction 3 with 7 rules applied. Total rules applied 165 place count 45 transition count 2497
Performed 15 Post agglomeration using F-continuation condition with reduction of 1082 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 195 place count 30 transition count 1400
Drop transitions removed 7 transitions
Ensure Unique test removed 810 transitions
Reduce isomorphic transitions removed 817 transitions.
Iterating post reduction 3 with 817 rules applied. Total rules applied 1012 place count 30 transition count 583
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1015 place count 27 transition count 580
Iterating global reduction 4 with 3 rules applied. Total rules applied 1018 place count 27 transition count 580
Performed 6 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1030 place count 21 transition count 460
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1042 place count 21 transition count 448
Drop transitions removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 5 with 144 rules applied. Total rules applied 1186 place count 21 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1187 place count 20 transition count 303
Applied a total of 1187 rules in 410 ms. Remains 20 /112 variables (removed 92) and now considering 303/2596 (removed 2293) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/112 places, 303/2596 transitions.
Finished random walk after 178 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=35 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 (NOT p2)))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p1))), (F p1), (F (OR (AND p0 p2) (AND (NOT p2) p1))), (F (OR p2 p1))]
Knowledge based reduction with 14 factoid took 844 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[p2, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 152 ms :[p2, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 118 ms :[p2, p2, (AND p1 p2)]
Product exploration explored 100000 steps with 7573 reset in 744 ms.
Stuttering criterion allowed to conclude after 38472 steps with 2944 reset in 347 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-00 finished in 35476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(p0)))))'
Support contains 7 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1402 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 969 transitions
Trivial Post-agglo rules discarded 969 transitions
Performed 969 trivial Post agglomeration. Transition count delta: 969
Iterating post reduction 0 with 969 rules applied. Total rules applied 970 place count 1312 transition count 4938
Reduce places removed 969 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 994 rules applied. Total rules applied 1964 place count 343 transition count 4913
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1973 place count 334 transition count 4913
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1973 place count 334 transition count 4840
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2119 place count 261 transition count 4840
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2127 place count 253 transition count 4832
Iterating global reduction 3 with 8 rules applied. Total rules applied 2135 place count 253 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2137 place count 251 transition count 4830
Iterating global reduction 3 with 2 rules applied. Total rules applied 2139 place count 251 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2140 place count 250 transition count 4829
Iterating global reduction 3 with 1 rules applied. Total rules applied 2141 place count 250 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2142 place count 249 transition count 4828
Iterating global reduction 3 with 1 rules applied. Total rules applied 2143 place count 249 transition count 4828
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2253 place count 194 transition count 4773
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 2290 place count 157 transition count 1464
Iterating global reduction 3 with 37 rules applied. Total rules applied 2327 place count 157 transition count 1464
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 2343 place count 157 transition count 1448
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2364 place count 136 transition count 1420
Iterating global reduction 4 with 21 rules applied. Total rules applied 2385 place count 136 transition count 1420
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2406 place count 115 transition count 1392
Iterating global reduction 4 with 21 rules applied. Total rules applied 2427 place count 115 transition count 1392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2435 place count 115 transition count 1384
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2457 place count 104 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2458 place count 103 transition count 1377
Iterating global reduction 5 with 1 rules applied. Total rules applied 2459 place count 103 transition count 1377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2460 place count 103 transition count 1376
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2467 place count 103 transition count 1369
Applied a total of 2467 rules in 874 ms. Remains 103 /1411 variables (removed 1308) and now considering 1369/6020 (removed 4651) transitions.
[2022-06-09 15:01:39] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:39] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:40] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-06-09 15:01:40] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:40] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:40] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:41] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2022-06-09 15:01:41] [INFO ] Redundant transitions in 36 ms returned []
[2022-06-09 15:01:41] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:41] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:42] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/1411 places, 1369/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/1411 places, 1369/6020 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s21 0) (EQ s34 0) (EQ s48 0) (EQ s63 0) (EQ s78 0) (EQ s94 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7694 reset in 632 ms.
Product exploration explored 100000 steps with 7703 reset in 545 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 775 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609273 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609273 steps, saw 109849 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:01:46] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:46] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:46] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:01:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:01:47] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:01:47] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:47] [INFO ] After 421ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:01:47] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2022-06-09 15:01:47] [INFO ] After 1288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1369/1369 transitions.
Graph (complete) has 684 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 102 transition count 1353
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 95 transition count 1346
Free-agglomeration rule applied 41 times.
Iterating global reduction 1 with 41 rules applied. Total rules applied 71 place count 95 transition count 1305
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 82 rules applied. Total rules applied 153 place count 53 transition count 1265
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 46 transition count 1265
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 167 place count 39 transition count 1258
Iterating global reduction 3 with 7 rules applied. Total rules applied 174 place count 39 transition count 1258
Performed 14 Post agglomeration using F-continuation condition with reduction of 661 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 202 place count 25 transition count 583
Drop transitions removed 7 transitions
Ensure Unique test removed 304 transitions
Reduce isomorphic transitions removed 311 transitions.
Iterating post reduction 3 with 311 rules applied. Total rules applied 513 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 22 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 533 place count 15 transition count 142
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 540 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 541 place count 14 transition count 134
Applied a total of 541 rules in 184 ms. Remains 14 /103 variables (removed 89) and now considering 134/1369 (removed 1235) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/103 places, 134/1369 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 1369/1369 transitions.
Applied a total of 0 rules in 71 ms. Remains 103 /103 variables (removed 0) and now considering 1369/1369 (removed 0) transitions.
[2022-06-09 15:01:48] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:48] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 15:01:48] [INFO ] Implicit Places using invariants in 353 ms returned []
[2022-06-09 15:01:48] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:48] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:49] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:49] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2022-06-09 15:01:50] [INFO ] Redundant transitions in 129 ms returned []
[2022-06-09 15:01:50] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:50] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:01:51] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1369/1369 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 782 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 611710 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 611710 steps, saw 110394 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:01:54] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:01:54] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 15:01:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:01:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 15:01:55] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:01:55] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:01:55] [INFO ] After 490ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:01:55] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2022-06-09 15:01:55] [INFO ] After 1335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1369/1369 transitions.
Graph (complete) has 684 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 102 transition count 1353
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 95 transition count 1346
Free-agglomeration rule applied 41 times.
Iterating global reduction 1 with 41 rules applied. Total rules applied 71 place count 95 transition count 1305
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 82 rules applied. Total rules applied 153 place count 53 transition count 1265
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 46 transition count 1265
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 167 place count 39 transition count 1258
Iterating global reduction 3 with 7 rules applied. Total rules applied 174 place count 39 transition count 1258
Performed 14 Post agglomeration using F-continuation condition with reduction of 661 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 202 place count 25 transition count 583
Drop transitions removed 7 transitions
Ensure Unique test removed 304 transitions
Reduce isomorphic transitions removed 311 transitions.
Iterating post reduction 3 with 311 rules applied. Total rules applied 513 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 22 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 533 place count 15 transition count 142
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 540 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 541 place count 14 transition count 134
Applied a total of 541 rules in 151 ms. Remains 14 /103 variables (removed 89) and now considering 134/1369 (removed 1235) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/103 places, 134/1369 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7692 reset in 430 ms.
Product exploration explored 100000 steps with 7636 reset in 459 ms.
Built C files in :
/tmp/ltsmin9685874588016011733
[2022-06-09 15:01:57] [INFO ] Computing symmetric may disable matrix : 1369 transitions.
[2022-06-09 15:01:57] [INFO ] Computation of Complete disable matrix. took 263 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:01:57] [INFO ] Computing symmetric may enable matrix : 1369 transitions.
[2022-06-09 15:01:57] [INFO ] Computation of Complete enable matrix. took 118 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:01:58] [INFO ] Computing Do-Not-Accords matrix : 1369 transitions.
[2022-06-09 15:01:58] [INFO ] Computation of Completed DNA matrix. took 157 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:01:58] [INFO ] Built C files in 1143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9685874588016011733
Running compilation step : cd /tmp/ltsmin9685874588016011733;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9685874588016011733;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9685874588016011733;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 1369/1369 transitions.
Applied a total of 0 rules in 71 ms. Remains 103 /103 variables (removed 0) and now considering 1369/1369 (removed 0) transitions.
[2022-06-09 15:02:01] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:02:01] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 15:02:01] [INFO ] Implicit Places using invariants in 345 ms returned []
[2022-06-09 15:02:01] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:02:01] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:02:02] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:02:02] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2022-06-09 15:02:03] [INFO ] Redundant transitions in 43 ms returned []
[2022-06-09 15:02:03] [INFO ] Flow matrix only has 1361 transitions (discarded 8 similar events)
// Phase 1: matrix 1361 rows 103 cols
[2022-06-09 15:02:03] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 15:02:03] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1369/1369 transitions.
Built C files in :
/tmp/ltsmin7294196316150999900
[2022-06-09 15:02:03] [INFO ] Computing symmetric may disable matrix : 1369 transitions.
[2022-06-09 15:02:04] [INFO ] Computation of Complete disable matrix. took 227 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:02:04] [INFO ] Computing symmetric may enable matrix : 1369 transitions.
[2022-06-09 15:02:04] [INFO ] Computation of Complete enable matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:02:04] [INFO ] Computing Do-Not-Accords matrix : 1369 transitions.
[2022-06-09 15:02:04] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:02:04] [INFO ] Built C files in 862ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7294196316150999900
Running compilation step : cd /tmp/ltsmin7294196316150999900;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7294196316150999900;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7294196316150999900;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:02:09] [INFO ] Flatten gal took : 271 ms
[2022-06-09 15:02:09] [INFO ] Flatten gal took : 241 ms
[2022-06-09 15:02:09] [INFO ] Time to serialize gal into /tmp/LTL2785405058584807348.gal : 133 ms
[2022-06-09 15:02:09] [INFO ] Time to serialize properties into /tmp/LTL16937034971560011060.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/LTL2785405058584807348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16937034971560011060.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/LTL2785405...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G(X("((((p97==0)||(p421==0))||((p701==0)||(p1025==0)))||(((p1327==0)||(p1629==0))||(p1954==0)))"))))))
Formula 0 simplified : !GFGX"((((p97==0)||(p421==0))||((p701==0)||(p1025==0)))||(((p1327==0)||(p1629==0))||(p1954==0)))"
Detected timeout of ITS tools.
[2022-06-09 15:02:24] [INFO ] Flatten gal took : 180 ms
[2022-06-09 15:02:24] [INFO ] Applying decomposition
[2022-06-09 15:02:24] [INFO ] Flatten gal took : 177 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/graph6606383208385176370.txt' '-o' '/tmp/graph6606383208385176370.bin' '-w' '/tmp/graph6606383208385176370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6606383208385176370.bin' '-l' '-1' '-v' '-w' '/tmp/graph6606383208385176370.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:02:25] [INFO ] Decomposing Gal with order
[2022-06-09 15:02:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:02:26] [INFO ] Removed a total of 8640 redundant transitions.
[2022-06-09 15:02:26] [INFO ] Flatten gal took : 602 ms
[2022-06-09 15:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 96 ms.
[2022-06-09 15:02:26] [INFO ] Time to serialize gal into /tmp/LTL1389059860796190911.gal : 14 ms
[2022-06-09 15:02:26] [INFO ] Time to serialize properties into /tmp/LTL12055101831142850213.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/LTL1389059860796190911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12055101831142850213.ltl' '-c' '-stutter-deadlock'
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/LTL1389059...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G(X("((((i1.u2.p97==0)||(i1.u4.p421==0))||((i1.u8.p701==0)||(i0.i1.u11.p1025==0)))||(((i1.u14.p1327==0)||(i1.u16.p1629==0))||(i...179
Formula 0 simplified : !GFGX"((((i1.u2.p97==0)||(i1.u4.p421==0))||((i1.u8.p701==0)||(i0.i1.u11.p1025==0)))||(((i1.u14.p1327==0)||(i1.u16.p1629==0))||(i1.u1...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8733292111670146549
[2022-06-09 15:02:41] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8733292111670146549
Running compilation step : cd /tmp/ltsmin8733292111670146549;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8733292111670146549;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8733292111670146549;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-01 finished in 65660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(!(X(F(p0)) U p1))))||X(p2)||p1)))'
Support contains 21 out of 1411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1407 transition count 6016
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1407 transition count 6016
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1403 transition count 6012
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1403 transition count 6012
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1399 transition count 6008
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1399 transition count 6008
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1399 transition count 6007
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 1396 transition count 6004
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 1396 transition count 6004
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 1396 transition count 6003
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 1394 transition count 6001
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 1394 transition count 6001
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 1392 transition count 5999
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1392 transition count 5999
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1390 transition count 5997
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1390 transition count 5997
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1388 transition count 5995
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1388 transition count 5995
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1386 transition count 5993
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1386 transition count 5993
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 1384 transition count 5991
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 1384 transition count 5991
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1382 transition count 5989
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 1372 transition count 5978
Applied a total of 81 rules in 2174 ms. Remains 1372 /1411 variables (removed 39) and now considering 5978/6020 (removed 42) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:02:46] [INFO ] Computed 8 place invariants in 86 ms
[2022-06-09 15:02:47] [INFO ] Implicit Places using invariants in 1166 ms returned []
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:02:48] [INFO ] Computed 8 place invariants in 86 ms
[2022-06-09 15:02:49] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 3178 ms to find 0 implicit places.
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:02:50] [INFO ] Computed 8 place invariants in 84 ms
[2022-06-09 15:02:55] [INFO ] Dead Transitions using invariants and state equation in 5395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1372/1411 places, 5978/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1372/1411 places, 5978/6020 transitions.
Stuttering acceptance computed with spot in 284 ms :[false, false, (AND p1 (NOT p2)), p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s217 1) (EQ s431 1) (EQ s624 1) (EQ s817 1) (EQ s1010 1) (EQ s1203 1)), p2:(AND (EQ s122 1) (EQ s315 1) (EQ s466 1) (EQ s659 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 783 reset in 530 ms.
Product exploration explored 100000 steps with 765 reset in 431 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 5 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 180 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 77093 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77093 steps, saw 20118 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:03:01] [INFO ] Computed 8 place invariants in 85 ms
[2022-06-09 15:03:01] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 15:03:04] [INFO ] After 2966ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:2
[2022-06-09 15:03:05] [INFO ] After 3750ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 352 ms.
[2022-06-09 15:03:05] [INFO ] After 4528ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:2
[2022-06-09 15:03:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 15:03:09] [INFO ] After 3468ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-06-09 15:03:11] [INFO ] After 4921ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 672 ms.
[2022-06-09 15:03:11] [INFO ] After 6014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 240 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=80 )
Parikh walk visited 4 properties in 41 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 5 states, 14 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 185 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 14 out of 1372 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1372/1372 places, 5978/5978 transitions.
Graph (trivial) has 1350 edges and 1372 vertex of which 119 / 1372 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 926 transitions
Trivial Post-agglo rules discarded 926 transitions
Performed 926 trivial Post agglomeration. Transition count delta: 926
Iterating post reduction 0 with 926 rules applied. Total rules applied 927 place count 1273 transition count 4939
Reduce places removed 926 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 947 rules applied. Total rules applied 1874 place count 347 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1881 place count 340 transition count 4918
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 1881 place count 340 transition count 4847
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 2023 place count 269 transition count 4847
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2029 place count 263 transition count 4841
Iterating global reduction 3 with 6 rules applied. Total rules applied 2035 place count 263 transition count 4841
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2145 place count 208 transition count 4786
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 2174 place count 179 transition count 4022
Iterating global reduction 3 with 29 rules applied. Total rules applied 2203 place count 179 transition count 4022
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2211 place count 179 transition count 4014
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2232 place count 158 transition count 3986
Iterating global reduction 4 with 21 rules applied. Total rules applied 2253 place count 158 transition count 3986
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2274 place count 137 transition count 3958
Iterating global reduction 4 with 21 rules applied. Total rules applied 2295 place count 137 transition count 3958
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2302 place count 137 transition count 3951
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2324 place count 126 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2325 place count 125 transition count 3944
Iterating global reduction 5 with 1 rules applied. Total rules applied 2326 place count 125 transition count 3944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2327 place count 125 transition count 3943
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2334 place count 125 transition count 3936
Applied a total of 2334 rules in 995 ms. Remains 125 /1372 variables (removed 1247) and now considering 3936/5978 (removed 2042) transitions.
[2022-06-09 15:03:13] [INFO ] Flow matrix only has 3928 transitions (discarded 8 similar events)
// Phase 1: matrix 3928 rows 125 cols
[2022-06-09 15:03:13] [INFO ] Computed 2 place invariants in 47 ms
[2022-06-09 15:03:14] [INFO ] Implicit Places using invariants in 624 ms returned []
[2022-06-09 15:03:14] [INFO ] Flow matrix only has 3928 transitions (discarded 8 similar events)
// Phase 1: matrix 3928 rows 125 cols
[2022-06-09 15:03:14] [INFO ] Computed 2 place invariants in 46 ms
[2022-06-09 15:03:14] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:03:16] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2022-06-09 15:03:16] [INFO ] Redundant transitions in 261 ms returned []
[2022-06-09 15:03:16] [INFO ] Flow matrix only has 3928 transitions (discarded 8 similar events)
// Phase 1: matrix 3928 rows 125 cols
[2022-06-09 15:03:16] [INFO ] Computed 2 place invariants in 45 ms
[2022-06-09 15:03:18] [INFO ] Dead Transitions using invariants and state equation in 2099 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/1372 places, 3936/5978 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/1372 places, 3936/5978 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 710 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 119413 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119413 steps, saw 38360 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 15:03:22] [INFO ] Flow matrix only has 3928 transitions (discarded 8 similar events)
// Phase 1: matrix 3928 rows 125 cols
[2022-06-09 15:03:22] [INFO ] Computed 2 place invariants in 45 ms
[2022-06-09 15:03:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 15:03:24] [INFO ] After 1381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-06-09 15:03:24] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:03:25] [INFO ] After 1291ms SMT Verify possible using 127 Read/Feed constraints in real domain returned unsat :0 sat :2 real:1
[2022-06-09 15:03:26] [INFO ] After 1635ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 201 ms.
[2022-06-09 15:03:26] [INFO ] After 3330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2022-06-09 15:03:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:03:27] [INFO ] After 1481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 15:03:29] [INFO ] After 1537ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 15:03:29] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 289 ms.
[2022-06-09 15:03:30] [INFO ] After 3881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 14 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 3936/3936 transitions.
Graph (complete) has 810 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 124 transition count 3913
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 30 place count 117 transition count 3913
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 115 transition count 2698
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 115 transition count 2698
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 115 transition count 2696
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 50 place count 108 transition count 2689
Free-agglomeration rule applied 47 times.
Iterating global reduction 3 with 47 rules applied. Total rules applied 97 place count 108 transition count 2642
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 88 rules applied. Total rules applied 185 place count 60 transition count 2602
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 192 place count 53 transition count 2602
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 199 place count 46 transition count 2595
Iterating global reduction 5 with 7 rules applied. Total rules applied 206 place count 46 transition count 2595
Performed 14 Post agglomeration using F-continuation condition with reduction of 1487 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 234 place count 32 transition count 1094
Drop transitions removed 6 transitions
Ensure Unique test removed 682 transitions
Reduce isomorphic transitions removed 688 transitions.
Iterating post reduction 5 with 688 rules applied. Total rules applied 922 place count 32 transition count 406
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 925 place count 29 transition count 403
Iterating global reduction 6 with 3 rules applied. Total rules applied 928 place count 29 transition count 403
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 942 place count 22 transition count 276
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 949 place count 22 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 950 place count 21 transition count 268
Applied a total of 950 rules in 436 ms. Remains 21 /125 variables (removed 104) and now considering 268/3936 (removed 3668) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/125 places, 268/3936 transitions.
Finished random walk after 7436 steps, including 854 resets, run visited all 3 properties in 34 ms. (steps per millisecond=218 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 490 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 186 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 7152 reset in 746 ms.
Product exploration explored 100000 steps with 7138 reset in 922 ms.
Built C files in :
/tmp/ltsmin2793677546586933575
[2022-06-09 15:03:33] [INFO ] Too many transitions (3936) to apply POR reductions. Disabling POR matrices.
[2022-06-09 15:03:33] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2793677546586933575
Running compilation step : cd /tmp/ltsmin2793677546586933575;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2793677546586933575;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2793677546586933575;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 14 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 3936/3936 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 125 transition count 3929
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 118 transition count 3929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 116 transition count 2714
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 116 transition count 2714
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 116 transition count 2712
Applied a total of 20 rules in 240 ms. Remains 116 /125 variables (removed 9) and now considering 2712/3936 (removed 1224) transitions.
[2022-06-09 15:03:36] [INFO ] Flow matrix only has 2704 transitions (discarded 8 similar events)
// Phase 1: matrix 2704 rows 116 cols
[2022-06-09 15:03:36] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-09 15:03:37] [INFO ] Implicit Places using invariants in 607 ms returned []
[2022-06-09 15:03:37] [INFO ] Flow matrix only has 2704 transitions (discarded 8 similar events)
// Phase 1: matrix 2704 rows 116 cols
[2022-06-09 15:03:37] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-09 15:03:37] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:03:39] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
[2022-06-09 15:03:39] [INFO ] Redundant transitions in 130 ms returned []
[2022-06-09 15:03:39] [INFO ] Flow matrix only has 2704 transitions (discarded 8 similar events)
// Phase 1: matrix 2704 rows 116 cols
[2022-06-09 15:03:39] [INFO ] Computed 2 place invariants in 34 ms
[2022-06-09 15:03:40] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/125 places, 2712/3936 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/125 places, 2712/3936 transitions.
Built C files in :
/tmp/ltsmin10248057462657531411
[2022-06-09 15:03:40] [INFO ] Too many transitions (2712) to apply POR reductions. Disabling POR matrices.
[2022-06-09 15:03:40] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10248057462657531411
Running compilation step : cd /tmp/ltsmin10248057462657531411;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10248057462657531411;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10248057462657531411;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:03:45] [INFO ] Flatten gal took : 714 ms
[2022-06-09 15:03:45] [INFO ] Flatten gal took : 536 ms
[2022-06-09 15:03:45] [INFO ] Time to serialize gal into /tmp/LTL17921471777670384434.gal : 95 ms
[2022-06-09 15:03:45] [INFO ] Time to serialize properties into /tmp/LTL15359157123636271039.ltl : 2 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/LTL17921471777670384434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15359157123636271039.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/LTL1792147...268
Read 1 LTL properties
Checking formula 0 : !((X(((G(X(F(!((X(F("((((p97==1)&&(p399==1))&&((p723==1)&&(p1048==1)))&&(((p1327==1)&&(p1629==1))&&(p1954==1)))")))U("((((p52==1)&&(p3...434
Formula 0 simplified : !X("((((p52==1)&&(p332==1))&&((p656==1)&&(p958==1)))&&(((p1260==1)&&(p1562==1))&&(p1864==1)))" | GXF!(XF"((((p97==1)&&(p399==1))&&((...412
Detected timeout of ITS tools.
[2022-06-09 15:04:01] [INFO ] Flatten gal took : 513 ms
[2022-06-09 15:04:01] [INFO ] Applying decomposition
[2022-06-09 15:04:01] [INFO ] Flatten gal took : 566 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/graph6300576088304738440.txt' '-o' '/tmp/graph6300576088304738440.bin' '-w' '/tmp/graph6300576088304738440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6300576088304738440.bin' '-l' '-1' '-v' '-w' '/tmp/graph6300576088304738440.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:04:03] [INFO ] Decomposing Gal with order
[2022-06-09 15:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:04:04] [INFO ] Removed a total of 26462 redundant transitions.
[2022-06-09 15:04:04] [INFO ] Flatten gal took : 876 ms
[2022-06-09 15:04:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 206 ms.
[2022-06-09 15:04:04] [INFO ] Time to serialize gal into /tmp/LTL12243424344093210861.gal : 11 ms
[2022-06-09 15:04:04] [INFO ] Time to serialize properties into /tmp/LTL2102144594129828088.ltl : 10 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/LTL12243424344093210861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2102144594129828088.ltl' '-c' '-stutter-deadlock'
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/LTL1224342...246
Read 1 LTL properties
Checking formula 0 : !((X(((G(X(F(!((X(F("((((i3.u2.p97==1)&&(i3.u4.p399==1))&&((u7.p723==1)&&(u10.p1048==1)))&&(((u14.p1327==1)&&(u16.p1629==1))&&(u20.p19...558
Formula 0 simplified : !X("((((u1.p52==1)&&(i3.u4.p332==1))&&((u7.p656==1)&&(u10.p958==1)))&&(((u14.p1260==1)&&(u16.p1562==1))&&(u20.p1864==1)))" | GXF!(XF...536
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14955886728795422553
[2022-06-09 15:04:19] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14955886728795422553
Running compilation step : cd /tmp/ltsmin14955886728795422553;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14955886728795422553;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14955886728795422553;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-03 finished in 98168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(X(X(G(p0)))))))))'
Support contains 7 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1402 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 969 transitions
Trivial Post-agglo rules discarded 969 transitions
Performed 969 trivial Post agglomeration. Transition count delta: 969
Iterating post reduction 0 with 969 rules applied. Total rules applied 970 place count 1312 transition count 4938
Reduce places removed 969 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 994 rules applied. Total rules applied 1964 place count 343 transition count 4913
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1973 place count 334 transition count 4913
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1973 place count 334 transition count 4840
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2119 place count 261 transition count 4840
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2127 place count 253 transition count 4832
Iterating global reduction 3 with 8 rules applied. Total rules applied 2135 place count 253 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2137 place count 251 transition count 4830
Iterating global reduction 3 with 2 rules applied. Total rules applied 2139 place count 251 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2140 place count 250 transition count 4829
Iterating global reduction 3 with 1 rules applied. Total rules applied 2141 place count 250 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2142 place count 249 transition count 4828
Iterating global reduction 3 with 1 rules applied. Total rules applied 2143 place count 249 transition count 4828
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2253 place count 194 transition count 4773
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2291 place count 156 transition count 1140
Iterating global reduction 3 with 38 rules applied. Total rules applied 2329 place count 156 transition count 1140
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2346 place count 156 transition count 1123
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2367 place count 135 transition count 1095
Iterating global reduction 4 with 21 rules applied. Total rules applied 2388 place count 135 transition count 1095
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2409 place count 114 transition count 1067
Iterating global reduction 4 with 21 rules applied. Total rules applied 2430 place count 114 transition count 1067
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2438 place count 114 transition count 1059
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2460 place count 103 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2461 place count 102 transition count 1052
Iterating global reduction 5 with 1 rules applied. Total rules applied 2462 place count 102 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2463 place count 102 transition count 1051
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2470 place count 102 transition count 1044
Applied a total of 2470 rules in 862 ms. Remains 102 /1411 variables (removed 1309) and now considering 1044/6020 (removed 4976) transitions.
[2022-06-09 15:04:23] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:23] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:23] [INFO ] Implicit Places using invariants in 302 ms returned []
[2022-06-09 15:04:23] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:23] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 15:04:24] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:04:24] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2022-06-09 15:04:24] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-09 15:04:24] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:24] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:25] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1411 places, 1044/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/1411 places, 1044/6020 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s19 0) (EQ s32 0) (EQ s46 0) (EQ s61 0) (EQ s77 0) (EQ s90 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7685 reset in 473 ms.
Product exploration explored 100000 steps with 7656 reset in 400 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 750 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 702186 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 702186 steps, saw 139869 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:04:29] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:29] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:29] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 15:04:30] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:04:30] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:04:30] [INFO ] After 344ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:04:30] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2022-06-09 15:04:30] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Graph (complete) has 670 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 101 transition count 1028
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 94 transition count 1021
Free-agglomeration rule applied 40 times.
Iterating global reduction 1 with 40 rules applied. Total rules applied 70 place count 94 transition count 981
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 53 transition count 957
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 142 place count 46 transition count 957
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 39 transition count 950
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 39 transition count 950
Performed 14 Post agglomeration using F-continuation condition with reduction of 536 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 184 place count 25 transition count 400
Drop transitions removed 7 transitions
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 128 rules applied. Total rules applied 312 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 22 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 332 place count 15 transition count 142
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 339 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 14 transition count 134
Applied a total of 340 rules in 120 ms. Remains 14 /102 variables (removed 88) and now considering 134/1044 (removed 910) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/102 places, 134/1044 transitions.
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Applied a total of 0 rules in 51 ms. Remains 102 /102 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2022-06-09 15:04:31] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:31] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:31] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-06-09 15:04:31] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:31] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:32] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:04:32] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2022-06-09 15:04:32] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 15:04:32] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:32] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:33] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 1044/1044 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 765 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 687503 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687503 steps, saw 138033 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:04:36] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:36] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:04:36] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:04:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:04:37] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:04:37] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:04:37] [INFO ] After 352ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:04:37] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-06-09 15:04:37] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Graph (complete) has 670 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 101 transition count 1028
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 94 transition count 1021
Free-agglomeration rule applied 40 times.
Iterating global reduction 1 with 40 rules applied. Total rules applied 70 place count 94 transition count 981
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 53 transition count 957
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 142 place count 46 transition count 957
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 39 transition count 950
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 39 transition count 950
Performed 14 Post agglomeration using F-continuation condition with reduction of 536 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 184 place count 25 transition count 400
Drop transitions removed 7 transitions
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 128 rules applied. Total rules applied 312 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 22 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 332 place count 15 transition count 142
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 339 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 14 transition count 134
Applied a total of 340 rules in 110 ms. Remains 14 /102 variables (removed 88) and now considering 134/1044 (removed 910) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/102 places, 134/1044 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7687 reset in 495 ms.
Product exploration explored 100000 steps with 7671 reset in 420 ms.
Built C files in :
/tmp/ltsmin5609851360607181812
[2022-06-09 15:04:39] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2022-06-09 15:04:39] [INFO ] Computation of Complete disable matrix. took 102 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:39] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2022-06-09 15:04:39] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:39] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2022-06-09 15:04:39] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:39] [INFO ] Built C files in 462ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5609851360607181812
Running compilation step : cd /tmp/ltsmin5609851360607181812;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5609851360607181812;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5609851360607181812;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Applied a total of 0 rules in 51 ms. Remains 102 /102 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2022-06-09 15:04:42] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:42] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 15:04:42] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-06-09 15:04:42] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:43] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 15:04:43] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:04:43] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2022-06-09 15:04:43] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 15:04:43] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:04:43] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 15:04:44] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 1044/1044 transitions.
Built C files in :
/tmp/ltsmin11903743758711481651
[2022-06-09 15:04:44] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2022-06-09 15:04:44] [INFO ] Computation of Complete disable matrix. took 104 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:44] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2022-06-09 15:04:44] [INFO ] Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:45] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2022-06-09 15:04:45] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:04:45] [INFO ] Built C files in 420ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11903743758711481651
Running compilation step : cd /tmp/ltsmin11903743758711481651;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11903743758711481651;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11903743758711481651;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:04:48] [INFO ] Flatten gal took : 239 ms
[2022-06-09 15:04:48] [INFO ] Flatten gal took : 117 ms
[2022-06-09 15:04:48] [INFO ] Time to serialize gal into /tmp/LTL2025361730712534484.gal : 11 ms
[2022-06-09 15:04:48] [INFO ] Time to serialize properties into /tmp/LTL17751544975135085943.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/LTL2025361730712534484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17751544975135085943.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/LTL2025361...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G(F(G(X(X(G("((((p52==0)||(p332==0))||((p634==0)||(p958==0)))||(((p1260==0)||(p1585==0))||(p1842==0)))"))))))))))
Formula 0 simplified : !FXGFGXXG"((((p52==0)||(p332==0))||((p634==0)||(p958==0)))||(((p1260==0)||(p1585==0))||(p1842==0)))"
Detected timeout of ITS tools.
[2022-06-09 15:05:04] [INFO ] Flatten gal took : 119 ms
[2022-06-09 15:05:04] [INFO ] Applying decomposition
[2022-06-09 15:05:04] [INFO ] Flatten gal took : 119 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/graph18426685128197734413.txt' '-o' '/tmp/graph18426685128197734413.bin' '-w' '/tmp/graph18426685128197734413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18426685128197734413.bin' '-l' '-1' '-v' '-w' '/tmp/graph18426685128197734413.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:05:04] [INFO ] Decomposing Gal with order
[2022-06-09 15:05:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:05:04] [INFO ] Removed a total of 6372 redundant transitions.
[2022-06-09 15:05:04] [INFO ] Flatten gal took : 172 ms
[2022-06-09 15:05:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 33 ms.
[2022-06-09 15:05:04] [INFO ] Time to serialize gal into /tmp/LTL12978152867597191622.gal : 5 ms
[2022-06-09 15:05:04] [INFO ] Time to serialize properties into /tmp/LTL5451837317989105415.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/LTL12978152867597191622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5451837317989105415.ltl' '-c' '-stutter-deadlock'
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/LTL1297815...246
Read 1 LTL properties
Checking formula 0 : !((F(X(G(F(G(X(X(G("((((i1.u2.p52==0)||(i1.u4.p332==0))||((i1.u7.p634==0)||(i0.u10.p958==0)))||(((i0.u14.p1260==0)||(i0.u16.p1585==0))...187
Formula 0 simplified : !FXGFGXXG"((((i1.u2.p52==0)||(i1.u4.p332==0))||((i1.u7.p634==0)||(i0.u10.p958==0)))||(((i0.u14.p1260==0)||(i0.u16.p1585==0))||(i0.u2...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16872039969668261383
[2022-06-09 15:05:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16872039969668261383
Running compilation step : cd /tmp/ltsmin16872039969668261383;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16872039969668261383;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16872039969668261383;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-04 finished in 60077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1408 transition count 6017
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1408 transition count 6017
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1405 transition count 6014
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1405 transition count 6014
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1402 transition count 6011
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1402 transition count 6011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1402 transition count 6010
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1400 transition count 6008
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1400 transition count 6008
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 1400 transition count 6007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1399 transition count 6006
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1399 transition count 6006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1398 transition count 6005
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1398 transition count 6005
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1397 transition count 6004
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1397 transition count 6004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 1396 transition count 6003
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 1396 transition count 6003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1395 transition count 6002
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1395 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 1394 transition count 6001
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 1394 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 1393 transition count 6000
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 1393 transition count 6000
Applied a total of 38 rules in 1600 ms. Remains 1393 /1411 variables (removed 18) and now considering 6000/6020 (removed 20) transitions.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:05:24] [INFO ] Computed 8 place invariants in 84 ms
[2022-06-09 15:05:26] [INFO ] Implicit Places using invariants in 1750 ms returned []
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:05:26] [INFO ] Computed 8 place invariants in 83 ms
[2022-06-09 15:05:28] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:05:28] [INFO ] Computed 8 place invariants in 83 ms
[2022-06-09 15:05:34] [INFO ] Dead Transitions using invariants and state equation in 5510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1393/1411 places, 6000/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1393/1411 places, 6000/6020 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s1305 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 770 reset in 461 ms.
Product exploration explored 100000 steps with 767 reset in 529 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 106417 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106417 steps, saw 26242 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:05:39] [INFO ] Computed 8 place invariants in 83 ms
[2022-06-09 15:05:39] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 15:05:41] [INFO ] After 2712ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 15:05:45] [INFO ] Deduced a trap composed of 297 places in 3561 ms of which 1 ms to minimize.
[2022-06-09 15:05:49] [INFO ] Deduced a trap composed of 297 places in 3396 ms of which 1 ms to minimize.
[2022-06-09 15:05:52] [INFO ] Deduced a trap composed of 302 places in 3225 ms of which 1 ms to minimize.
[2022-06-09 15:05:56] [INFO ] Deduced a trap composed of 297 places in 3091 ms of which 1 ms to minimize.
[2022-06-09 15:05:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 14486 ms
[2022-06-09 15:05:56] [INFO ] After 17332ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:05:56] [INFO ] After 17606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:05:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 15:05:59] [INFO ] After 2659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:06:03] [INFO ] Deduced a trap composed of 297 places in 3738 ms of which 1 ms to minimize.
[2022-06-09 15:06:06] [INFO ] Deduced a trap composed of 297 places in 3250 ms of which 1 ms to minimize.
[2022-06-09 15:06:10] [INFO ] Deduced a trap composed of 302 places in 3223 ms of which 2 ms to minimize.
[2022-06-09 15:06:13] [INFO ] Deduced a trap composed of 297 places in 2988 ms of which 2 ms to minimize.
[2022-06-09 15:06:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 14321 ms
[2022-06-09 15:06:13] [INFO ] After 17097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-06-09 15:06:14] [INFO ] After 17558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1393 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1393/1393 places, 6000/6000 transitions.
Graph (trivial) has 1388 edges and 1393 vertex of which 119 / 1393 are part of one of the 21 SCC in 0 ms
Free SCC test removed 98 places
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2543 edges and 1295 vertex of which 1288 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 974 transitions
Trivial Post-agglo rules discarded 974 transitions
Performed 974 trivial Post agglomeration. Transition count delta: 974
Iterating post reduction 0 with 981 rules applied. Total rules applied 983 place count 1288 transition count 4886
Reduce places removed 974 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 995 rules applied. Total rules applied 1978 place count 314 transition count 4865
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1985 place count 307 transition count 4865
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 1985 place count 307 transition count 4784
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 2147 place count 226 transition count 4784
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2148 place count 226 transition count 4783
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2248 place count 176 transition count 4733
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2262 place count 176 transition count 4719
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 2305 place count 133 transition count 559
Iterating global reduction 5 with 43 rules applied. Total rules applied 2348 place count 133 transition count 559
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2370 place count 133 transition count 537
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2391 place count 112 transition count 516
Iterating global reduction 6 with 21 rules applied. Total rules applied 2412 place count 112 transition count 516
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2426 place count 98 transition count 502
Iterating global reduction 6 with 14 rules applied. Total rules applied 2440 place count 98 transition count 502
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2447 place count 98 transition count 495
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2461 place count 91 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2467 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 2504 place count 88 transition count 459
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 166 rules applied. Total rules applied 2670 place count 51 transition count 330
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2677 place count 44 transition count 323
Iterating global reduction 8 with 7 rules applied. Total rules applied 2684 place count 44 transition count 323
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 8 with 133 rules applied. Total rules applied 2817 place count 44 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2819 place count 43 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2823 place count 41 transition count 207
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2826 place count 41 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2829 place count 38 transition count 204
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2834 place count 38 transition count 204
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2838 place count 38 transition count 200
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2840 place count 36 transition count 196
Iterating global reduction 9 with 2 rules applied. Total rules applied 2842 place count 36 transition count 196
Applied a total of 2842 rules in 512 ms. Remains 36 /1393 variables (removed 1357) and now considering 196/6000 (removed 5804) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/1393 places, 196/6000 transitions.
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=95 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1393/1393 places, 6000/6000 transitions.
Applied a total of 0 rules in 117 ms. Remains 1393 /1393 variables (removed 0) and now considering 6000/6000 (removed 0) transitions.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:06:15] [INFO ] Computed 8 place invariants in 83 ms
[2022-06-09 15:06:16] [INFO ] Implicit Places using invariants in 1715 ms returned []
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:06:16] [INFO ] Computed 8 place invariants in 85 ms
[2022-06-09 15:06:19] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 4416 ms to find 0 implicit places.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:06:19] [INFO ] Computed 8 place invariants in 84 ms
[2022-06-09 15:06:27] [INFO ] Dead Transitions using invariants and state equation in 7675 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1393/1393 places, 6000/6000 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110080 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110080 steps, saw 27079 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:06:30] [INFO ] Computed 8 place invariants in 82 ms
[2022-06-09 15:06:30] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 15:06:33] [INFO ] After 2767ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 15:06:37] [INFO ] Deduced a trap composed of 297 places in 3638 ms of which 1 ms to minimize.
[2022-06-09 15:06:41] [INFO ] Deduced a trap composed of 297 places in 3428 ms of which 2 ms to minimize.
[2022-06-09 15:06:44] [INFO ] Deduced a trap composed of 302 places in 3281 ms of which 1 ms to minimize.
[2022-06-09 15:06:48] [INFO ] Deduced a trap composed of 297 places in 3047 ms of which 1 ms to minimize.
[2022-06-09 15:06:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 14590 ms
[2022-06-09 15:06:48] [INFO ] After 17489ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:06:48] [INFO ] After 17759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:06:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 15:06:51] [INFO ] After 2548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:06:54] [INFO ] Deduced a trap composed of 297 places in 3479 ms of which 1 ms to minimize.
[2022-06-09 15:06:58] [INFO ] Deduced a trap composed of 297 places in 3382 ms of which 1 ms to minimize.
[2022-06-09 15:07:02] [INFO ] Deduced a trap composed of 302 places in 3216 ms of which 2 ms to minimize.
[2022-06-09 15:07:05] [INFO ] Deduced a trap composed of 297 places in 3050 ms of which 4 ms to minimize.
[2022-06-09 15:07:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 14230 ms
[2022-06-09 15:07:05] [INFO ] After 16898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-06-09 15:07:05] [INFO ] After 17349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1393 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1393/1393 places, 6000/6000 transitions.
Graph (trivial) has 1388 edges and 1393 vertex of which 119 / 1393 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2543 edges and 1295 vertex of which 1288 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 974 transitions
Trivial Post-agglo rules discarded 974 transitions
Performed 974 trivial Post agglomeration. Transition count delta: 974
Iterating post reduction 0 with 981 rules applied. Total rules applied 983 place count 1288 transition count 4886
Reduce places removed 974 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 995 rules applied. Total rules applied 1978 place count 314 transition count 4865
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1985 place count 307 transition count 4865
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 1985 place count 307 transition count 4784
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 2147 place count 226 transition count 4784
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2148 place count 226 transition count 4783
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2248 place count 176 transition count 4733
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2262 place count 176 transition count 4719
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 2305 place count 133 transition count 559
Iterating global reduction 5 with 43 rules applied. Total rules applied 2348 place count 133 transition count 559
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2370 place count 133 transition count 537
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2391 place count 112 transition count 516
Iterating global reduction 6 with 21 rules applied. Total rules applied 2412 place count 112 transition count 516
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2426 place count 98 transition count 502
Iterating global reduction 6 with 14 rules applied. Total rules applied 2440 place count 98 transition count 502
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2447 place count 98 transition count 495
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2461 place count 91 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2467 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 2504 place count 88 transition count 459
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 166 rules applied. Total rules applied 2670 place count 51 transition count 330
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2677 place count 44 transition count 323
Iterating global reduction 8 with 7 rules applied. Total rules applied 2684 place count 44 transition count 323
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 8 with 133 rules applied. Total rules applied 2817 place count 44 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2819 place count 43 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2823 place count 41 transition count 207
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2826 place count 41 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2829 place count 38 transition count 204
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2834 place count 38 transition count 204
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2838 place count 38 transition count 200
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2840 place count 36 transition count 196
Iterating global reduction 9 with 2 rules applied. Total rules applied 2842 place count 36 transition count 196
Applied a total of 2842 rules in 517 ms. Remains 36 /1393 variables (removed 1357) and now considering 196/6000 (removed 5804) transitions.
Finished structural reductions, in 1 iterations. Remains : 36/1393 places, 196/6000 transitions.
Finished random walk after 343 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=85 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 775 reset in 374 ms.
Product exploration explored 100000 steps with 776 reset in 386 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1393/1393 places, 6000/6000 transitions.
Graph (trivial) has 1388 edges and 1393 vertex of which 119 / 1393 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 960 rules applied. Total rules applied 961 place count 1295 transition count 5888
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 975 place count 1295 transition count 5874
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 975 place count 1295 transition count 5881
Deduced a syphon composed of 1019 places in 4 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1034 place count 1295 transition count 5881
Discarding 865 places :
Symmetric choice reduction at 2 with 865 rule applications. Total rules 1899 place count 430 transition count 5016
Deduced a syphon composed of 160 places in 4 ms
Iterating global reduction 2 with 865 rules applied. Total rules applied 2764 place count 430 transition count 5016
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 2842 place count 430 transition count 5038
Discarding 128 places :
Symmetric choice reduction at 2 with 128 rule applications. Total rules 2970 place count 302 transition count 786
Deduced a syphon composed of 153 places in 1 ms
Iterating global reduction 2 with 128 rules applied. Total rules applied 3098 place count 302 transition count 786
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 3127 place count 302 transition count 757
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 3184 place count 245 transition count 693
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 3 with 57 rules applied. Total rules applied 3241 place count 245 transition count 693
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 3262 place count 224 transition count 672
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 3283 place count 224 transition count 672
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3290 place count 224 transition count 665
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 3304 place count 210 transition count 651
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 3318 place count 210 transition count 651
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 3328 place count 210 transition count 701
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 3345 place count 193 transition count 667
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 3362 place count 193 transition count 667
Deduced a syphon composed of 96 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3376 place count 193 transition count 653
Deduced a syphon composed of 96 places in 0 ms
Applied a total of 3376 rules in 1123 ms. Remains 193 /1393 variables (removed 1200) and now considering 653/6000 (removed 5347) transitions.
[2022-06-09 15:07:09] [INFO ] Redundant transitions in 8 ms returned []
[2022-06-09 15:07:09] [INFO ] Flow matrix only has 645 transitions (discarded 8 similar events)
// Phase 1: matrix 645 rows 193 cols
[2022-06-09 15:07:09] [INFO ] Computed 2 place invariants in 22 ms
[2022-06-09 15:07:09] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/1393 places, 653/6000 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/1393 places, 653/6000 transitions.
Product exploration explored 100000 steps with 5851 reset in 721 ms.
Product exploration explored 100000 steps with 5816 reset in 669 ms.
Built C files in :
/tmp/ltsmin5036726586960044316
[2022-06-09 15:07:11] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5036726586960044316
Running compilation step : cd /tmp/ltsmin5036726586960044316;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5036726586960044316;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5036726586960044316;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1393/1393 places, 6000/6000 transitions.
Applied a total of 0 rules in 99 ms. Remains 1393 /1393 variables (removed 0) and now considering 6000/6000 (removed 0) transitions.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:07:14] [INFO ] Computed 8 place invariants in 102 ms
[2022-06-09 15:07:16] [INFO ] Implicit Places using invariants in 1825 ms returned []
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:07:16] [INFO ] Computed 8 place invariants in 84 ms
[2022-06-09 15:07:19] [INFO ] Implicit Places using invariants and state equation in 2853 ms returned []
Implicit Place search using SMT with State Equation took 4681 ms to find 0 implicit places.
// Phase 1: matrix 6000 rows 1393 cols
[2022-06-09 15:07:19] [INFO ] Computed 8 place invariants in 88 ms
[2022-06-09 15:07:26] [INFO ] Dead Transitions using invariants and state equation in 7476 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1393/1393 places, 6000/6000 transitions.
Built C files in :
/tmp/ltsmin15860075961182306998
[2022-06-09 15:07:26] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15860075961182306998
Running compilation step : cd /tmp/ltsmin15860075961182306998;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15860075961182306998;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15860075961182306998;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:07:30] [INFO ] Flatten gal took : 473 ms
[2022-06-09 15:07:31] [INFO ] Flatten gal took : 545 ms
[2022-06-09 15:07:31] [INFO ] Time to serialize gal into /tmp/LTL17750190752566044787.gal : 51 ms
[2022-06-09 15:07:31] [INFO ] Time to serialize properties into /tmp/LTL6262187269915028968.ltl : 2 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/LTL17750190752566044787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6262187269915028968.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/LTL1775019...267
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p2002!=1)")))))
Formula 0 simplified : !XXG"(p2002!=1)"
Detected timeout of ITS tools.
[2022-06-09 15:07:46] [INFO ] Flatten gal took : 454 ms
[2022-06-09 15:07:46] [INFO ] Applying decomposition
[2022-06-09 15:07:47] [INFO ] Flatten gal took : 465 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/graph15511106860586386606.txt' '-o' '/tmp/graph15511106860586386606.bin' '-w' '/tmp/graph15511106860586386606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15511106860586386606.bin' '-l' '-1' '-v' '-w' '/tmp/graph15511106860586386606.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:07:48] [INFO ] Decomposing Gal with order
[2022-06-09 15:07:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:07:50] [INFO ] Removed a total of 31738 redundant transitions.
[2022-06-09 15:07:50] [INFO ] Flatten gal took : 964 ms
[2022-06-09 15:07:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 253 ms.
[2022-06-09 15:07:50] [INFO ] Time to serialize gal into /tmp/LTL10277594353134391276.gal : 78 ms
[2022-06-09 15:07:50] [INFO ] Time to serialize properties into /tmp/LTL248391331313794992.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/LTL10277594353134391276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL248391331313794992.ltl' '-c' '-stutter-deadlock'
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/LTL1027759...245
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i22.i2.i20.u545.p2002!=1)")))))
Formula 0 simplified : !XXG"(i22.i2.i20.u545.p2002!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4386811792721070771
[2022-06-09 15:08:05] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4386811792721070771
Running compilation step : cd /tmp/ltsmin4386811792721070771;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4386811792721070771;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4386811792721070771;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-06 finished in 166075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1407 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 973 transitions
Trivial Post-agglo rules discarded 973 transitions
Performed 973 trivial Post agglomeration. Transition count delta: 973
Iterating post reduction 0 with 973 rules applied. Total rules applied 974 place count 1312 transition count 4934
Reduce places removed 973 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 998 rules applied. Total rules applied 1972 place count 339 transition count 4909
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1982 place count 330 transition count 4908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1983 place count 329 transition count 4908
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 1983 place count 329 transition count 4835
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2129 place count 256 transition count 4835
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 2137 place count 248 transition count 4827
Iterating global reduction 4 with 8 rules applied. Total rules applied 2145 place count 248 transition count 4827
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2147 place count 246 transition count 4825
Iterating global reduction 4 with 2 rules applied. Total rules applied 2149 place count 246 transition count 4825
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2150 place count 245 transition count 4824
Iterating global reduction 4 with 1 rules applied. Total rules applied 2151 place count 245 transition count 4824
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2152 place count 244 transition count 4823
Iterating global reduction 4 with 1 rules applied. Total rules applied 2153 place count 244 transition count 4823
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 2263 place count 189 transition count 4768
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 2305 place count 147 transition count 615
Iterating global reduction 4 with 42 rules applied. Total rules applied 2347 place count 147 transition count 615
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2368 place count 147 transition count 594
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2389 place count 126 transition count 566
Iterating global reduction 5 with 21 rules applied. Total rules applied 2410 place count 126 transition count 566
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2431 place count 105 transition count 538
Iterating global reduction 5 with 21 rules applied. Total rules applied 2452 place count 105 transition count 538
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2460 place count 105 transition count 530
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2482 place count 94 transition count 537
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2483 place count 93 transition count 523
Iterating global reduction 6 with 1 rules applied. Total rules applied 2484 place count 93 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2485 place count 93 transition count 522
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 2492 place count 93 transition count 515
Applied a total of 2492 rules in 746 ms. Remains 93 /1411 variables (removed 1318) and now considering 515/6020 (removed 5505) transitions.
[2022-06-09 15:08:09] [INFO ] Flow matrix only has 507 transitions (discarded 8 similar events)
// Phase 1: matrix 507 rows 93 cols
[2022-06-09 15:08:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:08:09] [INFO ] Implicit Places using invariants in 215 ms returned []
[2022-06-09 15:08:09] [INFO ] Flow matrix only has 507 transitions (discarded 8 similar events)
// Phase 1: matrix 507 rows 93 cols
[2022-06-09 15:08:09] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:08:10] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:08:10] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2022-06-09 15:08:10] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-09 15:08:10] [INFO ] Flow matrix only has 507 transitions (discarded 8 similar events)
// Phase 1: matrix 507 rows 93 cols
[2022-06-09 15:08:10] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:08:10] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/1411 places, 515/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/1411 places, 515/6020 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-09 finished in 1942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(F(p0)))))'
Support contains 12 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1395 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 960 transitions
Trivial Post-agglo rules discarded 960 transitions
Performed 960 trivial Post agglomeration. Transition count delta: 960
Iterating post reduction 0 with 960 rules applied. Total rules applied 961 place count 1312 transition count 4947
Reduce places removed 960 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 985 rules applied. Total rules applied 1946 place count 352 transition count 4922
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 1957 place count 343 transition count 4920
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1959 place count 341 transition count 4920
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 1959 place count 341 transition count 4847
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2105 place count 268 transition count 4847
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 2113 place count 260 transition count 4839
Iterating global reduction 4 with 8 rules applied. Total rules applied 2121 place count 260 transition count 4839
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2123 place count 258 transition count 4837
Iterating global reduction 4 with 2 rules applied. Total rules applied 2125 place count 258 transition count 4837
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2126 place count 257 transition count 4836
Iterating global reduction 4 with 1 rules applied. Total rules applied 2127 place count 257 transition count 4836
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2128 place count 256 transition count 4835
Iterating global reduction 4 with 1 rules applied. Total rules applied 2129 place count 256 transition count 4835
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 2239 place count 201 transition count 4780
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 2276 place count 164 transition count 1471
Iterating global reduction 4 with 37 rules applied. Total rules applied 2313 place count 164 transition count 1471
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2329 place count 164 transition count 1455
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2350 place count 143 transition count 1427
Iterating global reduction 5 with 21 rules applied. Total rules applied 2371 place count 143 transition count 1427
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2392 place count 122 transition count 1399
Iterating global reduction 5 with 21 rules applied. Total rules applied 2413 place count 122 transition count 1399
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2421 place count 122 transition count 1391
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2443 place count 111 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2444 place count 110 transition count 1384
Iterating global reduction 6 with 1 rules applied. Total rules applied 2445 place count 110 transition count 1384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2446 place count 110 transition count 1383
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 2453 place count 110 transition count 1376
Applied a total of 2453 rules in 870 ms. Remains 110 /1411 variables (removed 1301) and now considering 1376/6020 (removed 4644) transitions.
[2022-06-09 15:08:11] [INFO ] Flow matrix only has 1368 transitions (discarded 8 similar events)
// Phase 1: matrix 1368 rows 110 cols
[2022-06-09 15:08:11] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:08:12] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-06-09 15:08:12] [INFO ] Flow matrix only has 1368 transitions (discarded 8 similar events)
// Phase 1: matrix 1368 rows 110 cols
[2022-06-09 15:08:12] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:08:12] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:08:13] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
[2022-06-09 15:08:13] [INFO ] Redundant transitions in 38 ms returned []
[2022-06-09 15:08:13] [INFO ] Flow matrix only has 1368 transitions (discarded 8 similar events)
// Phase 1: matrix 1368 rows 110 cols
[2022-06-09 15:08:13] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 15:08:14] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1411 places, 1376/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/1411 places, 1376/6020 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s21 1) (EQ s34 1) (EQ s51 1) (EQ s71 1) (EQ s84 1) (EQ s101 1)) (AND (EQ s67 0) (EQ s63 0) (OR (EQ s7 0) (EQ s21 0) (EQ s36 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2993 steps with 223 reset in 17 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-10 finished in 3773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X((X(p1)||p0))) U p2)))))'
Support contains 9 out of 1411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1407 transition count 6016
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1407 transition count 6016
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1403 transition count 6012
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1403 transition count 6012
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1399 transition count 6008
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1399 transition count 6008
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1399 transition count 6007
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 1396 transition count 6004
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 1396 transition count 6004
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 1396 transition count 6003
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 1394 transition count 6001
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 1394 transition count 6001
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 1392 transition count 5999
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1392 transition count 5999
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1390 transition count 5997
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1390 transition count 5997
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1388 transition count 5995
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1388 transition count 5995
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1386 transition count 5993
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1386 transition count 5993
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 1384 transition count 5991
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 1384 transition count 5991
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1382 transition count 5989
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1382 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1381 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1381 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1380 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1380 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1379 transition count 5986
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1379 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1378 transition count 5985
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1378 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1377 transition count 5984
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1376 transition count 5983
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1375 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1374 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1373 transition count 5980
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1372 transition count 5979
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 1372 transition count 5978
Applied a total of 81 rules in 2410 ms. Remains 1372 /1411 variables (removed 39) and now considering 5978/6020 (removed 42) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:08:17] [INFO ] Computed 8 place invariants in 118 ms
[2022-06-09 15:08:18] [INFO ] Implicit Places using invariants in 1618 ms returned []
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:08:18] [INFO ] Computed 8 place invariants in 85 ms
[2022-06-09 15:08:21] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 4209 ms to find 0 implicit places.
// Phase 1: matrix 5978 rows 1372 cols
[2022-06-09 15:08:21] [INFO ] Computed 8 place invariants in 86 ms
[2022-06-09 15:08:27] [INFO ] Dead Transitions using invariants and state equation in 6171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1372/1411 places, 5978/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1372/1411 places, 5978/6020 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s182 1) (EQ s1371 1)), p0:(OR (AND (EQ s80 1) (EQ s273 1) (EQ s466 1) (EQ s680 1) (EQ s852 1) (EQ s1066 1) (EQ s1259 1)) (AND (EQ s182 1) (EQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-11 finished in 13153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 7 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1402 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 969 transitions
Trivial Post-agglo rules discarded 969 transitions
Performed 969 trivial Post agglomeration. Transition count delta: 969
Iterating post reduction 0 with 969 rules applied. Total rules applied 970 place count 1312 transition count 4938
Reduce places removed 969 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 994 rules applied. Total rules applied 1964 place count 343 transition count 4913
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1973 place count 334 transition count 4913
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1973 place count 334 transition count 4840
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2119 place count 261 transition count 4840
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2127 place count 253 transition count 4832
Iterating global reduction 3 with 8 rules applied. Total rules applied 2135 place count 253 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2137 place count 251 transition count 4830
Iterating global reduction 3 with 2 rules applied. Total rules applied 2139 place count 251 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2140 place count 250 transition count 4829
Iterating global reduction 3 with 1 rules applied. Total rules applied 2141 place count 250 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2142 place count 249 transition count 4828
Iterating global reduction 3 with 1 rules applied. Total rules applied 2143 place count 249 transition count 4828
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2253 place count 194 transition count 4773
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2291 place count 156 transition count 1140
Iterating global reduction 3 with 38 rules applied. Total rules applied 2329 place count 156 transition count 1140
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2346 place count 156 transition count 1123
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2367 place count 135 transition count 1095
Iterating global reduction 4 with 21 rules applied. Total rules applied 2388 place count 135 transition count 1095
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2409 place count 114 transition count 1067
Iterating global reduction 4 with 21 rules applied. Total rules applied 2430 place count 114 transition count 1067
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2438 place count 114 transition count 1059
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2460 place count 103 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2461 place count 102 transition count 1052
Iterating global reduction 5 with 1 rules applied. Total rules applied 2462 place count 102 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2463 place count 102 transition count 1051
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2470 place count 102 transition count 1044
Applied a total of 2470 rules in 695 ms. Remains 102 /1411 variables (removed 1309) and now considering 1044/6020 (removed 4976) transitions.
[2022-06-09 15:08:28] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:08:28] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 15:08:28] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-06-09 15:08:28] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:08:28] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:08:29] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:08:29] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2022-06-09 15:08:29] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 15:08:29] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:08:29] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 15:08:30] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1411 places, 1044/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/1411 places, 1044/6020 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s22 0) (EQ s34 0) (EQ s48 0) (EQ s63 0) (EQ s78 0) (EQ s92 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7668 reset in 388 ms.
Product exploration explored 100000 steps with 7658 reset in 437 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 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 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 768 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 755767 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755767 steps, saw 133501 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:08:34] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:08:34] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 15:08:34] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:08:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:08:35] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:08:35] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:08:35] [INFO ] After 325ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:08:35] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-06-09 15:08:35] [INFO ] After 1089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Graph (complete) has 670 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 101 transition count 1028
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 94 transition count 1021
Free-agglomeration rule applied 40 times.
Iterating global reduction 1 with 40 rules applied. Total rules applied 70 place count 94 transition count 981
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 53 transition count 957
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 142 place count 46 transition count 957
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 39 transition count 950
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 39 transition count 950
Performed 14 Post agglomeration using F-continuation condition with reduction of 528 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 184 place count 25 transition count 408
Drop transitions removed 7 transitions
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 3 with 136 rules applied. Total rules applied 320 place count 25 transition count 272
Renaming transitions due to excessive name length > 1024 char.
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 323 place count 22 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 326 place count 22 transition count 269
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 340 place count 15 transition count 142
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 347 place count 15 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 14 transition count 134
Applied a total of 348 rules in 143 ms. Remains 14 /102 variables (removed 88) and now considering 134/1044 (removed 910) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/102 places, 134/1044 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA StigmergyCommit-PT-06b-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLFireability-12 finished in 8185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(X(p0))||G(p1))))))'
Support contains 8 out of 1411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1408 transition count 6017
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1408 transition count 6017
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1405 transition count 6014
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1405 transition count 6014
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1402 transition count 6011
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1402 transition count 6011
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 1399 transition count 6008
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 1399 transition count 6008
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1399 transition count 6007
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1397 transition count 6005
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1397 transition count 6005
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1395 transition count 6003
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1395 transition count 6003
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1393 transition count 6001
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1393 transition count 6001
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1391 transition count 5999
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1391 transition count 5999
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1389 transition count 5997
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1389 transition count 5997
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1387 transition count 5995
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1387 transition count 5995
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1385 transition count 5993
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1385 transition count 5993
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1384 transition count 5992
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1384 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1383 transition count 5991
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1383 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1382 transition count 5990
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1382 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1381 transition count 5989
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1381 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1380 transition count 5988
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1380 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1379 transition count 5987
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1379 transition count 5987
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1378 transition count 5986
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1378 transition count 5986
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1377 transition count 5985
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1377 transition count 5985
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1376 transition count 5984
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1376 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1375 transition count 5983
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1375 transition count 5983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 1375 transition count 5982
Applied a total of 74 rules in 2118 ms. Remains 1375 /1411 variables (removed 36) and now considering 5982/6020 (removed 38) transitions.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:08:38] [INFO ] Computed 8 place invariants in 137 ms
[2022-06-09 15:08:39] [INFO ] Implicit Places using invariants in 1507 ms returned []
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:08:39] [INFO ] Computed 8 place invariants in 90 ms
[2022-06-09 15:08:42] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 3936 ms to find 0 implicit places.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:08:42] [INFO ] Computed 8 place invariants in 87 ms
[2022-06-09 15:08:47] [INFO ] Dead Transitions using invariants and state equation in 5491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1375/1411 places, 5982/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 1375/1411 places, 5982/6020 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (EQ s24 0) (EQ s238 0) (EQ s431 0) (EQ s624 0) (EQ s838 0) (EQ s1034 0) (EQ s1206 0)), p1:(EQ s929 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 771 reset in 484 ms.
Product exploration explored 100000 steps with 771 reset in 486 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 7 states, 13 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 78893 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78893 steps, saw 20478 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:08:53] [INFO ] Computed 8 place invariants in 93 ms
[2022-06-09 15:08:53] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-09 15:08:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 15:08:57] [INFO ] After 3216ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-09 15:08:59] [INFO ] After 5131ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 914 ms.
[2022-06-09 15:09:00] [INFO ] After 6547ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 18 ms.
Support contains 8 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1375/1375 places, 5982/5982 transitions.
Graph (trivial) has 1366 edges and 1375 vertex of which 119 / 1375 are part of one of the 21 SCC in 0 ms
Free SCC test removed 98 places
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2519 edges and 1277 vertex of which 1270 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 954 transitions
Trivial Post-agglo rules discarded 954 transitions
Performed 954 trivial Post agglomeration. Transition count delta: 954
Iterating post reduction 0 with 961 rules applied. Total rules applied 963 place count 1270 transition count 4888
Reduce places removed 954 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 975 rules applied. Total rules applied 1938 place count 316 transition count 4867
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1945 place count 309 transition count 4867
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 1945 place count 309 transition count 4788
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 2103 place count 230 transition count 4788
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2104 place count 230 transition count 4787
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2204 place count 180 transition count 4737
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2218 place count 180 transition count 4723
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 2255 place count 143 transition count 1893
Iterating global reduction 5 with 37 rules applied. Total rules applied 2292 place count 143 transition count 1893
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 2308 place count 143 transition count 1877
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2329 place count 122 transition count 1856
Iterating global reduction 6 with 21 rules applied. Total rules applied 2350 place count 122 transition count 1856
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2364 place count 108 transition count 1842
Iterating global reduction 6 with 14 rules applied. Total rules applied 2378 place count 108 transition count 1842
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2385 place count 108 transition count 1835
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2399 place count 101 transition count 1828
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2405 place count 98 transition count 1836
Free-agglomeration rule applied 43 times.
Iterating global reduction 7 with 43 rules applied. Total rules applied 2448 place count 98 transition count 1793
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 7 with 108 rules applied. Total rules applied 2556 place count 55 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2563 place count 48 transition count 1721
Iterating global reduction 8 with 7 rules applied. Total rules applied 2570 place count 48 transition count 1721
Drop transitions removed 612 transitions
Redundant transition composition rules discarded 612 transitions
Iterating global reduction 8 with 612 rules applied. Total rules applied 3182 place count 48 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3184 place count 47 transition count 1108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3188 place count 45 transition count 1126
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3190 place count 45 transition count 1124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3192 place count 43 transition count 1124
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 3198 place count 43 transition count 1124
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 3202 place count 43 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3204 place count 41 transition count 1116
Iterating global reduction 9 with 2 rules applied. Total rules applied 3206 place count 41 transition count 1116
Applied a total of 3206 rules in 1752 ms. Remains 41 /1375 variables (removed 1334) and now considering 1116/5982 (removed 4866) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/1375 places, 1116/5982 transitions.
Finished random walk after 593 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=24 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 5982/5982 transitions.
Applied a total of 0 rules in 94 ms. Remains 1375 /1375 variables (removed 0) and now considering 5982/5982 (removed 0) transitions.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:02] [INFO ] Computed 8 place invariants in 87 ms
[2022-06-09 15:09:04] [INFO ] Implicit Places using invariants in 1438 ms returned []
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:04] [INFO ] Computed 8 place invariants in 87 ms
[2022-06-09 15:09:06] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:06] [INFO ] Computed 8 place invariants in 89 ms
[2022-06-09 15:09:13] [INFO ] Dead Transitions using invariants and state equation in 7235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1375/1375 places, 5982/5982 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 91653 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91653 steps, saw 23137 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:17] [INFO ] Computed 8 place invariants in 88 ms
[2022-06-09 15:09:18] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 15:09:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 15:09:21] [INFO ] After 3327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 15:09:22] [INFO ] After 4513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 517 ms.
[2022-06-09 15:09:23] [INFO ] After 5391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 11 ms.
Support contains 1 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1375/1375 places, 5982/5982 transitions.
Graph (trivial) has 1373 edges and 1375 vertex of which 119 / 1375 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2519 edges and 1277 vertex of which 1270 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 961 transitions
Trivial Post-agglo rules discarded 961 transitions
Performed 961 trivial Post agglomeration. Transition count delta: 961
Iterating post reduction 0 with 968 rules applied. Total rules applied 970 place count 1270 transition count 4881
Reduce places removed 961 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 982 rules applied. Total rules applied 1952 place count 309 transition count 4860
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1959 place count 302 transition count 4860
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 1959 place count 302 transition count 4781
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 2117 place count 223 transition count 4781
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2118 place count 223 transition count 4780
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2218 place count 173 transition count 4730
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2232 place count 173 transition count 4716
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 2275 place count 130 transition count 556
Iterating global reduction 5 with 43 rules applied. Total rules applied 2318 place count 130 transition count 556
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2340 place count 130 transition count 534
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2361 place count 109 transition count 513
Iterating global reduction 6 with 21 rules applied. Total rules applied 2382 place count 109 transition count 513
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2396 place count 95 transition count 499
Iterating global reduction 6 with 14 rules applied. Total rules applied 2410 place count 95 transition count 499
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2417 place count 95 transition count 492
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2431 place count 88 transition count 485
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2437 place count 85 transition count 493
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 2474 place count 85 transition count 456
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 166 rules applied. Total rules applied 2640 place count 48 transition count 327
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2647 place count 41 transition count 320
Iterating global reduction 8 with 7 rules applied. Total rules applied 2654 place count 41 transition count 320
Drop transitions removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 8 with 134 rules applied. Total rules applied 2788 place count 41 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2790 place count 40 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2794 place count 38 transition count 203
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2796 place count 38 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2798 place count 36 transition count 201
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2804 place count 36 transition count 201
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2808 place count 36 transition count 197
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2810 place count 34 transition count 193
Iterating global reduction 9 with 2 rules applied. Total rules applied 2812 place count 34 transition count 193
Applied a total of 2812 rules in 513 ms. Remains 34 /1375 variables (removed 1341) and now considering 193/5982 (removed 5789) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/1375 places, 193/5982 transitions.
Finished random walk after 129 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 775 reset in 398 ms.
Product exploration explored 100000 steps with 765 reset in 391 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1375/1375 places, 5982/5982 transitions.
Graph (trivial) has 1366 edges and 1375 vertex of which 119 / 1375 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 940 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 940 rules applied. Total rules applied 941 place count 1277 transition count 5870
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 955 place count 1277 transition count 5856
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 955 place count 1277 transition count 5863
Deduced a syphon composed of 997 places in 7 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 1012 place count 1277 transition count 5863
Discarding 845 places :
Symmetric choice reduction at 2 with 845 rule applications. Total rules 1857 place count 432 transition count 5018
Deduced a syphon composed of 158 places in 5 ms
Iterating global reduction 2 with 845 rules applied. Total rules applied 2702 place count 432 transition count 5018
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 236 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 2780 place count 432 transition count 5040
Discarding 122 places :
Symmetric choice reduction at 2 with 122 rule applications. Total rules 2902 place count 310 transition count 2118
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 122 rules applied. Total rules applied 3024 place count 310 transition count 2118
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 3047 place count 310 transition count 2095
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 3098 place count 259 transition count 2037
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 3 with 51 rules applied. Total rules applied 3149 place count 259 transition count 2037
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 3170 place count 238 transition count 2016
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 3191 place count 238 transition count 2016
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3198 place count 238 transition count 2009
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 3212 place count 224 transition count 1995
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 3226 place count 224 transition count 1995
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 3236 place count 224 transition count 2045
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 3253 place count 207 transition count 2011
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 3270 place count 207 transition count 2011
Deduced a syphon composed of 100 places in 1 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3284 place count 207 transition count 1997
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 3284 rules in 1157 ms. Remains 207 /1375 variables (removed 1168) and now considering 1997/5982 (removed 3985) transitions.
[2022-06-09 15:09:27] [INFO ] Redundant transitions in 90 ms returned []
[2022-06-09 15:09:27] [INFO ] Flow matrix only has 1989 transitions (discarded 8 similar events)
// Phase 1: matrix 1989 rows 207 cols
[2022-06-09 15:09:27] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 15:09:29] [INFO ] Dead Transitions using invariants and state equation in 2041 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/1375 places, 1997/5982 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/1375 places, 1997/5982 transitions.
Product exploration explored 100000 steps with 765 reset in 444 ms.
Product exploration explored 100000 steps with 777 reset in 523 ms.
Built C files in :
/tmp/ltsmin8329698883025420263
[2022-06-09 15:09:30] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8329698883025420263
Running compilation step : cd /tmp/ltsmin8329698883025420263;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8329698883025420263;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8329698883025420263;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 5982/5982 transitions.
Applied a total of 0 rules in 96 ms. Remains 1375 /1375 variables (removed 0) and now considering 5982/5982 (removed 0) transitions.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:33] [INFO ] Computed 8 place invariants in 95 ms
[2022-06-09 15:09:35] [INFO ] Implicit Places using invariants in 1578 ms returned []
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:35] [INFO ] Computed 8 place invariants in 90 ms
[2022-06-09 15:09:37] [INFO ] Implicit Places using invariants and state equation in 2554 ms returned []
Implicit Place search using SMT with State Equation took 4150 ms to find 0 implicit places.
// Phase 1: matrix 5982 rows 1375 cols
[2022-06-09 15:09:37] [INFO ] Computed 8 place invariants in 101 ms
[2022-06-09 15:09:43] [INFO ] Dead Transitions using invariants and state equation in 5817 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1375/1375 places, 5982/5982 transitions.
Built C files in :
/tmp/ltsmin15070112773145727339
[2022-06-09 15:09:43] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070112773145727339
Running compilation step : cd /tmp/ltsmin15070112773145727339;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15070112773145727339;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15070112773145727339;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:09:47] [INFO ] Flatten gal took : 552 ms
[2022-06-09 15:09:47] [INFO ] Flatten gal took : 452 ms
[2022-06-09 15:09:48] [INFO ] Time to serialize gal into /tmp/LTL3718110350746335358.gal : 74 ms
[2022-06-09 15:09:48] [INFO ] Time to serialize properties into /tmp/LTL3094805259005819012.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/LTL3718110350746335358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3094805259005819012.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/LTL3718110...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G(X("((((p30==0)||(p354==0))||((p656==0)||(p958==0)))||(((p1283==0)||(p1585==0))||(p1864==0)))")))||(G("(p1448==0)")))))))
Formula 0 simplified : !XXG(GX"((((p30==0)||(p354==0))||((p656==0)||(p958==0)))||(((p1283==0)||(p1585==0))||(p1864==0)))" | G"(p1448==0)")
Detected timeout of ITS tools.
[2022-06-09 15:10:03] [INFO ] Flatten gal took : 455 ms
[2022-06-09 15:10:03] [INFO ] Applying decomposition
[2022-06-09 15:10:04] [INFO ] Flatten gal took : 528 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/graph4591900014445643.txt' '-o' '/tmp/graph4591900014445643.bin' '-w' '/tmp/graph4591900014445643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4591900014445643.bin' '-l' '-1' '-v' '-w' '/tmp/graph4591900014445643.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:10:05] [INFO ] Decomposing Gal with order
[2022-06-09 15:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:10:07] [INFO ] Removed a total of 31730 redundant transitions.
[2022-06-09 15:10:07] [INFO ] Flatten gal took : 868 ms
[2022-06-09 15:10:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 230 ms.
[2022-06-09 15:10:07] [INFO ] Time to serialize gal into /tmp/LTL15319188296856736156.gal : 41 ms
[2022-06-09 15:10:07] [INFO ] Time to serialize properties into /tmp/LTL2317634579208880395.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/LTL15319188296856736156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2317634579208880395.ltl' '-c' '-stutter-deadlock'
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/LTL1531918...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G(X("((((i20.u10.p30==0)||(i0.u79.p354==0))||((i0.u159.p656==0)||(i0.u237.p958==0)))||(((i0.u320.p1283==0)||(i0.u400.p1585==...223
Formula 0 simplified : !XXG(GX"((((i20.u10.p30==0)||(i0.u79.p354==0))||((i0.u159.p656==0)||(i0.u237.p958==0)))||(((i0.u320.p1283==0)||(i0.u400.p1585==0))||...208
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6977369386550772930
[2022-06-09 15:10:22] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6977369386550772930
Running compilation step : cd /tmp/ltsmin6977369386550772930;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6977369386550772930;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6977369386550772930;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-14 finished in 110002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X((G((G(p1)&&p0))||p1))))))'
Support contains 7 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1402 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 969 transitions
Trivial Post-agglo rules discarded 969 transitions
Performed 969 trivial Post agglomeration. Transition count delta: 969
Iterating post reduction 0 with 969 rules applied. Total rules applied 970 place count 1312 transition count 4938
Reduce places removed 969 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 994 rules applied. Total rules applied 1964 place count 343 transition count 4913
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1973 place count 334 transition count 4913
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1973 place count 334 transition count 4840
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2119 place count 261 transition count 4840
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2127 place count 253 transition count 4832
Iterating global reduction 3 with 8 rules applied. Total rules applied 2135 place count 253 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2137 place count 251 transition count 4830
Iterating global reduction 3 with 2 rules applied. Total rules applied 2139 place count 251 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2140 place count 250 transition count 4829
Iterating global reduction 3 with 1 rules applied. Total rules applied 2141 place count 250 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2142 place count 249 transition count 4828
Iterating global reduction 3 with 1 rules applied. Total rules applied 2143 place count 249 transition count 4828
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2253 place count 194 transition count 4773
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2291 place count 156 transition count 1140
Iterating global reduction 3 with 38 rules applied. Total rules applied 2329 place count 156 transition count 1140
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2346 place count 156 transition count 1123
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2367 place count 135 transition count 1095
Iterating global reduction 4 with 21 rules applied. Total rules applied 2388 place count 135 transition count 1095
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2409 place count 114 transition count 1067
Iterating global reduction 4 with 21 rules applied. Total rules applied 2430 place count 114 transition count 1067
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2438 place count 114 transition count 1059
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2460 place count 103 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2461 place count 102 transition count 1052
Iterating global reduction 5 with 1 rules applied. Total rules applied 2462 place count 102 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2463 place count 102 transition count 1051
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2470 place count 102 transition count 1044
Applied a total of 2470 rules in 719 ms. Remains 102 /1411 variables (removed 1309) and now considering 1044/6020 (removed 4976) transitions.
[2022-06-09 15:10:26] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:10:26] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:10:26] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-06-09 15:10:26] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:10:27] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:10:27] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:10:27] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2022-06-09 15:10:27] [INFO ] Redundant transitions in 26 ms returned []
[2022-06-09 15:10:27] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
// Phase 1: matrix 1036 rows 102 cols
[2022-06-09 15:10:27] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:10:28] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1411 places, 1044/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/1411 places, 1044/6020 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s21 1) (EQ s34 1) (EQ s49 1) (EQ s63 1) (EQ s77 1) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLFireability-15 finished in 2683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(!(X(F(p0)) U p1))))||X(p2)||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(X(X(G(p0)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a SL insensitive property : StigmergyCommit-PT-06b-LTLFireability-06
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1407 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 974 transitions
Trivial Post-agglo rules discarded 974 transitions
Performed 974 trivial Post agglomeration. Transition count delta: 974
Iterating post reduction 0 with 974 rules applied. Total rules applied 975 place count 1312 transition count 4933
Reduce places removed 974 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 999 rules applied. Total rules applied 1974 place count 338 transition count 4908
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1983 place count 329 transition count 4908
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1983 place count 329 transition count 4834
Deduced a syphon composed of 74 places in 4 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2131 place count 255 transition count 4834
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2138 place count 248 transition count 4827
Iterating global reduction 3 with 7 rules applied. Total rules applied 2145 place count 248 transition count 4827
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2146 place count 247 transition count 4826
Iterating global reduction 3 with 1 rules applied. Total rules applied 2147 place count 247 transition count 4826
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2257 place count 192 transition count 4771
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2299 place count 150 transition count 618
Iterating global reduction 3 with 42 rules applied. Total rules applied 2341 place count 150 transition count 618
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 2362 place count 150 transition count 597
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2383 place count 129 transition count 569
Iterating global reduction 4 with 21 rules applied. Total rules applied 2404 place count 129 transition count 569
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2425 place count 108 transition count 541
Iterating global reduction 4 with 21 rules applied. Total rules applied 2446 place count 108 transition count 541
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2453 place count 108 transition count 534
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2475 place count 97 transition count 541
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2476 place count 96 transition count 527
Iterating global reduction 5 with 1 rules applied. Total rules applied 2477 place count 96 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2478 place count 96 transition count 526
Applied a total of 2478 rules in 609 ms. Remains 96 /1411 variables (removed 1315) and now considering 526/6020 (removed 5494) transitions.
[2022-06-09 15:10:29] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:29] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:10:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-06-09 15:10:30] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:30] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:10:30] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2022-06-09 15:10:30] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:10:31] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 96/1411 places, 526/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/1411 places, 526/6020 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8126 reset in 319 ms.
Product exploration explored 100000 steps with 8106 reset in 343 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 801 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 953165 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 953165 steps, saw 183533 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:10:35] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:35] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 15:10:35] [INFO ] After 213ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 15:10:35] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:10:35] [INFO ] After 115ms SMT Verify possible using 127 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:10:35] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:10:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 15:10:35] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:10:35] [INFO ] After 113ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:10:35] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-09 15:10:35] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 526/526 transitions.
Graph (complete) has 630 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 95 transition count 510
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 88 transition count 503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 37 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 74 place count 88 transition count 459
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 176 rules applied. Total rules applied 250 place count 50 transition count 321
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 259 place count 41 transition count 321
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 266 place count 34 transition count 314
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 34 transition count 314
Performed 14 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 301 place count 20 transition count 169
Drop transitions removed 7 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 329 place count 20 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 331 place count 18 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 333 place count 18 transition count 139
Performed 7 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 352 place count 6 transition count 18
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 364 place count 6 transition count 6
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 366 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 369 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 2 transition count 2
Applied a total of 371 rules in 70 ms. Remains 2 /96 variables (removed 94) and now considering 2/526 (removed 524) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/96 places, 2/526 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 526/526 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2022-06-09 15:10:36] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:10:36] [INFO ] Implicit Places using invariants in 226 ms returned []
[2022-06-09 15:10:36] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:36] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:36] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:10:37] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2022-06-09 15:10:37] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:10:37] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 526/526 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 809 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1042300 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1042300 steps, saw 198014 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 15:10:40] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:40] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:10:41] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 15:10:41] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:10:41] [INFO ] After 100ms SMT Verify possible using 127 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:10:41] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:10:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 15:10:41] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:10:41] [INFO ] After 106ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:10:41] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-09 15:10:41] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 526/526 transitions.
Graph (complete) has 630 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 95 transition count 510
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 88 transition count 503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 37 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 74 place count 88 transition count 459
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 176 rules applied. Total rules applied 250 place count 50 transition count 321
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 259 place count 41 transition count 321
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 266 place count 34 transition count 314
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 34 transition count 314
Performed 14 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 301 place count 20 transition count 169
Drop transitions removed 7 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 329 place count 20 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 331 place count 18 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 333 place count 18 transition count 139
Performed 7 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 352 place count 6 transition count 18
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 364 place count 6 transition count 6
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 366 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 369 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 2 transition count 2
Applied a total of 371 rules in 76 ms. Remains 2 /96 variables (removed 94) and now considering 2/526 (removed 524) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/96 places, 2/526 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8147 reset in 293 ms.
Product exploration explored 100000 steps with 8102 reset in 306 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 526/526 transitions.
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 96 transition count 519
Applied a total of 7 rules in 40 ms. Remains 96 /96 variables (removed 0) and now considering 519/526 (removed 7) transitions.
[2022-06-09 15:10:42] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-09 15:10:42] [INFO ] Flow matrix only has 511 transitions (discarded 8 similar events)
// Phase 1: matrix 511 rows 96 cols
[2022-06-09 15:10:42] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:43] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/96 places, 519/526 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 519/526 transitions.
Product exploration explored 100000 steps with 8140 reset in 519 ms.
Product exploration explored 100000 steps with 8136 reset in 465 ms.
Built C files in :
/tmp/ltsmin2907890776777080211
[2022-06-09 15:10:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2907890776777080211
Running compilation step : cd /tmp/ltsmin2907890776777080211;'/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 1964 ms.
Running link step : cd /tmp/ltsmin2907890776777080211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2907890776777080211;'/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/stateBased10718148694047838099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 526/526 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2022-06-09 15:10:59] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:59] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:10:59] [INFO ] Implicit Places using invariants in 190 ms returned []
[2022-06-09 15:10:59] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:10:59] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:10:59] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:11:00] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2022-06-09 15:11:00] [INFO ] Flow matrix only has 518 transitions (discarded 8 similar events)
// Phase 1: matrix 518 rows 96 cols
[2022-06-09 15:11:00] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:11:00] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 526/526 transitions.
Built C files in :
/tmp/ltsmin18095712572395823675
[2022-06-09 15:11:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18095712572395823675
Running compilation step : cd /tmp/ltsmin18095712572395823675;'/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 1951 ms.
Running link step : cd /tmp/ltsmin18095712572395823675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18095712572395823675;'/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/stateBased4111881919037166446.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 15:11:15] [INFO ] Flatten gal took : 49 ms
[2022-06-09 15:11:15] [INFO ] Flatten gal took : 49 ms
[2022-06-09 15:11:15] [INFO ] Time to serialize gal into /tmp/LTL5513925679257144725.gal : 5 ms
[2022-06-09 15:11:15] [INFO ] Time to serialize properties into /tmp/LTL2919016596680298688.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/LTL5513925679257144725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2919016596680298688.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/LTL5513925...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p2002!=1)")))))
Formula 0 simplified : !XXG"(p2002!=1)"
Detected timeout of ITS tools.
[2022-06-09 15:11:31] [INFO ] Flatten gal took : 48 ms
[2022-06-09 15:11:31] [INFO ] Applying decomposition
[2022-06-09 15:11:31] [INFO ] Flatten gal took : 48 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/graph2866353509705673644.txt' '-o' '/tmp/graph2866353509705673644.bin' '-w' '/tmp/graph2866353509705673644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2866353509705673644.bin' '-l' '-1' '-v' '-w' '/tmp/graph2866353509705673644.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:11:31] [INFO ] Decomposing Gal with order
[2022-06-09 15:11:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:11:31] [INFO ] Removed a total of 2779 redundant transitions.
[2022-06-09 15:11:31] [INFO ] Flatten gal took : 104 ms
[2022-06-09 15:11:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 20 ms.
[2022-06-09 15:11:31] [INFO ] Time to serialize gal into /tmp/LTL11978363549253897780.gal : 4 ms
[2022-06-09 15:11:31] [INFO ] Time to serialize properties into /tmp/LTL5225771548264662319.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/LTL11978363549253897780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5225771548264662319.ltl' '-c' '-stutter-deadlock'
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/LTL1197836...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i4.u21.p2002!=1)")))))
Formula 0 simplified : !XXG"(i4.u21.p2002!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16678772367729650777
[2022-06-09 15:11:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16678772367729650777
Running compilation step : cd /tmp/ltsmin16678772367729650777;'/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 1942 ms.
Running link step : cd /tmp/ltsmin16678772367729650777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16678772367729650777;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-06b-LTLFireability-06 finished in 92662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(X(p0))||G(p1))))))'
Found a SL insensitive property : StigmergyCommit-PT-06b-LTLFireability-14
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 1411 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1411/1411 places, 6020/6020 transitions.
Graph (trivial) has 1400 edges and 1411 vertex of which 119 / 1411 are part of one of the 21 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 967 transitions
Trivial Post-agglo rules discarded 967 transitions
Performed 967 trivial Post agglomeration. Transition count delta: 967
Iterating post reduction 0 with 967 rules applied. Total rules applied 968 place count 1312 transition count 4940
Reduce places removed 967 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 990 rules applied. Total rules applied 1958 place count 345 transition count 4917
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1966 place count 337 transition count 4917
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1966 place count 337 transition count 4843
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2114 place count 263 transition count 4843
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2122 place count 255 transition count 4835
Iterating global reduction 3 with 8 rules applied. Total rules applied 2130 place count 255 transition count 4835
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2132 place count 253 transition count 4833
Iterating global reduction 3 with 2 rules applied. Total rules applied 2134 place count 253 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2135 place count 252 transition count 4832
Iterating global reduction 3 with 1 rules applied. Total rules applied 2136 place count 252 transition count 4832
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2137 place count 251 transition count 4831
Iterating global reduction 3 with 1 rules applied. Total rules applied 2138 place count 251 transition count 4831
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2248 place count 196 transition count 4776
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2284 place count 160 transition count 1953
Iterating global reduction 3 with 36 rules applied. Total rules applied 2320 place count 160 transition count 1953
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 2335 place count 160 transition count 1938
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2356 place count 139 transition count 1910
Iterating global reduction 4 with 21 rules applied. Total rules applied 2377 place count 139 transition count 1910
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2398 place count 118 transition count 1882
Iterating global reduction 4 with 21 rules applied. Total rules applied 2419 place count 118 transition count 1882
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2427 place count 118 transition count 1874
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2449 place count 107 transition count 1881
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2450 place count 106 transition count 1867
Iterating global reduction 5 with 1 rules applied. Total rules applied 2451 place count 106 transition count 1867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2452 place count 106 transition count 1866
Applied a total of 2452 rules in 628 ms. Remains 106 /1411 variables (removed 1305) and now considering 1866/6020 (removed 4154) transitions.
[2022-06-09 15:12:02] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:02] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 15:12:03] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-09 15:12:03] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:03] [INFO ] Computed 2 place invariants in 26 ms
[2022-06-09 15:12:03] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:12:04] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
[2022-06-09 15:12:04] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:04] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 15:12:05] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 106/1411 places, 1866/6020 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/1411 places, 1866/6020 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (EQ s4 0) (EQ s19 0) (EQ s33 0) (EQ s47 0) (EQ s63 0) (EQ s80 0) (EQ s94 0)), p1:(EQ s70 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7681 reset in 535 ms.
Product exploration explored 100000 steps with 7702 reset in 583 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 13 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 765 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 195226 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195226 steps, saw 54189 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 6 properties.
[2022-06-09 15:12:11] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:11] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 15:12:11] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-09 15:12:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:12:12] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-09 15:12:12] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:12:13] [INFO ] After 870ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-06-09 15:12:13] [INFO ] After 1243ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 288 ms.
[2022-06-09 15:12:13] [INFO ] After 2458ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 1866/1866 transitions.
Graph (complete) has 715 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 1850
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 98 transition count 1843
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 37 place count 98 transition count 1836
Free-agglomeration rule applied 43 times.
Iterating global reduction 2 with 43 rules applied. Total rules applied 80 place count 98 transition count 1793
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 116 rules applied. Total rules applied 196 place count 54 transition count 1721
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 203 place count 47 transition count 1721
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 210 place count 40 transition count 1714
Iterating global reduction 4 with 7 rules applied. Total rules applied 217 place count 40 transition count 1714
Performed 14 Post agglomeration using F-continuation condition with reduction of 1020 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 245 place count 26 transition count 680
Drop transitions removed 7 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 406 transitions.
Iterating post reduction 4 with 406 rules applied. Total rules applied 651 place count 26 transition count 274
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 653 place count 24 transition count 272
Iterating global reduction 5 with 2 rules applied. Total rules applied 655 place count 24 transition count 272
Performed 7 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 669 place count 17 transition count 151
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 681 place count 17 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 682 place count 17 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 683 place count 16 transition count 137
Applied a total of 683 rules in 347 ms. Remains 16 /106 variables (removed 90) and now considering 137/1866 (removed 1729) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/106 places, 137/1866 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=11 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 1866/1866 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2022-06-09 15:12:14] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:14] [INFO ] Computed 2 place invariants in 24 ms
[2022-06-09 15:12:15] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-06-09 15:12:15] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:15] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 15:12:15] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:12:17] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2022-06-09 15:12:17] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:17] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-09 15:12:18] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 1866/1866 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 763 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 157119 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157119 steps, saw 46145 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 15:12:22] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:22] [INFO ] Computed 2 place invariants in 26 ms
[2022-06-09 15:12:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 15:12:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 15:12:23] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 15:12:23] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:12:23] [INFO ] After 603ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 15:12:23] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-06-09 15:12:24] [INFO ] After 1947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 1866/1866 transitions.
Graph (complete) has 715 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 1850
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 98 transition count 1843
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 37 place count 98 transition count 1836
Free-agglomeration rule applied 43 times.
Iterating global reduction 2 with 43 rules applied. Total rules applied 80 place count 98 transition count 1793
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 116 rules applied. Total rules applied 196 place count 54 transition count 1721
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 203 place count 47 transition count 1721
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 210 place count 40 transition count 1714
Iterating global reduction 4 with 7 rules applied. Total rules applied 217 place count 40 transition count 1714
Performed 14 Post agglomeration using F-continuation condition with reduction of 1020 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 245 place count 26 transition count 680
Drop transitions removed 7 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 406 transitions.
Iterating post reduction 4 with 406 rules applied. Total rules applied 651 place count 26 transition count 274
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 653 place count 24 transition count 272
Iterating global reduction 5 with 2 rules applied. Total rules applied 655 place count 24 transition count 272
Performed 7 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 669 place count 17 transition count 151
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 681 place count 17 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 682 place count 17 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 683 place count 16 transition count 137
Applied a total of 683 rules in 359 ms. Remains 16 /106 variables (removed 90) and now considering 137/1866 (removed 1729) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/106 places, 137/1866 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7739 reset in 557 ms.
Product exploration explored 100000 steps with 7685 reset in 573 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 456 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 1866/1866 transitions.
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 1859
Applied a total of 7 rules in 258 ms. Remains 106 /106 variables (removed 0) and now considering 1859/1866 (removed 7) transitions.
[2022-06-09 15:12:27] [INFO ] Redundant transitions in 77 ms returned []
[2022-06-09 15:12:27] [INFO ] Flow matrix only has 1851 transitions (discarded 8 similar events)
// Phase 1: matrix 1851 rows 106 cols
[2022-06-09 15:12:27] [INFO ] Computed 2 place invariants in 22 ms
[2022-06-09 15:12:28] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/106 places, 1859/1866 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 1859/1866 transitions.
Product exploration explored 100000 steps with 7695 reset in 694 ms.
Product exploration explored 100000 steps with 7694 reset in 558 ms.
Built C files in :
/tmp/ltsmin2194813324983077406
[2022-06-09 15:12:30] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2194813324983077406
Running compilation step : cd /tmp/ltsmin2194813324983077406;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2194813324983077406;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2194813324983077406;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 1866/1866 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2022-06-09 15:12:33] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:33] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 15:12:33] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-09 15:12:33] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:33] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 15:12:34] [INFO ] State equation strengthened by 127 read => feed constraints.
[2022-06-09 15:12:35] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2022-06-09 15:12:35] [INFO ] Flow matrix only has 1858 transitions (discarded 8 similar events)
// Phase 1: matrix 1858 rows 106 cols
[2022-06-09 15:12:35] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 15:12:36] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 1866/1866 transitions.
Built C files in :
/tmp/ltsmin5246681008470107360
[2022-06-09 15:12:36] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5246681008470107360
Running compilation step : cd /tmp/ltsmin5246681008470107360;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5246681008470107360;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5246681008470107360;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 15:12:40] [INFO ] Flatten gal took : 230 ms
[2022-06-09 15:12:40] [INFO ] Flatten gal took : 235 ms
[2022-06-09 15:12:40] [INFO ] Time to serialize gal into /tmp/LTL16957953092820432113.gal : 23 ms
[2022-06-09 15:12:40] [INFO ] Time to serialize properties into /tmp/LTL15263901234452127097.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/LTL16957953092820432113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15263901234452127097.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/LTL1695795...268
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G(X("((((p30==0)||(p354==0))||((p656==0)||(p958==0)))||(((p1283==0)||(p1585==0))||(p1864==0)))")))||(G("(p1448==0)")))))))
Formula 0 simplified : !XXG(GX"((((p30==0)||(p354==0))||((p656==0)||(p958==0)))||(((p1283==0)||(p1585==0))||(p1864==0)))" | G"(p1448==0)")
Detected timeout of ITS tools.
[2022-06-09 15:12:55] [INFO ] Flatten gal took : 227 ms
[2022-06-09 15:12:55] [INFO ] Applying decomposition
[2022-06-09 15:12:55] [INFO ] Flatten gal took : 332 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/graph5987525443571368199.txt' '-o' '/tmp/graph5987525443571368199.bin' '-w' '/tmp/graph5987525443571368199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5987525443571368199.bin' '-l' '-1' '-v' '-w' '/tmp/graph5987525443571368199.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:12:56] [INFO ] Decomposing Gal with order
[2022-06-09 15:12:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:12:57] [INFO ] Removed a total of 12080 redundant transitions.
[2022-06-09 15:12:57] [INFO ] Flatten gal took : 385 ms
[2022-06-09 15:12:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 65 ms.
[2022-06-09 15:12:57] [INFO ] Time to serialize gal into /tmp/LTL12701673612012050312.gal : 5 ms
[2022-06-09 15:12:57] [INFO ] Time to serialize properties into /tmp/LTL3964373665616211844.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/LTL12701673612012050312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3964373665616211844.ltl' '-c' '-stutter-deadlock'
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/LTL1270167...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G((G(X("((((i1.u1.p30==0)||(i2.u5.p354==0))||((i2.u7.p656==0)||(i2.u11.p958==0)))||(((i1.u13.p1283==0)||(i1.u17.p1585==0))||(i2...206
Formula 0 simplified : !XXG(GX"((((i1.u1.p30==0)||(i2.u5.p354==0))||((i2.u7.p656==0)||(i2.u11.p958==0)))||(((i1.u13.p1283==0)||(i1.u17.p1585==0))||(i2.u21....191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3685739431729534352
[2022-06-09 15:13:12] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3685739431729534352
Running compilation step : cd /tmp/ltsmin3685739431729534352;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3685739431729534352;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3685739431729534352;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-06b-LTLFireability-14 finished in 73553 ms.
[2022-06-09 15:13:15] [INFO ] Flatten gal took : 428 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14727324804350472432
[2022-06-09 15:13:15] [INFO ] Too many transitions (6020) to apply POR reductions. Disabling POR matrices.
[2022-06-09 15:13:16] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14727324804350472432
Running compilation step : cd /tmp/ltsmin14727324804350472432;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' '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'
[2022-06-09 15:13:16] [INFO ] Applying decomposition
[2022-06-09 15:13:16] [INFO ] Flatten gal took : 645 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/graph17040423868918812606.txt' '-o' '/tmp/graph17040423868918812606.bin' '-w' '/tmp/graph17040423868918812606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17040423868918812606.bin' '-l' '-1' '-v' '-w' '/tmp/graph17040423868918812606.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:13:18] [INFO ] Decomposing Gal with order
[2022-06-09 15:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:13:20] [INFO ] Removed a total of 31745 redundant transitions.
[2022-06-09 15:13:20] [INFO ] Flatten gal took : 822 ms
[2022-06-09 15:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 161 ms.
[2022-06-09 15:13:20] [INFO ] Time to serialize gal into /tmp/LTLFireability9661697318903262344.gal : 22 ms
[2022-06-09 15:13:20] [INFO ] Time to serialize properties into /tmp/LTLFireability8517239116439961594.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/LTLFireability9661697318903262344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8517239116439961594.ltl' '-c' '-stutter-deadlock'
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/LTLFireabi...267
Read 5 LTL properties
Checking formula 0 : !((G(F(G(X("((((i0.u33.p97==0)||(i21.u83.p421==0))||((i0.u194.p701==0)||(i21.u265.p1025==0)))||(((i21.u335.p1327==0)||(i21.u416.p1629=...189
Formula 0 simplified : !GFGX"((((i0.u33.p97==0)||(i21.u83.p421==0))||((i0.u194.p701==0)||(i21.u265.p1025==0)))||(((i21.u335.p1327==0)||(i21.u416.p1629==0))...179
Compilation finished in 51605 ms.
Running link step : cd /tmp/ltsmin14727324804350472432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin14727324804350472432;'/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((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin14727324804350472432;'/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((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14727324804350472432;'/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(<>(!(X(<>((LTLAPp1==true))) U (LTLAPp2==true)))))||X((LTLAPp3==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-09 15:37:46] [INFO ] Applying decomposition
[2022-06-09 15:37:49] [INFO ] Flatten gal took : 2999 ms
[2022-06-09 15:37:50] [INFO ] Decomposing Gal with order
[2022-06-09 15:37:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:37:57] [INFO ] Removed a total of 31571 redundant transitions.
[2022-06-09 15:37:57] [INFO ] Flatten gal took : 4326 ms
[2022-06-09 15:37:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 638 labels/synchronizations in 251 ms.
[2022-06-09 15:37:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6925374153751688278.gal : 14 ms
[2022-06-09 15:37:58] [INFO ] Time to serialize properties into /tmp/LTLFireability17148692096677571875.ltl : 5 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/LTLFireability6925374153751688278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17148692096677571875.ltl' '-c' '-stutter-deadlock'
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/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((G(F(G(X("((((i0.i0.i0.i0.i0.i0.u7.p97==0)||(i0.i0.i0.i0.i0.i0.u8.p421==0))||((i0.i0.i0.i0.i0.u9.p701==0)||(i0.i0.i0.i0.u10.p1025==0...236
Formula 0 simplified : !GFGX"((((i0.i0.i0.i0.i0.i0.u7.p97==0)||(i0.i0.i0.i0.i0.i0.u8.p421==0))||((i0.i0.i0.i0.i0.u9.p701==0)||(i0.i0.i0.i0.u10.p1025==0)))|...226
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin14727324804350472432;'/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(<>(!(X(<>((LTLAPp1==true))) U (LTLAPp2==true)))))||X((LTLAPp3==true))||(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14727324804350472432;'/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(X([]((LTLAPp4==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1400, i0.u13.t57, i0.u13.t102, i0.u13.t112, i0.u13.t134, i0.u13.t143, i0.u13.t197, i0.u13.t1...1555
Computing Next relation with stutter on 1.77954e+08 deadlock states
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin14727324804350472432;'/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(X([]((LTLAPp4==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14727324804350472432;'/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([]((LTLAPp5==true))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="StigmergyCommit-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872500164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;