About the Execution of LTSMin+red for StigmergyElection-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5520.731 | 608719.00 | 737727.00 | 2398.20 | FTFFFFFFF?TF??F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r457-smll-167912649600660.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is StigmergyElection-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649600660
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-08b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679564941696
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 09:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:49:05] [INFO ] Load time of PNML (sax parser for PT used): 1009 ms
[2023-03-23 09:49:05] [INFO ] Transformed 1107 places.
[2023-03-23 09:49:05] [INFO ] Transformed 14564 transitions.
[2023-03-23 09:49:05] [INFO ] Found NUPN structural information;
[2023-03-23 09:49:05] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 1247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-08b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 139 place count 968 transition count 14425
Iterating global reduction 0 with 139 rules applied. Total rules applied 278 place count 968 transition count 14425
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 352 place count 894 transition count 14351
Iterating global reduction 0 with 74 rules applied. Total rules applied 426 place count 894 transition count 14351
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 442 place count 878 transition count 14335
Iterating global reduction 0 with 16 rules applied. Total rules applied 458 place count 878 transition count 14335
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 466 place count 870 transition count 14327
Iterating global reduction 0 with 8 rules applied. Total rules applied 474 place count 870 transition count 14327
Applied a total of 474 rules in 897 ms. Remains 870 /1107 variables (removed 237) and now considering 14327/14564 (removed 237) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2023-03-23 09:49:07] [INFO ] Computed 9 place invariants in 398 ms
[2023-03-23 09:49:07] [INFO ] Implicit Places using invariants in 999 ms returned []
Implicit Place search using SMT only with invariants took 1046 ms to find 0 implicit places.
[2023-03-23 09:49:07] [INFO ] Invariant cache hit.
[2023-03-23 09:49:19] [INFO ] Dead Transitions using invariants and state equation in 11775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/1107 places, 14327/14564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13728 ms. Remains : 870/1107 places, 14327/14564 transitions.
Support contains 50 out of 870 places after structural reductions.
[2023-03-23 09:49:22] [INFO ] Flatten gal took : 1977 ms
[2023-03-23 09:49:23] [INFO ] Flatten gal took : 1507 ms
[2023-03-23 09:49:27] [INFO ] Input system was already deterministic with 14327 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) 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 29) 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 29) 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 29) seen :0
Interrupted probabilistic random walk after 59786 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{0=1}
Probabilistic random walk after 59786 steps, saw 14858 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 28 properties.
[2023-03-23 09:49:31] [INFO ] Invariant cache hit.
[2023-03-23 09:49:33] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-23 09:49:46] [INFO ] After 12611ms SMT Verify possible using state equation in real domain returned unsat :1 sat :14 real:13
[2023-03-23 09:49:57] [INFO ] After 24097ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :14 real:13
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 09:49:57] [INFO ] After 25125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :14 real:13
[2023-03-23 09:49:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-23 09:50:14] [INFO ] After 16195ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2023-03-23 09:50:22] [INFO ] After 24206ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :26
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 09:50:22] [INFO ] After 25257ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :26
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 25 properties in 451 ms.
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 10 ms
Free SCC test removed 112 places
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 2184 edges and 758 vertex of which 750 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.104 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 537 rules applied. Total rules applied 539 place count 750 transition count 13638
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 545 rules applied. Total rules applied 1084 place count 221 transition count 13622
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1092 place count 213 transition count 13622
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1092 place count 213 transition count 13581
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1174 place count 172 transition count 13581
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1175 place count 172 transition count 13580
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1257 place count 131 transition count 13539
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1273 place count 131 transition count 13523
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 1301 place count 103 transition count 2569
Iterating global reduction 5 with 28 rules applied. Total rules applied 1329 place count 103 transition count 2569
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1341 place count 103 transition count 2557
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1349 place count 95 transition count 2549
Iterating global reduction 6 with 8 rules applied. Total rules applied 1357 place count 95 transition count 2549
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1373 place count 87 transition count 2541
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1379 place count 84 transition count 2549
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1387 place count 84 transition count 2541
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1389 place count 83 transition count 2547
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1397 place count 83 transition count 2539
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1399 place count 82 transition count 2545
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1407 place count 82 transition count 2537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1409 place count 81 transition count 2543
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 81 transition count 2535
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1419 place count 80 transition count 2541
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1427 place count 80 transition count 2533
Free-agglomeration rule applied 46 times.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1473 place count 80 transition count 2487
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 79 rules applied. Total rules applied 1552 place count 34 transition count 2454
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1560 place count 26 transition count 2446
Iterating global reduction 7 with 8 rules applied. Total rules applied 1568 place count 26 transition count 2446
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 1823 place count 26 transition count 2191
Drop transitions removed 180 transitions
Redundant transition composition rules discarded 180 transitions
Iterating global reduction 8 with 180 rules applied. Total rules applied 2003 place count 26 transition count 2011
Applied a total of 2003 rules in 6067 ms. Remains 26 /870 variables (removed 844) and now considering 2011/14327 (removed 12316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6072 ms. Remains : 26/870 places, 2011/14327 transitions.
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 120 stabilizing places and 128 stable transitions
FORMULA StigmergyElection-PT-08b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 142 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:50:30] [INFO ] Invariant cache hit.
[2023-03-23 09:50:34] [INFO ] Implicit Places using invariants in 4091 ms returned []
Implicit Place search using SMT only with invariants took 4092 ms to find 0 implicit places.
[2023-03-23 09:50:34] [INFO ] Invariant cache hit.
[2023-03-23 09:50:46] [INFO ] Dead Transitions using invariants and state equation in 11664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15900 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-02 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:(AND (EQ s72 1) (EQ s189 1) (EQ s273 1) (EQ s390 1) (EQ s485 1) (EQ s602 1) (EQ s719 1) (EQ s803 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 7 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-02 finished in 16343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 9 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 147 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:50:46] [INFO ] Invariant cache hit.
[2023-03-23 09:50:50] [INFO ] Implicit Places using invariants in 3775 ms returned []
Implicit Place search using SMT only with invariants took 3776 ms to find 0 implicit places.
[2023-03-23 09:50:50] [INFO ] Invariant cache hit.
[2023-03-23 09:51:01] [INFO ] Dead Transitions using invariants and state equation in 11019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14950 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-05 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s747 1) (OR (NEQ s83 1) (NEQ s189 1) (NEQ s295 1) (NEQ s379 1) (NEQ s507 1) (NEQ s613 1) (NEQ s708 1) (NEQ s825 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-05 finished in 15182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2))))'
Support contains 18 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 875 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 3 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 504 place count 757 transition count 13695
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 519 rules applied. Total rules applied 1023 place count 254 transition count 13679
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1031 place count 246 transition count 13679
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1031 place count 246 transition count 13646
Deduced a syphon composed of 33 places in 8 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1097 place count 213 transition count 13646
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1104 place count 206 transition count 13639
Iterating global reduction 3 with 7 rules applied. Total rules applied 1111 place count 206 transition count 13639
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 5 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1189 place count 167 transition count 13600
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1213 place count 143 transition count 7271
Iterating global reduction 3 with 24 rules applied. Total rules applied 1237 place count 143 transition count 7271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1245 place count 143 transition count 7263
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1253 place count 135 transition count 7247
Iterating global reduction 4 with 8 rules applied. Total rules applied 1261 place count 135 transition count 7247
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1269 place count 127 transition count 7231
Iterating global reduction 4 with 8 rules applied. Total rules applied 1277 place count 127 transition count 7231
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1301 place count 115 transition count 7238
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1302 place count 114 transition count 7222
Iterating global reduction 4 with 1 rules applied. Total rules applied 1303 place count 114 transition count 7222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1304 place count 114 transition count 7221
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1312 place count 114 transition count 7213
Applied a total of 1312 rules in 3677 ms. Remains 114 /870 variables (removed 756) and now considering 7213/14327 (removed 7114) transitions.
[2023-03-23 09:51:05] [INFO ] Flow matrix only has 7204 transitions (discarded 9 similar events)
// Phase 1: matrix 7204 rows 114 cols
[2023-03-23 09:51:05] [INFO ] Computed 2 place invariants in 95 ms
[2023-03-23 09:51:06] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-23 09:51:06] [INFO ] Flow matrix only has 7204 transitions (discarded 9 similar events)
[2023-03-23 09:51:06] [INFO ] Invariant cache hit.
[2023-03-23 09:51:08] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2743 ms to find 0 implicit places.
[2023-03-23 09:51:09] [INFO ] Redundant transitions in 1298 ms returned []
[2023-03-23 09:51:09] [INFO ] Flow matrix only has 7204 transitions (discarded 9 similar events)
[2023-03-23 09:51:09] [INFO ] Invariant cache hit.
[2023-03-23 09:51:13] [INFO ] Dead Transitions using invariants and state equation in 4010 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/870 places, 7213/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11740 ms. Remains : 114/870 places, 7213/14327 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s20 1) (EQ s34 1) (EQ s51 1) (EQ s66 1) (EQ s78 1) (EQ s93 1) (EQ s107 1)), p1:(AND (EQ s6 1) (EQ s24 1) (EQ s38 1) (EQ s49 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-06 finished in 11976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||X(X(F(p2))))))'
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 128 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2023-03-23 09:51:14] [INFO ] Computed 9 place invariants in 292 ms
[2023-03-23 09:51:17] [INFO ] Implicit Places using invariants in 3499 ms returned []
Implicit Place search using SMT only with invariants took 3501 ms to find 0 implicit places.
[2023-03-23 09:51:17] [INFO ] Invariant cache hit.
[2023-03-23 09:51:30] [INFO ] Dead Transitions using invariants and state equation in 13136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16771 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s83 0) (EQ s189 0) (EQ s295 0) (EQ s379 0) (EQ s507 0) (EQ s591 0) (EQ s697 0) (EQ s803 0)), p1:(AND (EQ s83 1) (EQ s189 1) (EQ s295 1) (EQ s37...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-07 finished in 17020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 10 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 140 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:51:30] [INFO ] Invariant cache hit.
[2023-03-23 09:51:34] [INFO ] Implicit Places using invariants in 3888 ms returned []
Implicit Place search using SMT only with invariants took 3890 ms to find 0 implicit places.
[2023-03-23 09:51:34] [INFO ] Invariant cache hit.
[2023-03-23 09:51:49] [INFO ] Dead Transitions using invariants and state equation in 15269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19304 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s72 1) (EQ s167 1) (EQ s284 1) (EQ s379 1) (EQ s507 1) (EQ s602 1) (EQ s708 1) (EQ s803 1)), p0:(AND (EQ s61 1) (EQ s167 1) (EQ s284 1) (EQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-08 finished in 19482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 757 transition count 13685
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 529 rules applied. Total rules applied 1043 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1051 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1051 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1117 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1124 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1131 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1209 place count 157 transition count 13590
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1233 place count 133 transition count 7261
Iterating global reduction 3 with 24 rules applied. Total rules applied 1257 place count 133 transition count 7261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1265 place count 133 transition count 7253
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1273 place count 125 transition count 7237
Iterating global reduction 4 with 8 rules applied. Total rules applied 1281 place count 125 transition count 7237
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1289 place count 117 transition count 7221
Iterating global reduction 4 with 8 rules applied. Total rules applied 1297 place count 117 transition count 7221
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 4 with 24 rules applied. Total rules applied 1321 place count 105 transition count 7228
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1322 place count 104 transition count 7212
Iterating global reduction 4 with 1 rules applied. Total rules applied 1323 place count 104 transition count 7212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1324 place count 104 transition count 7211
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1332 place count 104 transition count 7203
Applied a total of 1332 rules in 3494 ms. Remains 104 /870 variables (removed 766) and now considering 7203/14327 (removed 7124) transitions.
[2023-03-23 09:51:53] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
// Phase 1: matrix 7194 rows 104 cols
[2023-03-23 09:51:53] [INFO ] Computed 2 place invariants in 79 ms
[2023-03-23 09:51:55] [INFO ] Implicit Places using invariants in 1804 ms returned []
[2023-03-23 09:51:55] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:51:55] [INFO ] Invariant cache hit.
[2023-03-23 09:51:58] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 4556 ms to find 0 implicit places.
[2023-03-23 09:51:59] [INFO ] Redundant transitions in 1327 ms returned []
[2023-03-23 09:51:59] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:51:59] [INFO ] Invariant cache hit.
[2023-03-23 09:52:06] [INFO ] Dead Transitions using invariants and state equation in 7013 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/870 places, 7203/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16402 ms. Remains : 104/870 places, 7203/14327 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-09 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 s18 0) (EQ s31 0) (EQ s42 0) (EQ s56 0) (EQ s68 0) (EQ s81 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 6672 reset in 2001 ms.
Product exploration explored 100000 steps with 6633 reset in 1679 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 653 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121364 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121364 steps, saw 40877 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 09:52:13] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:13] [INFO ] Invariant cache hit.
[2023-03-23 09:52:13] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:52:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:52:16] [INFO ] After 2470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:52:17] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:52:21] [INFO ] After 4204ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:52:22] [INFO ] After 4485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-23 09:52:22] [INFO ] After 8245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Graph (complete) has 862 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 103 transition count 7185
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 87 transition count 7169
Free-agglomeration rule applied 49 times.
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 87 transition count 7120
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 1 with 307 rules applied. Total rules applied 406 place count 37 transition count 6863
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 414 place count 29 transition count 6855
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 29 transition count 6855
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 677 place count 29 transition count 6600
Performed 8 Post agglomeration using F-continuation condition with reduction of 5292 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 693 place count 21 transition count 1300
Drop transitions removed 8 transitions
Ensure Unique test removed 1024 transitions
Reduce isomorphic transitions removed 1032 transitions.
Iterating post reduction 3 with 1032 rules applied. Total rules applied 1725 place count 21 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1733 place count 17 transition count 264
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1734 place count 16 transition count 263
Applied a total of 1734 rules in 1456 ms. Remains 16 /104 variables (removed 88) and now considering 263/7203 (removed 6940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1456 ms. Remains : 16/104 places, 263/7203 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Applied a total of 0 rules in 645 ms. Remains 104 /104 variables (removed 0) and now considering 7203/7203 (removed 0) transitions.
[2023-03-23 09:52:24] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:24] [INFO ] Invariant cache hit.
[2023-03-23 09:52:26] [INFO ] Implicit Places using invariants in 1647 ms returned []
[2023-03-23 09:52:26] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:26] [INFO ] Invariant cache hit.
[2023-03-23 09:52:29] [INFO ] Implicit Places using invariants and state equation in 2875 ms returned []
Implicit Place search using SMT with State Equation took 4524 ms to find 0 implicit places.
[2023-03-23 09:52:30] [INFO ] Redundant transitions in 1184 ms returned []
[2023-03-23 09:52:30] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:30] [INFO ] Invariant cache hit.
[2023-03-23 09:52:37] [INFO ] Dead Transitions using invariants and state equation in 7125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13487 ms. Remains : 104/104 places, 7203/7203 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 663 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100054 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100054 steps, saw 29062 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 09:52:40] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:40] [INFO ] Invariant cache hit.
[2023-03-23 09:52:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:52:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:52:43] [INFO ] After 2464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:52:43] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:52:47] [INFO ] After 4201ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:52:48] [INFO ] After 4484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-23 09:52:48] [INFO ] After 7394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Graph (complete) has 862 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 103 transition count 7185
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 87 transition count 7169
Free-agglomeration rule applied 49 times.
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 87 transition count 7120
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 1 with 307 rules applied. Total rules applied 406 place count 37 transition count 6863
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 414 place count 29 transition count 6855
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 29 transition count 6855
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 677 place count 29 transition count 6600
Performed 8 Post agglomeration using F-continuation condition with reduction of 5292 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 693 place count 21 transition count 1300
Drop transitions removed 8 transitions
Ensure Unique test removed 1024 transitions
Reduce isomorphic transitions removed 1032 transitions.
Iterating post reduction 3 with 1032 rules applied. Total rules applied 1725 place count 21 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1733 place count 17 transition count 264
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1734 place count 16 transition count 263
Applied a total of 1734 rules in 1419 ms. Remains 16 /104 variables (removed 88) and now considering 263/7203 (removed 6940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 ms. Remains : 16/104 places, 263/7203 transitions.
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6662 reset in 1565 ms.
Product exploration explored 100000 steps with 6622 reset in 1578 ms.
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 7203/7203 transitions.
Applied a total of 0 rules in 626 ms. Remains 104 /104 variables (removed 0) and now considering 7203/7203 (removed 0) transitions.
[2023-03-23 09:52:53] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:53] [INFO ] Invariant cache hit.
[2023-03-23 09:52:55] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2023-03-23 09:52:55] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:55] [INFO ] Invariant cache hit.
[2023-03-23 09:52:58] [INFO ] Implicit Places using invariants and state equation in 2655 ms returned []
Implicit Place search using SMT with State Equation took 4318 ms to find 0 implicit places.
[2023-03-23 09:52:59] [INFO ] Redundant transitions in 1162 ms returned []
[2023-03-23 09:52:59] [INFO ] Flow matrix only has 7194 transitions (discarded 9 similar events)
[2023-03-23 09:52:59] [INFO ] Invariant cache hit.
[2023-03-23 09:53:06] [INFO ] Dead Transitions using invariants and state equation in 6707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12826 ms. Remains : 104/104 places, 7203/7203 transitions.
Treatment of property StigmergyElection-PT-08b-LTLFireability-09 finished in 78262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 194 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2023-03-23 09:53:08] [INFO ] Computed 9 place invariants in 262 ms
[2023-03-23 09:53:13] [INFO ] Implicit Places using invariants in 4405 ms returned []
Implicit Place search using SMT only with invariants took 4407 ms to find 0 implicit places.
[2023-03-23 09:53:13] [INFO ] Invariant cache hit.
[2023-03-23 09:53:27] [INFO ] Dead Transitions using invariants and state equation in 14507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19113 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s25 0) (EQ s153 0) (EQ s237 0) (EQ s343 0) (EQ s471 0) (EQ s566 0) (EQ s661 0) (EQ s778 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1680 ms.
Product exploration explored 100000 steps with 33333 reset in 1519 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08b-LTLFireability-10 finished in 22778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1&&X(F(p1))))&&p0)))'
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 116 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:53:31] [INFO ] Invariant cache hit.
[2023-03-23 09:53:34] [INFO ] Implicit Places using invariants in 3139 ms returned []
Implicit Place search using SMT only with invariants took 3140 ms to find 0 implicit places.
[2023-03-23 09:53:34] [INFO ] Invariant cache hit.
[2023-03-23 09:53:50] [INFO ] Dead Transitions using invariants and state equation in 15827 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19084 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s72 0) (EQ s189 0) (EQ s284 0) (EQ s390 0) (EQ s496 0) (EQ s602 0) (EQ s697 0) (EQ s814 0)), p0:(AND (EQ s47 1) (EQ s131 1) (EQ s259 1) (EQ s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-11 finished in 19273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2))))'
Support contains 22 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 105 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:53:50] [INFO ] Invariant cache hit.
[2023-03-23 09:53:53] [INFO ] Implicit Places using invariants in 2606 ms returned []
Implicit Place search using SMT only with invariants took 2610 ms to find 0 implicit places.
[2023-03-23 09:53:53] [INFO ] Invariant cache hit.
[2023-03-23 09:54:05] [INFO ] Dead Transitions using invariants and state equation in 12608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15324 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s72 1) (EQ s189 1) (EQ s284 1) (EQ s390 1) (EQ s496 1) (EQ s602 1) (EQ s719 1) (EQ s814 1)), p2:(OR (EQ s47 0) (EQ s131 0) (EQ s237 0) (EQ s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 723 reset in 847 ms.
Product exploration explored 100000 steps with 725 reset in 762 ms.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 51872 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51872 steps, saw 13389 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 09:54:11] [INFO ] Invariant cache hit.
[2023-03-23 09:54:11] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-23 09:54:18] [INFO ] After 6360ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 09:54:18] [INFO ] After 7121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-23 09:54:19] [INFO ] After 7686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-23 09:54:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-23 09:54:26] [INFO ] After 6970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 09:54:28] [INFO ] After 9140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 986 ms.
[2023-03-23 09:54:29] [INFO ] After 10363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 16 out of 870 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 104 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
[2023-03-23 09:54:30] [INFO ] Invariant cache hit.
[2023-03-23 09:54:32] [INFO ] Implicit Places using invariants in 2600 ms returned []
Implicit Place search using SMT only with invariants took 2602 ms to find 0 implicit places.
[2023-03-23 09:54:32] [INFO ] Invariant cache hit.
[2023-03-23 09:54:47] [INFO ] Dead Transitions using invariants and state equation in 15027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17737 ms. Remains : 870/870 places, 14327/14327 transitions.
Computed a total of 120 stabilizing places and 128 stable transitions
Computed a total of 120 stabilizing places and 128 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 51580 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51580 steps, saw 13300 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 09:54:51] [INFO ] Invariant cache hit.
[2023-03-23 09:54:52] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-23 09:54:59] [INFO ] After 7016ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 09:54:59] [INFO ] After 7768ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-23 09:55:00] [INFO ] After 8335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-23 09:55:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-23 09:55:07] [INFO ] After 6920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 09:55:09] [INFO ] After 9009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 996 ms.
[2023-03-23 09:55:10] [INFO ] After 10235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 725 reset in 752 ms.
Product exploration explored 100000 steps with 725 reset in 763 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 877 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 758 transition count 14199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 514 place count 758 transition count 14191
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 514 place count 758 transition count 14199
Deduced a syphon composed of 521 places in 9 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 530 place count 758 transition count 14199
Discarding 430 places :
Symmetric choice reduction at 2 with 430 rule applications. Total rules 960 place count 328 transition count 13769
Deduced a syphon composed of 98 places in 9 ms
Iterating global reduction 2 with 430 rules applied. Total rules applied 1390 place count 328 transition count 13769
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 4 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 1455 place count 328 transition count 13769
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1532 place count 251 transition count 9055
Deduced a syphon composed of 106 places in 2 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1609 place count 251 transition count 9055
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1613 place count 251 transition count 9051
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1633 place count 231 transition count 9023
Deduced a syphon composed of 94 places in 3 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 1653 place count 231 transition count 9023
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1661 place count 223 transition count 9015
Deduced a syphon composed of 94 places in 3 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1669 place count 223 transition count 9015
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 105 places in 2 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1680 place count 223 transition count 9068
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1699 place count 204 transition count 9030
Deduced a syphon composed of 86 places in 2 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 1718 place count 204 transition count 9030
Deduced a syphon composed of 86 places in 2 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 1738 place count 204 transition count 9010
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 87 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1739 place count 204 transition count 9023
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1740 place count 203 transition count 9021
Deduced a syphon composed of 86 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1741 place count 203 transition count 9021
Deduced a syphon composed of 86 places in 3 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1745 place count 203 transition count 9017
Deduced a syphon composed of 86 places in 2 ms
Applied a total of 1745 rules in 5918 ms. Remains 203 /870 variables (removed 667) and now considering 9017/14327 (removed 5310) transitions.
[2023-03-23 09:55:21] [INFO ] Redundant transitions in 2293 ms returned []
[2023-03-23 09:55:21] [INFO ] Flow matrix only has 9008 transitions (discarded 9 similar events)
// Phase 1: matrix 9008 rows 203 cols
[2023-03-23 09:55:21] [INFO ] Computed 2 place invariants in 84 ms
[2023-03-23 09:55:28] [INFO ] Dead Transitions using invariants and state equation in 7457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/870 places, 9017/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15677 ms. Remains : 203/870 places, 9017/14327 transitions.
Support contains 16 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 119 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2023-03-23 09:55:29] [INFO ] Computed 9 place invariants in 255 ms
[2023-03-23 09:55:32] [INFO ] Implicit Places using invariants in 3389 ms returned []
Implicit Place search using SMT only with invariants took 3394 ms to find 0 implicit places.
[2023-03-23 09:55:32] [INFO ] Invariant cache hit.
[2023-03-23 09:55:44] [INFO ] Dead Transitions using invariants and state equation in 12518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16034 ms. Remains : 870/870 places, 14327/14327 transitions.
Treatment of property StigmergyElection-PT-08b-LTLFireability-12 finished in 116111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 885 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 757 transition count 13685
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 529 rules applied. Total rules applied 1043 place count 244 transition count 13669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1051 place count 236 transition count 13669
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1051 place count 236 transition count 13636
Deduced a syphon composed of 33 places in 8 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1117 place count 203 transition count 13636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1124 place count 196 transition count 13629
Iterating global reduction 3 with 7 rules applied. Total rules applied 1131 place count 196 transition count 13629
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1209 place count 157 transition count 13590
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1237 place count 129 transition count 1996
Iterating global reduction 3 with 28 rules applied. Total rules applied 1265 place count 129 transition count 1996
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1277 place count 129 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1285 place count 121 transition count 1968
Iterating global reduction 4 with 8 rules applied. Total rules applied 1293 place count 121 transition count 1968
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1301 place count 113 transition count 1952
Iterating global reduction 4 with 8 rules applied. Total rules applied 1309 place count 113 transition count 1952
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1333 place count 101 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1334 place count 100 transition count 1943
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 100 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1336 place count 100 transition count 1942
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1344 place count 100 transition count 1934
Applied a total of 1344 rules in 2344 ms. Remains 100 /870 variables (removed 770) and now considering 1934/14327 (removed 12393) transitions.
[2023-03-23 09:55:49] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
// Phase 1: matrix 1925 rows 100 cols
[2023-03-23 09:55:49] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 09:55:49] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-23 09:55:49] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:55:49] [INFO ] Invariant cache hit.
[2023-03-23 09:55:50] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:55:51] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 2612 ms to find 0 implicit places.
[2023-03-23 09:55:51] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-23 09:55:51] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:55:51] [INFO ] Invariant cache hit.
[2023-03-23 09:55:53] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/870 places, 1934/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6595 ms. Remains : 100/870 places, 1934/14327 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-13 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 (NEQ s5 1) (NEQ s17 1) (NEQ s30 1) (NEQ s42 1) (NEQ s53 1) (NEQ s67 1) (NEQ s78 1) (NEQ s90 1))], 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 6572 reset in 686 ms.
Product exploration explored 100000 steps with 6588 reset in 686 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 666 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 393927 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393927 steps, saw 103517 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 09:55:58] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:55:58] [INFO ] Invariant cache hit.
[2023-03-23 09:55:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:55:58] [INFO ] After 585ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 09:55:58] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:55:59] [INFO ] After 969ms SMT Verify possible using 255 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-23 09:55:59] [INFO ] After 1055ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-23 09:55:59] [INFO ] After 1781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 1934/1934 transitions.
Graph (complete) has 798 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 99 transition count 1916
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 83 transition count 1900
Free-agglomeration rule applied 45 times.
Iterating global reduction 1 with 45 rules applied. Total rules applied 95 place count 83 transition count 1855
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 158 place count 37 transition count 1838
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 166 place count 29 transition count 1830
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 29 transition count 1830
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 429 place count 29 transition count 1575
Performed 8 Post agglomeration using F-continuation condition with reduction of 1215 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 445 place count 21 transition count 352
Drop transitions removed 8 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 529 place count 21 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 537 place count 17 transition count 264
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 538 place count 16 transition count 263
Applied a total of 538 rules in 279 ms. Remains 16 /100 variables (removed 84) and now considering 263/1934 (removed 1671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 16/100 places, 263/1934 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 1934/1934 transitions.
Applied a total of 0 rules in 145 ms. Remains 100 /100 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2023-03-23 09:56:00] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:00] [INFO ] Invariant cache hit.
[2023-03-23 09:56:01] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-23 09:56:01] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:01] [INFO ] Invariant cache hit.
[2023-03-23 09:56:01] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:56:03] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
[2023-03-23 09:56:03] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-23 09:56:03] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:03] [INFO ] Invariant cache hit.
[2023-03-23 09:56:04] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4585 ms. Remains : 100/100 places, 1934/1934 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 662 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396597 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396597 steps, saw 103866 distinct states, run finished after 3003 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 09:56:08] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:08] [INFO ] Invariant cache hit.
[2023-03-23 09:56:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:56:08] [INFO ] After 580ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 09:56:08] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:56:09] [INFO ] After 959ms SMT Verify possible using 255 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-23 09:56:10] [INFO ] After 1044ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-23 09:56:10] [INFO ] After 1765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 1934/1934 transitions.
Graph (complete) has 798 edges and 100 vertex of which 99 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 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 99 transition count 1916
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 83 transition count 1900
Free-agglomeration rule applied 45 times.
Iterating global reduction 1 with 45 rules applied. Total rules applied 95 place count 83 transition count 1855
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 158 place count 37 transition count 1838
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 166 place count 29 transition count 1830
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 29 transition count 1830
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 429 place count 29 transition count 1575
Performed 8 Post agglomeration using F-continuation condition with reduction of 1215 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 445 place count 21 transition count 352
Drop transitions removed 8 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 529 place count 21 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 537 place count 17 transition count 264
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 538 place count 16 transition count 263
Applied a total of 538 rules in 276 ms. Remains 16 /100 variables (removed 84) and now considering 263/1934 (removed 1671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 16/100 places, 263/1934 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6592 reset in 672 ms.
Product exploration explored 100000 steps with 6630 reset in 678 ms.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 1934/1934 transitions.
Applied a total of 0 rules in 142 ms. Remains 100 /100 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2023-03-23 09:56:12] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:12] [INFO ] Invariant cache hit.
[2023-03-23 09:56:12] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-23 09:56:12] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:12] [INFO ] Invariant cache hit.
[2023-03-23 09:56:13] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:56:14] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2539 ms to find 0 implicit places.
[2023-03-23 09:56:14] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-23 09:56:14] [INFO ] Flow matrix only has 1925 transitions (discarded 9 similar events)
[2023-03-23 09:56:14] [INFO ] Invariant cache hit.
[2023-03-23 09:56:16] [INFO ] Dead Transitions using invariants and state equation in 1942 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4719 ms. Remains : 100/100 places, 1934/1934 transitions.
Treatment of property StigmergyElection-PT-08b-LTLFireability-13 finished in 32339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(F(p1)))))))'
Support contains 17 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Applied a total of 0 rules in 121 ms. Remains 870 /870 variables (removed 0) and now considering 14327/14327 (removed 0) transitions.
// Phase 1: matrix 14327 rows 870 cols
[2023-03-23 09:56:19] [INFO ] Computed 9 place invariants in 251 ms
[2023-03-23 09:56:22] [INFO ] Implicit Places using invariants in 3442 ms returned []
Implicit Place search using SMT only with invariants took 3443 ms to find 0 implicit places.
[2023-03-23 09:56:22] [INFO ] Invariant cache hit.
[2023-03-23 09:56:35] [INFO ] Dead Transitions using invariants and state equation in 13485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17051 ms. Remains : 870/870 places, 14327/14327 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s83 1) (NEQ s178 1) (NEQ s295 1) (NEQ s390 1) (NEQ s496 1) (NEQ s602 1) (NEQ s719 1) (NEQ s825 1)), p0:(OR (AND (EQ s61 1) (EQ s178 1) (EQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08b-LTLFireability-14 finished in 17399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||X(p1)))||(p2 U G(!p3)))))'
Support contains 27 out of 870 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 870/870 places, 14327/14327 transitions.
Graph (trivial) has 866 edges and 870 vertex of which 136 / 870 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 495 place count 757 transition count 13704
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 510 rules applied. Total rules applied 1005 place count 263 transition count 13688
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1013 place count 255 transition count 13688
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1013 place count 255 transition count 13655
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1079 place count 222 transition count 13655
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1086 place count 215 transition count 13648
Iterating global reduction 3 with 7 rules applied. Total rules applied 1093 place count 215 transition count 13648
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1171 place count 176 transition count 13609
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1189 place count 158 transition count 9940
Iterating global reduction 3 with 18 rules applied. Total rules applied 1207 place count 158 transition count 9940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1209 place count 158 transition count 9938
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1217 place count 150 transition count 9922
Iterating global reduction 4 with 8 rules applied. Total rules applied 1225 place count 150 transition count 9922
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1233 place count 142 transition count 9906
Iterating global reduction 4 with 8 rules applied. Total rules applied 1241 place count 142 transition count 9906
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1265 place count 130 transition count 9913
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1266 place count 129 transition count 9897
Iterating global reduction 4 with 1 rules applied. Total rules applied 1267 place count 129 transition count 9897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1268 place count 129 transition count 9896
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1276 place count 129 transition count 9888
Applied a total of 1276 rules in 3653 ms. Remains 129 /870 variables (removed 741) and now considering 9888/14327 (removed 4439) transitions.
[2023-03-23 09:56:39] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
// Phase 1: matrix 9879 rows 129 cols
[2023-03-23 09:56:40] [INFO ] Computed 2 place invariants in 114 ms
[2023-03-23 09:56:41] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2023-03-23 09:56:41] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:56:41] [INFO ] Invariant cache hit.
[2023-03-23 09:56:42] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 2709 ms to find 0 implicit places.
[2023-03-23 09:56:44] [INFO ] Redundant transitions in 2134 ms returned []
[2023-03-23 09:56:44] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:56:44] [INFO ] Invariant cache hit.
[2023-03-23 09:56:53] [INFO ] Dead Transitions using invariants and state equation in 8783 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/870 places, 9888/14327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17289 ms. Remains : 129/870 places, 9888/14327 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s28 1) (EQ s42 1) (EQ s59 1) (EQ s74 1) (EQ s92 1) (EQ s106 1) (EQ s121 1)), p3:(AND (EQ s8 1) (EQ s24 1) (EQ s36 1) (EQ s51 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5898 reset in 1783 ms.
Product exploration explored 100000 steps with 5936 reset in 1770 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 660 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 76128 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76128 steps, saw 20852 distinct states, run finished after 3006 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-23 09:57:02] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:57:02] [INFO ] Invariant cache hit.
[2023-03-23 09:57:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:57:06] [INFO ] After 3739ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-23 09:57:07] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:57:13] [INFO ] After 6985ms SMT Verify possible using 255 Read/Feed constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-23 09:57:14] [INFO ] After 7403ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-23 09:57:14] [INFO ] After 11807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-23 09:57:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 09:57:19] [INFO ] After 5169ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-23 09:57:27] [INFO ] After 8042ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-23 09:57:31] [INFO ] After 11215ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1925 ms.
[2023-03-23 09:57:33] [INFO ] After 18431ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 27 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 9888/9888 transitions.
Graph (complete) has 977 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 128 transition count 9870
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 50 place count 112 transition count 9854
Free-agglomeration rule applied 55 times.
Iterating global reduction 1 with 55 rules applied. Total rules applied 105 place count 112 transition count 9799
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 162 place count 56 transition count 9798
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 170 place count 48 transition count 9790
Iterating global reduction 2 with 8 rules applied. Total rules applied 178 place count 48 transition count 9790
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 241 place count 48 transition count 9727
Performed 8 Post agglomeration using F-continuation condition with reduction of 2669 identical transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 257 place count 40 transition count 7050
Drop transitions removed 8 transitions
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 3 with 202 rules applied. Total rules applied 459 place count 40 transition count 6848
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 467 place count 36 transition count 6844
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 35 transition count 6843
Applied a total of 468 rules in 10770 ms. Remains 35 /129 variables (removed 94) and now considering 6843/9888 (removed 3045) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10770 ms. Remains : 35/129 places, 6843/9888 transitions.
Incomplete random walk after 10000 steps, including 1031 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Finished Best-First random walk after 1754 steps, including 0 resets, run visited all 8 properties in 14 ms. (steps per millisecond=125 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p0) p3 p2))), (G (NOT (AND (NOT p0) (NOT p1) p3 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p3)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (AND (NOT p0) p3 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 930 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p3 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 20 out of 129 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 : 129/129 places, 9888/9888 transitions.
Applied a total of 0 rules in 918 ms. Remains 129 /129 variables (removed 0) and now considering 9888/9888 (removed 0) transitions.
[2023-03-23 09:57:46] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:57:46] [INFO ] Invariant cache hit.
[2023-03-23 09:57:48] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2023-03-23 09:57:48] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:57:48] [INFO ] Invariant cache hit.
[2023-03-23 09:57:49] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2023-03-23 09:57:51] [INFO ] Redundant transitions in 2132 ms returned []
[2023-03-23 09:57:51] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:57:51] [INFO ] Invariant cache hit.
[2023-03-23 09:57:59] [INFO ] Dead Transitions using invariants and state equation in 8127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13848 ms. Remains : 129/129 places, 9888/9888 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p3 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 587 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81175 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81175 steps, saw 21761 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 09:58:03] [INFO ] Flow matrix only has 9879 transitions (discarded 9 similar events)
[2023-03-23 09:58:03] [INFO ] Invariant cache hit.
[2023-03-23 09:58:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:58:07] [INFO ] After 3506ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 09:58:07] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-23 09:58:13] [INFO ] After 6118ms SMT Verify possible using 255 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 09:58:14] [INFO ] After 6526ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-23 09:58:14] [INFO ] After 10636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 09:58:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 09:58:18] [INFO ] After 3754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:58:24] [INFO ] After 6343ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 09:58:25] [INFO ] After 7156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 485 ms.
[2023-03-23 09:58:25] [INFO ] After 11448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 9888/9888 transitions.
Graph (complete) has 977 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 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 0 with 24 rules applied. Total rules applied 25 place count 128 transition count 9863
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 32 place count 121 transition count 9863
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 119 transition count 6218
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 119 transition count 6218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 119 transition count 6216
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 70 place count 103 transition count 6200
Free-agglomeration rule applied 53 times.
Iterating global reduction 3 with 53 rules applied. Total rules applied 123 place count 103 transition count 6147
Reduce places removed 54 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 178 place count 49 transition count 6146
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 186 place count 41 transition count 6138
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 41 transition count 6138
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 261 place count 41 transition count 6071
Performed 8 Post agglomeration using F-continuation condition with reduction of 3806 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 277 place count 33 transition count 2257
Drop transitions removed 8 transitions
Ensure Unique test removed 674 transitions
Reduce isomorphic transitions removed 682 transitions.
Iterating post reduction 5 with 682 rules applied. Total rules applied 959 place count 33 transition count 1575
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 967 place count 29 transition count 1571
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 968 place count 28 transition count 1570
Applied a total of 968 rules in 2228 ms. Remains 28 /129 variables (removed 101) and now considering 1570/9888 (removed 8318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2228 ms. Remains : 28/129 places, 1570/9888 transitions.
Incomplete random walk after 10000 steps, including 1050 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :1
Finished Best-First random walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p3 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p3 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND p3 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5897 reset in 1779 ms.
Product exploration explored 100000 steps with 5917 reset in 1750 ms.
Support contains 20 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 9888/9888 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 129 transition count 9881
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 122 transition count 9881
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 120 transition count 6236
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 120 transition count 6236
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 120 transition count 6234
Applied a total of 20 rules in 795 ms. Remains 120 /129 variables (removed 9) and now considering 6234/9888 (removed 3654) transitions.
[2023-03-23 09:58:32] [INFO ] Flow matrix only has 6225 transitions (discarded 9 similar events)
// Phase 1: matrix 6225 rows 120 cols
[2023-03-23 09:58:33] [INFO ] Computed 2 place invariants in 64 ms
[2023-03-23 09:58:34] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2023-03-23 09:58:34] [INFO ] Flow matrix only has 6225 transitions (discarded 9 similar events)
[2023-03-23 09:58:34] [INFO ] Invariant cache hit.
[2023-03-23 09:58:36] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
[2023-03-23 09:58:37] [INFO ] Redundant transitions in 849 ms returned []
[2023-03-23 09:58:37] [INFO ] Flow matrix only has 6225 transitions (discarded 9 similar events)
[2023-03-23 09:58:37] [INFO ] Invariant cache hit.
[2023-03-23 09:58:43] [INFO ] Dead Transitions using invariants and state equation in 6246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/129 places, 6234/9888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11284 ms. Remains : 120/129 places, 6234/9888 transitions.
Treatment of property StigmergyElection-PT-08b-LTLFireability-15 finished in 129076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||X(p1)))||(p2 U G(!p3)))))'
[2023-03-23 09:58:47] [INFO ] Flatten gal took : 1327 ms
[2023-03-23 09:58:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-23 09:58:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 870 places, 14327 transitions and 216050 arcs took 145 ms.
Total runtime 583272 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1532/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyElection-PT-08b-LTLFireability-09
Could not compute solution for formula : StigmergyElection-PT-08b-LTLFireability-12
Could not compute solution for formula : StigmergyElection-PT-08b-LTLFireability-13
Could not compute solution for formula : StigmergyElection-PT-08b-LTLFireability-15
BK_STOP 1679565550415
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name StigmergyElection-PT-08b-LTLFireability-09
ltl formula formula --ltl=/tmp/1532/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 14327 transitions and 216050 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.100 real 0.940 user 0.510 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name StigmergyElection-PT-08b-LTLFireability-12
ltl formula formula --ltl=/tmp/1532/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 14327 transitions and 216050 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.150 real 0.880 user 0.550 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_1_
terminate called after throwing an instance of 'terminate called after throwing an instance of 'std::runtime_error'
std::runtime_error'
what(): terminate called after throwing an instance of 'std::runtime_error'
too many children for formula
what(): too many children for formula
what(): too many children for formula
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name StigmergyElection-PT-08b-LTLFireability-13
ltl formula formula --ltl=/tmp/1532/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 14327 transitions and 216050 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.110 real 1.010 user 0.560 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name StigmergyElection-PT-08b-LTLFireability-15
ltl formula formula --ltl=/tmp/1532/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 14327 transitions and 216050 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.090 real 0.950 user 0.670 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x56433c88a3f4]
1: pnml2lts-mc(+0xa2496) [0x56433c88a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f22e1327140]
3: pnml2lts-mc(+0x405be5) [0x56433cbedbe5]
4: pnml2lts-mc(+0x16b3f9) [0x56433c9533f9]
5: pnml2lts-mc(+0x164ac4) [0x56433c94cac4]
6: pnml2lts-mc(+0x272e0a) [0x56433ca5ae0a]
7: pnml2lts-mc(+0xb61f0) [0x56433c89e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f22e117a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f22e117a67a]
10: pnml2lts-mc(+0xa1581) [0x56433c889581]
11: pnml2lts-mc(+0xa1910) [0x56433c889910]
12: pnml2lts-mc(+0xa32a2) [0x56433c88b2a2]
13: pnml2lts-mc(+0x8e039) [0x56433c876039]
14: pnml2lts-mc(+0x8f01d) [0x56433c87701d]
15: pnml2lts-mc(+0x7fedb) [0x56433c867edb]
16: pnml2lts-mc(+0x6095d) [0x56433c84895d]
17: pnml2lts-mc(+0x609f0) [0x56433c8489f0]
18: pnml2lts-mc(+0x5eb0a) [0x56433c846b0a]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f22e1162d0a]
20: pnml2lts-mc(+0x6075e) [0x56433c84875e]
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="StigmergyElection-PT-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-08b, 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 r457-smll-167912649600660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08b.tgz
mv StigmergyElection-PT-08b 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 ;