About the Execution of ITS-Tools for StigmergyCommit-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 342304.00 | 0.00 | 0.00 | FTTFFFFTFFFFTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is StigmergyCommit-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490500012
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 231K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749050747814
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 15:25:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 15:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:25:50] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2025-06-04 15:25:50] [INFO ] Transformed 928 places.
[2025-06-04 15:25:50] [INFO ] Transformed 1040 transitions.
[2025-06-04 15:25:50] [INFO ] Found NUPN structural information;
[2025-06-04 15:25:50] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 857 transition count 969
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 857 transition count 969
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 183 place count 816 transition count 928
Iterating global reduction 0 with 41 rules applied. Total rules applied 224 place count 816 transition count 928
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 246 place count 794 transition count 906
Iterating global reduction 0 with 22 rules applied. Total rules applied 268 place count 794 transition count 906
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 286 place count 776 transition count 888
Iterating global reduction 0 with 18 rules applied. Total rules applied 304 place count 776 transition count 888
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 320 place count 760 transition count 872
Iterating global reduction 0 with 16 rules applied. Total rules applied 336 place count 760 transition count 872
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 352 place count 744 transition count 856
Iterating global reduction 0 with 16 rules applied. Total rules applied 368 place count 744 transition count 856
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 382 place count 730 transition count 842
Iterating global reduction 0 with 14 rules applied. Total rules applied 396 place count 730 transition count 842
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 410 place count 716 transition count 828
Iterating global reduction 0 with 14 rules applied. Total rules applied 424 place count 716 transition count 828
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 436 place count 704 transition count 816
Iterating global reduction 0 with 12 rules applied. Total rules applied 448 place count 704 transition count 816
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 456 place count 696 transition count 808
Iterating global reduction 0 with 8 rules applied. Total rules applied 464 place count 696 transition count 808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 467 place count 696 transition count 805
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 470 place count 693 transition count 802
Iterating global reduction 1 with 3 rules applied. Total rules applied 473 place count 693 transition count 802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 475 place count 691 transition count 800
Iterating global reduction 1 with 2 rules applied. Total rules applied 477 place count 691 transition count 800
Applied a total of 477 rules in 1270 ms. Remains 691 /928 variables (removed 237) and now considering 800/1040 (removed 240) transitions.
// Phase 1: matrix 800 rows 691 cols
[2025-06-04 15:25:52] [INFO ] Computed 4 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:25:53] [INFO ] Implicit Places using invariants in 971 ms returned []
[2025-06-04 15:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:25:54] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
Running 799 sub problems to find dead transitions.
[2025-06-04 15:25:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/1491 variables, and 0 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/691 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 799 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/1491 variables, and 0 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 0/691 constraints, PredecessorRefiner: 0/799 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60564ms problems are : Problem set: 0 solved, 799 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Starting structural reductions in LTL mode, iteration 1 : 691/928 places, 800/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64489 ms. Remains : 691/928 places, 800/1040 transitions.
Support contains 34 out of 691 places after structural reductions.
[2025-06-04 15:26:56] [INFO ] Flatten gal took : 183 ms
[2025-06-04 15:26:56] [INFO ] Flatten gal took : 85 ms
[2025-06-04 15:26:56] [INFO ] Input system was already deterministic with 800 transitions.
Support contains 33 out of 691 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (658 resets) in 3181 ms. (12 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4003 steps (15 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
[2025-06-04 15:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 651/677 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:58] [INFO ] Deduced a trap composed of 320 places in 320 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/677 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 14/691 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 800/1491 variables, 691/696 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1491 variables, 0/696 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1491/1491 variables, and 696 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 652/677 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/677 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:03] [INFO ] Deduced a trap composed of 325 places in 928 ms of which 300 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:04] [INFO ] Deduced a trap composed of 325 places in 608 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:05] [INFO ] Deduced a trap composed of 325 places in 816 ms of which 291 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:06] [INFO ] Deduced a trap composed of 321 places in 599 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:07] [INFO ] Deduced a trap composed of 323 places in 900 ms of which 336 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:07] [INFO ] Deduced a trap composed of 326 places in 666 ms of which 264 ms to minimize.
SMT process timed out in 10242ms, After SMT, problems are : Problem set: 1 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 800/800 transitions.
Graph (trivial) has 639 edges and 691 vertex of which 41 / 691 are part of one of the 7 SCC in 10 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 951 edges and 657 vertex of which 655 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 454 transitions
Trivial Post-agglo rules discarded 454 transitions
Performed 454 trivial Post agglomeration. Transition count delta: 454
Iterating post reduction 0 with 456 rules applied. Total rules applied 458 place count 655 transition count 299
Reduce places removed 454 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 463 rules applied. Total rules applied 921 place count 201 transition count 290
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 12 rules applied. Total rules applied 933 place count 196 transition count 283
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 941 place count 189 transition count 282
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 941 place count 189 transition count 243
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1019 place count 150 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1020 place count 149 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 1021 place count 149 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1021 place count 149 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1023 place count 148 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1024 place count 147 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 1025 place count 147 transition count 240
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1071 place count 124 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1076 place count 124 transition count 212
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1088 place count 112 transition count 179
Iterating global reduction 5 with 12 rules applied. Total rules applied 1100 place count 112 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1104 place count 112 transition count 175
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1107 place count 109 transition count 172
Iterating global reduction 6 with 3 rules applied. Total rules applied 1110 place count 109 transition count 172
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1112 place count 107 transition count 170
Iterating global reduction 6 with 2 rules applied. Total rules applied 1114 place count 107 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1115 place count 107 transition count 169
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1125 place count 102 transition count 164
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1133 place count 98 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1134 place count 98 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1136 place count 98 transition count 185
Free-agglomeration rule applied 22 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1158 place count 98 transition count 160
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1182 place count 76 transition count 158
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1184 place count 74 transition count 156
Iterating global reduction 9 with 2 rules applied. Total rules applied 1186 place count 74 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1199 place count 74 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1200 place count 74 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1201 place count 74 transition count 142
Applied a total of 1201 rules in 265 ms. Remains 74 /691 variables (removed 617) and now considering 142/800 (removed 658) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 74/691 places, 142/800 transitions.
RANDOM walk for 40000 steps (36 resets) in 585 ms. (68 steps per ms) remains 2/22 properties
BEST_FIRST walk for 22665 steps (22 resets) in 523 ms. (43 steps per ms) remains 0/2 properties
FORMULA StigmergyCommit-PT-02b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyCommit-PT-02b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyCommit-PT-02b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 134 stabilizing places and 140 stable transitions
FORMULA StigmergyCommit-PT-02b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p0&&G(p1)))||(G(p2)&&X(X(p3)))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 680 transition count 789
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 680 transition count 789
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 673 transition count 782
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 673 transition count 782
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 667 transition count 776
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 667 transition count 776
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 661 transition count 770
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 661 transition count 770
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 655 transition count 764
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 655 transition count 764
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 649 transition count 758
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 649 transition count 758
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 643 transition count 752
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 643 transition count 752
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 637 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 637 transition count 746
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 632 transition count 741
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 632 transition count 741
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 628 transition count 737
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 625 transition count 734
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 625 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 133 place count 625 transition count 733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 624 transition count 732
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 624 transition count 732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 623 transition count 731
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 622 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 622 transition count 730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 621 transition count 729
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 621 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 620 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 619 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 618 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 617 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 616 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 152 place count 615 transition count 723
Iterating global reduction 1 with 1 rules applied. Total rules applied 153 place count 615 transition count 723
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 154 place count 614 transition count 722
Iterating global reduction 1 with 1 rules applied. Total rules applied 155 place count 614 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 156 place count 614 transition count 721
Applied a total of 156 rules in 872 ms. Remains 614 /691 variables (removed 77) and now considering 721/800 (removed 79) transitions.
// Phase 1: matrix 721 rows 614 cols
[2025-06-04 15:27:10] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:27:10] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-04 15:27:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:27:11] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2025-06-04 15:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s230 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 720 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30225ms
Starting structural reductions in LTL mode, iteration 1 : 614/691 places, 721/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32631 ms. Remains : 614/691 places, 721/800 transitions.
Stuttering acceptance computed with spot in 904 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-00
Product exploration explored 100000 steps with 20006 reset in 570 ms.
Product exploration explored 100000 steps with 19932 reset in 481 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 192 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 509 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3))]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (653 resets) in 452 ms. (88 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40003 steps (161 resets) in 310 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (161 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (163 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (163 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (165 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (168 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
[2025-06-04 15:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 404/407 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:45] [INFO ] Deduced a trap composed of 291 places in 298 ms of which 66 ms to minimize.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:45] [INFO ] Deduced a trap composed of 292 places in 255 ms of which 68 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 2/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/614 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 721/1335 variables, 614/620 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/620 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/620 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 620 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 211/212 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 402/614 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 721/1335 variables, 614/620 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 1/621 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1335 variables, 0/621 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1335 variables, 0/621 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 621 constraints, problems are : Problem set: 5 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2013ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 721/721 transitions.
Graph (trivial) has 609 edges and 614 vertex of which 51 / 614 are part of one of the 9 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 848 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 429 rules applied. Total rules applied 431 place count 569 transition count 235
Reduce places removed 426 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 435 rules applied. Total rules applied 866 place count 143 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 869 place count 140 transition count 226
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 869 place count 140 transition count 189
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 943 place count 103 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 944 place count 103 transition count 188
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 990 place count 80 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 996 place count 80 transition count 159
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1015 place count 61 transition count 103
Iterating global reduction 5 with 19 rules applied. Total rules applied 1034 place count 61 transition count 103
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1044 place count 61 transition count 93
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1053 place count 52 transition count 84
Iterating global reduction 6 with 9 rules applied. Total rules applied 1062 place count 52 transition count 84
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1068 place count 46 transition count 78
Iterating global reduction 6 with 6 rules applied. Total rules applied 1074 place count 46 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1077 place count 46 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1083 place count 43 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1091 place count 39 transition count 99
Free-agglomeration rule applied 16 times with reduction of 11 identical transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1107 place count 39 transition count 72
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 1137 place count 23 transition count 58
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1140 place count 20 transition count 55
Iterating global reduction 8 with 3 rules applied. Total rules applied 1143 place count 20 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1146 place count 20 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1161 place count 20 transition count 37
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1163 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1164 place count 20 transition count 36
Applied a total of 1164 rules in 74 ms. Remains 20 /614 variables (removed 594) and now considering 36/721 (removed 685) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 20/614 places, 36/721 transitions.
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (AND (OR p0 (NOT p1) p3) (OR (NOT p2) (NOT p1) p3))), (G (OR (NOT p0) (NOT p2) (NOT p1) p3))]
False Knowledge obtained : [(F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) p1 p3)))), (F (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (F (NOT p3)), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (OR p0 p2) (OR p2 p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))
Knowledge based reduction with 23 factoid took 295 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-00 finished in 38481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 679 transition count 788
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 679 transition count 788
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 670 transition count 779
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 670 transition count 779
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 663 transition count 772
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 663 transition count 772
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 656 transition count 765
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 656 transition count 765
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 649 transition count 758
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 649 transition count 758
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 642 transition count 751
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 642 transition count 751
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 635 transition count 744
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 635 transition count 744
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 628 transition count 737
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 628 transition count 737
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 132 place count 622 transition count 731
Iterating global reduction 0 with 6 rules applied. Total rules applied 138 place count 622 transition count 731
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 143 place count 617 transition count 726
Iterating global reduction 0 with 5 rules applied. Total rules applied 148 place count 617 transition count 726
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 152 place count 613 transition count 722
Iterating global reduction 0 with 4 rules applied. Total rules applied 156 place count 613 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 157 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 159 place count 611 transition count 719
Iterating global reduction 1 with 2 rules applied. Total rules applied 161 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 163 place count 609 transition count 717
Iterating global reduction 1 with 2 rules applied. Total rules applied 165 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 167 place count 607 transition count 715
Iterating global reduction 1 with 2 rules applied. Total rules applied 169 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 170 place count 606 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 171 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 172 place count 605 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 173 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 174 place count 604 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 175 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 176 place count 603 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 177 place count 603 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 178 place count 602 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 179 place count 602 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 601 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 601 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 600 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 600 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 184 place count 599 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 185 place count 599 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 186 place count 599 transition count 706
Applied a total of 186 rules in 528 ms. Remains 599 /691 variables (removed 92) and now considering 706/800 (removed 94) transitions.
// Phase 1: matrix 706 rows 599 cols
[2025-06-04 15:27:48] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:27:48] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-06-04 15:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:27:49] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2025-06-04 15:27:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 30154ms
Starting structural reductions in LTL mode, iteration 1 : 599/691 places, 706/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31905 ms. Remains : 599/691 places, 706/800 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 (NOT p3) (NOT p2) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-02 finished in 32809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X((p0&&X(p1))))||(p1&&F(p2))))||G(p3)))'
Support contains 6 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 680 transition count 789
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 680 transition count 789
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 671 transition count 780
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 671 transition count 780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 664 transition count 773
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 664 transition count 773
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 657 transition count 766
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 657 transition count 766
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 650 transition count 759
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 650 transition count 759
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 643 transition count 752
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 643 transition count 752
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 636 transition count 745
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 636 transition count 745
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 629 transition count 738
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 629 transition count 738
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 130 place count 623 transition count 732
Iterating global reduction 0 with 6 rules applied. Total rules applied 136 place count 623 transition count 732
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 141 place count 618 transition count 727
Iterating global reduction 0 with 5 rules applied. Total rules applied 146 place count 618 transition count 727
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 150 place count 614 transition count 723
Iterating global reduction 0 with 4 rules applied. Total rules applied 154 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 155 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 612 transition count 720
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 612 transition count 720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 161 place count 610 transition count 718
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 610 transition count 718
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 165 place count 608 transition count 716
Iterating global reduction 1 with 2 rules applied. Total rules applied 167 place count 608 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 169 place count 606 transition count 714
Iterating global reduction 1 with 2 rules applied. Total rules applied 171 place count 606 transition count 714
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 173 place count 604 transition count 712
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 604 transition count 712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 176 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 603 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 602 transition count 709
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 601 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 600 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 599 transition count 706
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 598 transition count 705
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 598 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 598 transition count 704
Applied a total of 189 rules in 635 ms. Remains 598 /691 variables (removed 93) and now considering 704/800 (removed 96) transitions.
// Phase 1: matrix 704 rows 598 cols
[2025-06-04 15:28:21] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:28:21] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-04 15:28:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:28:22] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-06-04 15:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 30143ms
Starting structural reductions in LTL mode, iteration 1 : 598/691 places, 704/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32124 ms. Remains : 598/691 places, 704/800 transitions.
Stuttering acceptance computed with spot in 1101 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-03 finished in 33274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Graph (trivial) has 682 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 3 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 647 transition count 268
Reduce places removed 482 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 489 rules applied. Total rules applied 972 place count 165 transition count 261
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 975 place count 162 transition count 261
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 975 place count 162 transition count 224
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1049 place count 125 transition count 224
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1058 place count 116 transition count 214
Iterating global reduction 3 with 9 rules applied. Total rules applied 1067 place count 116 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1067 place count 116 transition count 212
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1071 place count 114 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1077 place count 108 transition count 205
Iterating global reduction 3 with 6 rules applied. Total rules applied 1083 place count 108 transition count 205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1086 place count 105 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 1089 place count 105 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 105 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1091 place count 104 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 1092 place count 104 transition count 199
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1132 place count 84 transition count 177
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1149 place count 67 transition count 126
Iterating global reduction 4 with 17 rules applied. Total rules applied 1166 place count 67 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1174 place count 67 transition count 118
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1183 place count 58 transition count 107
Iterating global reduction 5 with 9 rules applied. Total rules applied 1192 place count 58 transition count 107
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1201 place count 49 transition count 96
Iterating global reduction 5 with 9 rules applied. Total rules applied 1210 place count 49 transition count 96
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1215 place count 49 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1229 place count 42 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1230 place count 41 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 1231 place count 41 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1232 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1235 place count 41 transition count 90
Applied a total of 1235 rules in 100 ms. Remains 41 /691 variables (removed 650) and now considering 90/800 (removed 710) transitions.
[2025-06-04 15:28:53] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 41 cols
[2025-06-04 15:28:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:28:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 15:28:53] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-04 15:28:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:28:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 15:28:54] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:28:54] [INFO ] Redundant transitions in 3 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-04 15:28:54] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-04 15:28:54] [INFO ] Invariant cache hit.
[2025-06-04 15:28:54] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:54] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:55] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:55] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:55] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:55] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:28:59] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/127 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 66 constraints, problems are : Problem set: 0 solved, 81 unsolved in 8175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 85/126 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 81/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:04] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 1/127 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 11407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19622ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 19624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/691 places, 90/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19979 ms. Remains : 41/691 places, 90/800 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-04 finished in 20108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Graph (trivial) has 682 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 6 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 482 place count 647 transition count 269
Reduce places removed 481 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 488 rules applied. Total rules applied 970 place count 166 transition count 262
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 974 place count 163 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 975 place count 162 transition count 261
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 975 place count 162 transition count 224
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1049 place count 125 transition count 224
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1058 place count 116 transition count 214
Iterating global reduction 4 with 9 rules applied. Total rules applied 1067 place count 116 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1067 place count 116 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1071 place count 114 transition count 212
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1077 place count 108 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 1083 place count 108 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1084 place count 108 transition count 204
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1087 place count 105 transition count 200
Iterating global reduction 5 with 3 rules applied. Total rules applied 1090 place count 105 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1091 place count 105 transition count 199
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1092 place count 104 transition count 198
Iterating global reduction 6 with 1 rules applied. Total rules applied 1093 place count 104 transition count 198
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1133 place count 84 transition count 176
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1150 place count 67 transition count 125
Iterating global reduction 6 with 17 rules applied. Total rules applied 1167 place count 67 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1175 place count 67 transition count 117
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1184 place count 58 transition count 106
Iterating global reduction 7 with 9 rules applied. Total rules applied 1193 place count 58 transition count 106
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1202 place count 49 transition count 95
Iterating global reduction 7 with 9 rules applied. Total rules applied 1211 place count 49 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1216 place count 49 transition count 90
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1230 place count 42 transition count 99
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1231 place count 41 transition count 93
Iterating global reduction 8 with 1 rules applied. Total rules applied 1232 place count 41 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1233 place count 41 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1236 place count 41 transition count 89
Applied a total of 1236 rules in 77 ms. Remains 41 /691 variables (removed 650) and now considering 89/800 (removed 711) transitions.
[2025-06-04 15:29:13] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 41 cols
[2025-06-04 15:29:13] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 15:29:14] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-04 15:29:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 15:29:14] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:29:14] [INFO ] Redundant transitions in 3 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-04 15:29:14] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2025-06-04 15:29:14] [INFO ] Invariant cache hit.
[2025-06-04 15:29:14] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:14] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:15] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:15] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:15] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/125 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:16] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 66 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/125 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:22] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:29:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 1/126 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 148 constraints, problems are : Problem set: 0 solved, 80 unsolved in 11485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18178ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 18179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/691 places, 89/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18481 ms. Remains : 41/691 places, 89/800 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-05
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-05 finished in 18550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(X(G(p1))))))&&F(p2)))'
Support contains 5 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 679 transition count 788
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 679 transition count 788
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 671 transition count 780
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 671 transition count 780
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 665 transition count 774
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 665 transition count 774
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 659 transition count 768
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 659 transition count 768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 653 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 653 transition count 762
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 647 transition count 756
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 647 transition count 756
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 641 transition count 750
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 641 transition count 750
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 635 transition count 744
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 635 transition count 744
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 630 transition count 739
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 630 transition count 739
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 626 transition count 735
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 623 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 623 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 137 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 622 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 622 transition count 730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 621 transition count 729
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 621 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 620 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 619 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 618 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 618 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 148 place count 618 transition count 725
Applied a total of 148 rules in 470 ms. Remains 618 /691 variables (removed 73) and now considering 725/800 (removed 75) transitions.
// Phase 1: matrix 725 rows 618 cols
[2025-06-04 15:29:32] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:33] [INFO ] Implicit Places using invariants in 642 ms returned []
[2025-06-04 15:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:34] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2025-06-04 15:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 30167ms
Starting structural reductions in LTL mode, iteration 1 : 618/691 places, 725/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32409 ms. Remains : 618/691 places, 725/800 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-06 finished in 32815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 691 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Graph (trivial) has 680 edges and 691 vertex of which 52 / 691 are part of one of the 9 SCC in 7 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 481 place count 647 transition count 270
Reduce places removed 480 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 487 rules applied. Total rules applied 968 place count 167 transition count 263
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 972 place count 164 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 973 place count 163 transition count 262
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 973 place count 163 transition count 226
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1045 place count 127 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1053 place count 119 transition count 217
Iterating global reduction 4 with 8 rules applied. Total rules applied 1061 place count 119 transition count 217
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1061 place count 119 transition count 215
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1065 place count 117 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1070 place count 112 transition count 209
Iterating global reduction 4 with 5 rules applied. Total rules applied 1075 place count 112 transition count 209
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1078 place count 109 transition count 205
Iterating global reduction 4 with 3 rules applied. Total rules applied 1081 place count 109 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1082 place count 109 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1083 place count 108 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 1084 place count 108 transition count 203
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1126 place count 87 transition count 180
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1143 place count 70 transition count 129
Iterating global reduction 5 with 17 rules applied. Total rules applied 1160 place count 70 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1168 place count 70 transition count 121
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1177 place count 61 transition count 110
Iterating global reduction 6 with 9 rules applied. Total rules applied 1186 place count 61 transition count 110
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1195 place count 52 transition count 99
Iterating global reduction 6 with 9 rules applied. Total rules applied 1204 place count 52 transition count 99
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1209 place count 52 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1223 place count 45 transition count 103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 44 transition count 97
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 44 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1226 place count 44 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1229 place count 44 transition count 93
Applied a total of 1229 rules in 68 ms. Remains 44 /691 variables (removed 647) and now considering 93/800 (removed 707) transitions.
[2025-06-04 15:30:05] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 44 cols
[2025-06-04 15:30:05] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-04 15:30:05] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 15:30:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 15:30:05] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:30:05] [INFO ] Redundant transitions in 3 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-04 15:30:05] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2025-06-04 15:30:05] [INFO ] Invariant cache hit.
[2025-06-04 15:30:05] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:06] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:06] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 88/132 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:10] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/133 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:11] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 68 constraints, problems are : Problem set: 0 solved, 84 unsolved in 8947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:15] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 88/132 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 84/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/133 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 154 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18245ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 18247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/691 places, 93/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18674 ms. Remains : 44/691 places, 93/800 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-10 finished in 18805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(p0)||G(p1)))&&F(p1)))))'
Support contains 2 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 678 transition count 787
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 678 transition count 787
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 669 transition count 778
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 669 transition count 778
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 662 transition count 771
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 662 transition count 771
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 655 transition count 764
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 655 transition count 764
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 648 transition count 757
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 648 transition count 757
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 641 transition count 750
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 641 transition count 750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 634 transition count 743
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 634 transition count 743
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 627 transition count 736
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 627 transition count 736
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 621 transition count 730
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 621 transition count 730
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 145 place count 616 transition count 725
Iterating global reduction 0 with 5 rules applied. Total rules applied 150 place count 616 transition count 725
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 154 place count 612 transition count 721
Iterating global reduction 0 with 4 rules applied. Total rules applied 158 place count 612 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 159 place count 612 transition count 720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 161 place count 610 transition count 718
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 610 transition count 718
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 165 place count 608 transition count 716
Iterating global reduction 1 with 2 rules applied. Total rules applied 167 place count 608 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 169 place count 606 transition count 714
Iterating global reduction 1 with 2 rules applied. Total rules applied 171 place count 606 transition count 714
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 173 place count 604 transition count 712
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 604 transition count 712
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 177 place count 602 transition count 710
Iterating global reduction 1 with 2 rules applied. Total rules applied 179 place count 602 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 601 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 600 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 599 transition count 706
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 598 transition count 705
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 597 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 597 transition count 704
Applied a total of 190 rules in 673 ms. Remains 597 /691 variables (removed 94) and now considering 704/800 (removed 96) transitions.
// Phase 1: matrix 704 rows 597 cols
[2025-06-04 15:30:24] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:25] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-04 15:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:26] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-06-04 15:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 30143ms
Starting structural reductions in LTL mode, iteration 1 : 597/691 places, 704/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32225 ms. Remains : 597/691 places, 704/800 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-11
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-11 finished in 32675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F((p1&&G(p2)))&&G(p3))))))'
Support contains 3 out of 691 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 691/691 places, 800/800 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 679 transition count 788
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 679 transition count 788
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 671 transition count 780
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 671 transition count 780
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 665 transition count 774
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 665 transition count 774
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 659 transition count 768
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 659 transition count 768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 653 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 653 transition count 762
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 647 transition count 756
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 647 transition count 756
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 641 transition count 750
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 641 transition count 750
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 635 transition count 744
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 635 transition count 744
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 630 transition count 739
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 630 transition count 739
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 626 transition count 735
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 623 transition count 732
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 138 place count 621 transition count 730
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 619 transition count 728
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 146 place count 617 transition count 726
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 615 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 154 place count 613 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 156 place count 613 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 157 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 158 place count 612 transition count 720
Iterating global reduction 1 with 1 rules applied. Total rules applied 159 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 611 transition count 719
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 611 transition count 719
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 162 place count 610 transition count 718
Iterating global reduction 1 with 1 rules applied. Total rules applied 163 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 164 place count 609 transition count 717
Iterating global reduction 1 with 1 rules applied. Total rules applied 165 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 166 place count 608 transition count 716
Iterating global reduction 1 with 1 rules applied. Total rules applied 167 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 168 place count 607 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 169 place count 607 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 607 transition count 714
Applied a total of 170 rules in 555 ms. Remains 607 /691 variables (removed 84) and now considering 714/800 (removed 86) transitions.
// Phase 1: matrix 714 rows 607 cols
[2025-06-04 15:30:57] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:57] [INFO ] Implicit Places using invariants in 516 ms returned []
[2025-06-04 15:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:58] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2025-06-04 15:30:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Starting structural reductions in LTL mode, iteration 1 : 607/691 places, 714/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32204 ms. Remains : 607/691 places, 714/800 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Product exploration explored 100000 steps with 50000 reset in 360 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p1) p2), (X p2), (X p3), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 27 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-15 finished in 33329 ms.
All properties solved by simple procedures.
Total runtime 339999 ms.
BK_STOP 1749051090118
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02b, 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 r226-smll-174903490500012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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.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 ;