Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266300164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716516628943

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 02:10:31] [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]
[2024-05-24 02:10:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:10:32] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-24 02:10:32] [INFO ] Transformed 295 places.
[2024-05-24 02:10:32] [INFO ] Transformed 800 transitions.
[2024-05-24 02:10:32] [INFO ] Found NUPN structural information;
[2024-05-24 02:10:32] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 280 transition count 725
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 280 transition count 725
Applied a total of 30 rules in 153 ms. Remains 280 /295 variables (removed 15) and now considering 725/800 (removed 75) transitions.
[2024-05-24 02:10:32] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
// Phase 1: matrix 390 rows 280 cols
[2024-05-24 02:10:32] [INFO ] Computed 16 invariants in 39 ms
[2024-05-24 02:10:33] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-24 02:10:33] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 02:10:33] [INFO ] Invariant cache hit.
[2024-05-24 02:10:34] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-24 02:10:34] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-05-24 02:10:34] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 02:10:34] [INFO ] Invariant cache hit.
[2024-05-24 02:10:35] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:10:43] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 34 ms to minimize.
[2024-05-24 02:10:43] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:10:44] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:10:44] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 5 ms to minimize.
[2024-05-24 02:10:44] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:10:44] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 4 ms to minimize.
[2024-05-24 02:10:45] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 4 ms to minimize.
[2024-05-24 02:10:45] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 4 ms to minimize.
[2024-05-24 02:10:45] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 5 ms to minimize.
[2024-05-24 02:10:45] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:10:46] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 4 ms to minimize.
[2024-05-24 02:10:47] [INFO ] Deduced a trap composed of 68 places in 429 ms of which 4 ms to minimize.
[2024-05-24 02:10:47] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 4 ms to minimize.
[2024-05-24 02:10:47] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:10:47] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 5 ms to minimize.
[2024-05-24 02:10:48] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:10:48] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 4 ms to minimize.
[2024-05-24 02:10:48] [INFO ] Deduced a trap composed of 76 places in 278 ms of which 5 ms to minimize.
[2024-05-24 02:10:48] [INFO ] Deduced a trap composed of 99 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:10:49] [INFO ] Deduced a trap composed of 80 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:10:49] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:10:49] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:10:50] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:10:51] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 6 ms to minimize.
[2024-05-24 02:10:51] [INFO ] Deduced a trap composed of 45 places in 292 ms of which 5 ms to minimize.
[2024-05-24 02:10:51] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 5 ms to minimize.
[2024-05-24 02:10:51] [INFO ] Deduced a trap composed of 73 places in 263 ms of which 5 ms to minimize.
[2024-05-24 02:10:52] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 4 ms to minimize.
[2024-05-24 02:10:52] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 4 ms to minimize.
[2024-05-24 02:10:52] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 4 ms to minimize.
[2024-05-24 02:10:53] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:10:53] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:10:53] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 4 ms to minimize.
[2024-05-24 02:10:53] [INFO ] Deduced a trap composed of 84 places in 276 ms of which 12 ms to minimize.
[2024-05-24 02:10:54] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 4 ms to minimize.
[2024-05-24 02:10:54] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 5 ms to minimize.
[2024-05-24 02:10:54] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 4 ms to minimize.
[2024-05-24 02:10:55] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:10:55] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:10:55] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:11:03] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 10 ms to minimize.
[2024-05-24 02:11:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 3 ms to minimize.
[2024-05-24 02:11:04] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:11:04] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 4 ms to minimize.
[2024-05-24 02:11:05] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 4 ms to minimize.
[2024-05-24 02:11:05] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 280/670 variables, and 62 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:11:07] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 02:11:07] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:11:08] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 4 ms to minimize.
[2024-05-24 02:11:09] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 5 ms to minimize.
[2024-05-24 02:11:09] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:11:09] [INFO ] Deduced a trap composed of 88 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:11:09] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 4 ms to minimize.
[2024-05-24 02:11:10] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 5 ms to minimize.
[2024-05-24 02:11:10] [INFO ] Deduced a trap composed of 61 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:11:10] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:11:11] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 4 ms to minimize.
[2024-05-24 02:11:11] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:11:11] [INFO ] Deduced a trap composed of 83 places in 281 ms of which 4 ms to minimize.
[2024-05-24 02:11:12] [INFO ] Deduced a trap composed of 77 places in 285 ms of which 4 ms to minimize.
[2024-05-24 02:11:12] [INFO ] Deduced a trap composed of 83 places in 280 ms of which 4 ms to minimize.
[2024-05-24 02:11:12] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 5 ms to minimize.
[2024-05-24 02:11:12] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:11:13] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 4 ms to minimize.
[2024-05-24 02:11:13] [INFO ] Deduced a trap composed of 88 places in 300 ms of which 4 ms to minimize.
[2024-05-24 02:11:14] [INFO ] Deduced a trap composed of 78 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:11:14] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:11:15] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 4 ms to minimize.
[2024-05-24 02:11:16] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 4 ms to minimize.
[2024-05-24 02:11:16] [INFO ] Deduced a trap composed of 60 places in 293 ms of which 4 ms to minimize.
[2024-05-24 02:11:16] [INFO ] Deduced a trap composed of 60 places in 293 ms of which 5 ms to minimize.
[2024-05-24 02:11:17] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:11:17] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 4 ms to minimize.
[2024-05-24 02:11:17] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 4 ms to minimize.
[2024-05-24 02:11:18] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 02:11:18] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 5 ms to minimize.
[2024-05-24 02:11:19] [INFO ] Deduced a trap composed of 92 places in 295 ms of which 5 ms to minimize.
[2024-05-24 02:11:19] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 4 ms to minimize.
[2024-05-24 02:11:19] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 4 ms to minimize.
[2024-05-24 02:11:20] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 5 ms to minimize.
[2024-05-24 02:11:20] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 5 ms to minimize.
[2024-05-24 02:11:20] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 5 ms to minimize.
[2024-05-24 02:11:21] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:11:21] [INFO ] Deduced a trap composed of 56 places in 310 ms of which 6 ms to minimize.
[2024-05-24 02:11:22] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 5 ms to minimize.
[2024-05-24 02:11:28] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-24 02:11:30] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 4 ms to minimize.
[2024-05-24 02:11:30] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-24 02:11:30] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:11:31] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:11:31] [INFO ] Deduced a trap composed of 107 places in 235 ms of which 4 ms to minimize.
[2024-05-24 02:11:31] [INFO ] Deduced a trap composed of 107 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:11:31] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 4 ms to minimize.
[2024-05-24 02:11:32] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:11:32] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 5 ms to minimize.
[2024-05-24 02:11:33] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 4 ms to minimize.
[2024-05-24 02:11:34] [INFO ] Deduced a trap composed of 79 places in 267 ms of which 4 ms to minimize.
[2024-05-24 02:11:34] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/670 variables, and 114 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 98/98 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60961ms
Starting structural reductions in LTL mode, iteration 1 : 280/295 places, 725/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63210 ms. Remains : 280/295 places, 725/800 transitions.
Support contains 40 out of 280 places after structural reductions.
[2024-05-24 02:11:36] [INFO ] Flatten gal took : 162 ms
[2024-05-24 02:11:36] [INFO ] Flatten gal took : 96 ms
[2024-05-24 02:11:36] [INFO ] Input system was already deterministic with 725 transitions.
Support contains 39 out of 280 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2416 ms. (16 steps per ms) remains 17/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
[2024-05-24 02:11:37] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-24 02:11:37] [INFO ] Invariant cache hit.
[2024-05-24 02:11:37] [INFO ] State equation strengthened by 136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 246/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:38] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:39] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:11:39] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:39] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:40] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 5 ms to minimize.
[2024-05-24 02:11:40] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:11:41] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:11:41] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/280 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:41] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:11:42] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 0.0)
(s10 (/ 1.0 2.0))
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 (/ 1.0 2.0))
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 (/ 1.0 2.0))
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 (/ 1.0 2.0))
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 (/ 1.0 2.0))
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 280/670 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 246/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:43] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 3/280 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:44] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:11:44] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:11:44] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:11:44] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:45] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:11:45] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:45] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-24 02:11:46] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:11:46] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:11:46] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:11:46] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 4 ms to minimize.
[2024-05-24 02:11:46] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:11:47] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:11:47] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/670 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 35/35 constraints]
After SMT, in 10053ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 721
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 276 transition count 721
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 8 place count 276 transition count 649
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 152 place count 204 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 203 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 203 transition count 644
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 194 place count 183 transition count 624
Applied a total of 194 rules in 180 ms. Remains 183 /280 variables (removed 97) and now considering 624/725 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 183/280 places, 624/725 transitions.
RANDOM walk for 40000 steps (8 resets) in 790 ms. (50 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
[2024-05-24 02:11:48] [INFO ] Flow matrix only has 289 transitions (discarded 335 similar events)
// Phase 1: matrix 289 rows 183 cols
[2024-05-24 02:11:48] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 02:11:48] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 120/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:48] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 8/183 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:49] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:11:50] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:11:50] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:11:50] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2024-05-24 02:11:50] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 4 ms to minimize.
[2024-05-24 02:11:50] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:11:51] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:11:51] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:11:51] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:11:51] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:11:52] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:11:52] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:11:52] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 289/472 variables, 183/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 132/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 352 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4683 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 120/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:53] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-24 02:11:53] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:54] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:11:54] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:54] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 8/183 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:55] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:11:55] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:11:55] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 289/472 variables, 183/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 132/360 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 15/375 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-24 02:11:56] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:11:56] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:11:57] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/472 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 378 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5278 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 32/32 constraints]
After SMT, in 9998ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 6 properties in 11711 ms.
Support contains 19 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 624/624 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 183 transition count 619
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 175 transition count 604
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 175 transition count 604
Applied a total of 16 rules in 70 ms. Remains 175 /183 variables (removed 8) and now considering 604/624 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 175/183 places, 604/624 transitions.
RANDOM walk for 40000 steps (8 resets) in 605 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 7/8 properties
[2024-05-24 02:12:10] [INFO ] Flow matrix only has 269 transitions (discarded 335 similar events)
// Phase 1: matrix 269 rows 175 cols
[2024-05-24 02:12:10] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:12:10] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 28/168 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/175 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 02:12:11] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:12:12] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:12] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 269/444 variables, 175/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 120/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/444 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 323 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:12] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 28/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/175 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:13] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 269/444 variables, 175/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 120/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 7/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:13] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:12:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/444 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 334 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 16/16 constraints]
After SMT, in 4015ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 3512 ms.
Support contains 16 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 604/604 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 175 transition count 602
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 172 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 172 transition count 597
Applied a total of 6 rules in 39 ms. Remains 172 /175 variables (removed 3) and now considering 597/604 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 172/175 places, 597/604 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 289746 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 6
Probabilistic random walk after 289746 steps, saw 65355 distinct states, run finished after 3013 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-24 02:12:21] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 02:12:21] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:12:21] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 121/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 28/165 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/172 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 262/434 variables, 172/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 304 constraints, problems are : Problem set: 0 solved, 6 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 121/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 02:12:22] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/165 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 02:12:22] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/172 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:12:23] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 262/434 variables, 172/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 116/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 320 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints]
After SMT, in 2778ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2050 ms.
Support contains 16 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2024-05-24 02:12:26] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-24 02:12:26] [INFO ] Invariant cache hit.
[2024-05-24 02:12:27] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-24 02:12:27] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-24 02:12:27] [INFO ] Invariant cache hit.
[2024-05-24 02:12:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:12:27] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2024-05-24 02:12:27] [INFO ] Redundant transitions in 67 ms returned []
Running 592 sub problems to find dead transitions.
[2024-05-24 02:12:27] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-24 02:12:27] [INFO ] Invariant cache hit.
[2024-05-24 02:12:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:12:33] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:12:33] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:12:33] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:12:33] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:12:33] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:12:34] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:12:34] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-24 02:12:34] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:12:34] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:12:35] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:12:35] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:12:35] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:12:35] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-24 02:12:36] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:12:37] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:12:37] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:12:37] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:12:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 02:12:38] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:12:38] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:12:38] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:12:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-24 02:12:40] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:12:40] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:12:41] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:12:41] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 02:12:42] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:12:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:12:42] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:12:43] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:12:43] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:12:43] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:12:43] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:12:44] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:12:44] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:12:49] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 5 ms to minimize.
[2024-05-24 02:12:50] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:12:50] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:12:50] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:12:50] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:12:51] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:12:51] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:12:51] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:12:51] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:12:51] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:12:52] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:12:52] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:12:52] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:12:52] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:12:53] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:12:53] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:12:53] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:12:54] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:12:54] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 4 ms to minimize.
[2024-05-24 02:12:55] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:12:55] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:12:55] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:12:56] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:12:56] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:12:57] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 6 ms to minimize.
[2024-05-24 02:12:57] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/434 variables, and 82 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:13:03] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 4 ms to minimize.
[2024-05-24 02:13:03] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:13:04] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:13:05] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:13:06] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:13:06] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:13:06] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:13:07] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:13:07] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:13:07] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:13:07] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2024-05-24 02:13:08] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:13:08] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 02:13:09] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:13:09] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:13:09] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:13:09] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:13:13] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:13:13] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:13:13] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:13:13] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:13:13] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:13:14] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:13:14] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:13:14] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:13:15] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2024-05-24 02:13:15] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:13:15] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (OVERLAPS) 262/434 variables, 172/282 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 116/398 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 592/990 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 990 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 94/94 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61563 ms. Remains : 172/172 places, 597/597 transitions.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(X(p0)||X(F(p1)))) U p2)))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 276 transition count 705
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 276 transition count 705
Applied a total of 8 rules in 21 ms. Remains 276 /280 variables (removed 4) and now considering 705/725 (removed 20) transitions.
[2024-05-24 02:13:28] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 02:13:28] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 02:13:29] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-24 02:13:29] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 02:13:29] [INFO ] Invariant cache hit.
[2024-05-24 02:13:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 02:13:30] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 02:13:30] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 02:13:30] [INFO ] Invariant cache hit.
[2024-05-24 02:13:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 02:13:38] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:13:38] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:13:38] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 4 ms to minimize.
[2024-05-24 02:13:38] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 4 ms to minimize.
[2024-05-24 02:13:39] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 4 ms to minimize.
[2024-05-24 02:13:39] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 4 ms to minimize.
[2024-05-24 02:13:39] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 4 ms to minimize.
[2024-05-24 02:13:39] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:13:40] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:13:40] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:13:40] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:13:41] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 5 ms to minimize.
[2024-05-24 02:13:41] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 5 ms to minimize.
[2024-05-24 02:13:42] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 4 ms to minimize.
[2024-05-24 02:13:42] [INFO ] Deduced a trap composed of 50 places in 301 ms of which 4 ms to minimize.
[2024-05-24 02:13:42] [INFO ] Deduced a trap composed of 65 places in 298 ms of which 4 ms to minimize.
[2024-05-24 02:13:43] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 4 ms to minimize.
[2024-05-24 02:13:43] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 4 ms to minimize.
[2024-05-24 02:13:43] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:13:43] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 02:13:44] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
[2024-05-24 02:13:44] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:13:45] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 5 ms to minimize.
[2024-05-24 02:13:45] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 5 ms to minimize.
[2024-05-24 02:13:45] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:13:45] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 3 ms to minimize.
[2024-05-24 02:13:46] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:13:46] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 4 ms to minimize.
[2024-05-24 02:13:46] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:13:46] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 4 ms to minimize.
[2024-05-24 02:13:47] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 4 ms to minimize.
[2024-05-24 02:13:47] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 4 ms to minimize.
[2024-05-24 02:13:47] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:13:47] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:13:47] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:13:48] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:13:48] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 3 ms to minimize.
[2024-05-24 02:13:48] [INFO ] Deduced a trap composed of 80 places in 263 ms of which 4 ms to minimize.
[2024-05-24 02:13:49] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:13:49] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 02:13:56] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 02:13:57] [INFO ] Deduced a trap composed of 81 places in 336 ms of which 5 ms to minimize.
[2024-05-24 02:13:57] [INFO ] Deduced a trap composed of 96 places in 286 ms of which 5 ms to minimize.
[2024-05-24 02:13:58] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:13:58] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 3 ms to minimize.
[2024-05-24 02:13:58] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:13:58] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 4 ms to minimize.
[2024-05-24 02:13:59] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:13:59] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 4 ms to minimize.
[2024-05-24 02:13:59] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:14:00] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:14:00] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 4 ms to minimize.
SMT process timed out in 30280ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30296ms
Starting structural reductions in LTL mode, iteration 1 : 276/280 places, 705/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31984 ms. Remains : 276/280 places, 705/725 transitions.
Stuttering acceptance computed with spot in 593 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 614 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 33342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 118 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 02:14:02] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:14:02] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:14:02] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-24 02:14:02] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:14:02] [INFO ] Invariant cache hit.
[2024-05-24 02:14:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:14:03] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-05-24 02:14:03] [INFO ] Redundant transitions in 10 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:14:03] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:14:03] [INFO ] Invariant cache hit.
[2024-05-24 02:14:03] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:14:08] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:14:09] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:14:09] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:14:10] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:14:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:14:10] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:14:10] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:14:11] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:14:11] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-24 02:14:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-24 02:14:11] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:14:12] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:14:12] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:14:12] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:14:12] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:13] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:14:14] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:14:14] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:14:14] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:14:15] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-05-24 02:14:15] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:14:15] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-05-24 02:14:16] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:14:16] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:14:16] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:14:16] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-24 02:14:16] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:14:17] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:14:17] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:14:17] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:14:17] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:14:17] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:14:18] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:14:18] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2024-05-24 02:14:18] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:24] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:14:25] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:14:26] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-24 02:14:26] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:14:26] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:14:26] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:14:26] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:14:27] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:14:27] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:14:27] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:14:27] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:14:27] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:14:28] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:14:28] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:14:28] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2024-05-24 02:14:28] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:14:29] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:14:29] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:31] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:14:31] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:14:32] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:14:32] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:14:33] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
(s7 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 79 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:38] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:14:38] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-05-24 02:14:39] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:14:40] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:45] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:14:45] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 2 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:14:49] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:14:49] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:14:49] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:14:51] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:14:51] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:14:51] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:14:52] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:14:52] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:14:52] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:14:53] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:14:53] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:14:53] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 60452ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61740 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 361 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 62194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 43 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 02:15:04] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 02:15:04] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 02:15:04] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-24 02:15:04] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:15:04] [INFO ] Invariant cache hit.
[2024-05-24 02:15:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:15:05] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:15:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:15:05] [INFO ] Invariant cache hit.
[2024-05-24 02:15:05] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:15:12] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:15:12] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:15:12] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:15:12] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:15:13] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2024-05-24 02:15:13] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2024-05-24 02:15:13] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 4 ms to minimize.
[2024-05-24 02:15:13] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 4 ms to minimize.
[2024-05-24 02:15:14] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:15:14] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:15:14] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-05-24 02:15:14] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:15:15] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 5 ms to minimize.
[2024-05-24 02:15:15] [INFO ] Deduced a trap composed of 51 places in 279 ms of which 4 ms to minimize.
[2024-05-24 02:15:16] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 3 ms to minimize.
[2024-05-24 02:15:16] [INFO ] Deduced a trap composed of 60 places in 267 ms of which 4 ms to minimize.
[2024-05-24 02:15:16] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:15:16] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 5 ms to minimize.
[2024-05-24 02:15:17] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:15:17] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:15:18] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:15:18] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:15:19] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 4 ms to minimize.
[2024-05-24 02:15:19] [INFO ] Deduced a trap composed of 67 places in 296 ms of which 6 ms to minimize.
[2024-05-24 02:15:19] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 4 ms to minimize.
[2024-05-24 02:15:19] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2024-05-24 02:15:20] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:15:20] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 4 ms to minimize.
[2024-05-24 02:15:20] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 4 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 4 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 4 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 4 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:15:23] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 5 ms to minimize.
[2024-05-24 02:15:23] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:15:32] [INFO ] Deduced a trap composed of 77 places in 310 ms of which 5 ms to minimize.
[2024-05-24 02:15:32] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:15:32] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 4 ms to minimize.
[2024-05-24 02:15:32] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:15:33] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 4 ms to minimize.
[2024-05-24 02:15:33] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:15:33] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 4 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:15:35] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 4 ms to minimize.
[2024-05-24 02:15:35] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 4 ms to minimize.
SMT process timed out in 30444ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30455ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31991 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 32263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 17 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 02:15:36] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:15:36] [INFO ] Invariant cache hit.
[2024-05-24 02:15:36] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-24 02:15:36] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:15:36] [INFO ] Invariant cache hit.
[2024-05-24 02:15:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:15:37] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:15:38] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:15:38] [INFO ] Invariant cache hit.
[2024-05-24 02:15:38] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:15:45] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:15:45] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:15:46] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:15:46] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:15:46] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:15:46] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 4 ms to minimize.
[2024-05-24 02:15:46] [INFO ] Deduced a trap composed of 72 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:15:47] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:15:47] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:15:47] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:15:47] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:15:47] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-24 02:15:48] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 4 ms to minimize.
[2024-05-24 02:15:48] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 4 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 60 places in 290 ms of which 4 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:15:50] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 5 ms to minimize.
[2024-05-24 02:15:50] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:15:50] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:15:51] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:15:51] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:15:52] [INFO ] Deduced a trap composed of 57 places in 269 ms of which 4 ms to minimize.
[2024-05-24 02:15:52] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 4 ms to minimize.
[2024-05-24 02:15:52] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 3 ms to minimize.
[2024-05-24 02:15:52] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 3 ms to minimize.
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 4 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 4 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 4 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2024-05-24 02:15:55] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-24 02:15:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:15:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:15:55] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:15:55] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 5 ms to minimize.
[2024-05-24 02:15:56] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:16:03] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 3 ms to minimize.
[2024-05-24 02:16:03] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:16:03] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:16:03] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:16:03] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:16:04] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:16:04] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:16:04] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:16:04] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:16:05] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:16:05] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:16:05] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 4 ms to minimize.
[2024-05-24 02:16:06] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 4 ms to minimize.
[2024-05-24 02:16:07] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 5 ms to minimize.
[2024-05-24 02:16:07] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 71 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:16:11] [INFO ] Deduced a trap composed of 77 places in 255 ms of which 4 ms to minimize.
[2024-05-24 02:16:11] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:16:11] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:16:11] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 4 ms to minimize.
[2024-05-24 02:16:12] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:16:12] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:16:12] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 4 ms to minimize.
[2024-05-24 02:16:12] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:16:12] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:16:13] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:16:13] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:16:13] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:16:13] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:16:15] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 2 ms to minimize.
[2024-05-24 02:16:17] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:16:18] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:16:18] [INFO ] Deduced a trap composed of 81 places in 194 ms of which 2 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 3 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 4 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 4 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 81 places in 238 ms of which 4 ms to minimize.
[2024-05-24 02:16:20] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:16:20] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 4 ms to minimize.
[2024-05-24 02:16:20] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 3 ms to minimize.
[2024-05-24 02:16:21] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 5 ms to minimize.
[2024-05-24 02:16:21] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 3 ms to minimize.
[2024-05-24 02:16:22] [INFO ] Deduced a trap composed of 59 places in 257 ms of which 4 ms to minimize.
[2024-05-24 02:16:22] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:16:22] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:16:22] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:16:25] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:16:25] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 4 ms to minimize.
[2024-05-24 02:16:25] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 4 ms to minimize.
[2024-05-24 02:16:25] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 5 ms to minimize.
[2024-05-24 02:16:26] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:16:27] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 4 ms to minimize.
[2024-05-24 02:16:27] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:16:28] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 4 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 5 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 93 places in 273 ms of which 4 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 3 ms to minimize.
[2024-05-24 02:16:32] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:16:32] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:16:32] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:16:32] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:16:32] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:16:33] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:16:33] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:16:33] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 4 ms to minimize.
[2024-05-24 02:16:34] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 4 ms to minimize.
[2024-05-24 02:16:34] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:16:34] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 4 ms to minimize.
[2024-05-24 02:16:35] [INFO ] Deduced a trap composed of 72 places in 274 ms of which 4 ms to minimize.
[2024-05-24 02:16:35] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:16:36] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 2 ms to minimize.
[2024-05-24 02:16:36] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:16:37] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:16:37] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:16:38] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 4 ms to minimize.
SMT process timed out in 60615ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62214 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 154 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 705618 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 1
Probabilistic random walk after 705618 steps, saw 244681 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2024-05-24 02:16:42] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:16:42] [INFO ] Invariant cache hit.
[2024-05-24 02:16:42] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/283 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/331 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 135/466 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/472 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/640 variables, 141/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 82/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:16:43] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/113 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:16:43] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/283 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 24/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/331 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 135/466 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/472 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:16:43] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:16:44] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/640 variables, 141/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/640 variables, 82/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 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 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 67 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 170/275 places, 595/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 764280 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 764280 steps, saw 147622 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2024-05-24 02:16:47] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:16:47] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:16:47] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:16:49] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 29 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 28 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 02:16:49] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:16:49] [INFO ] Invariant cache hit.
[2024-05-24 02:16:49] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-24 02:16:49] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:16:49] [INFO ] Invariant cache hit.
[2024-05-24 02:16:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:16:50] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-05-24 02:16:50] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:16:50] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:16:50] [INFO ] Invariant cache hit.
[2024-05-24 02:16:50] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:16:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:16:56] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:16:56] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:16:56] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:16:57] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:16:57] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:16:57] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:16:57] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:16:57] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:16:58] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:16:58] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:16:58] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 4 ms to minimize.
[2024-05-24 02:16:58] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:16:58] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:16:59] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:16:59] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:16:59] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:17:00] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:17:01] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-24 02:17:02] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-24 02:17:03] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 2 ms to minimize.
[2024-05-24 02:17:03] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:08] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:17:09] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:17:09] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-24 02:17:09] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:17:09] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:17:10] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:17:10] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:17:10] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:17:10] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:17:11] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:17:12] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:17:12] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:17:12] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:17:12] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:17:12] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:14] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:17:14] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:17:15] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:17:15] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:17:15] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:17:15] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:17:16] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:17:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-24 02:17:16] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:17:16] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:17:16] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-24 02:17:17] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:17:17] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:17:17] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:17:17] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-24 02:17:17] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:17:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 02:17:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:17:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-24 02:17:18] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:20] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:17:20] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 98 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:24] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:17:24] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:17:25] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:17:25] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:17:25] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:17:26] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-24 02:17:26] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:17:26] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:17:26] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:17:26] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-05-24 02:17:27] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:17:27] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:17:27] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:17:27] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:17:28] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:17:30] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 16/114 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:32] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:17:33] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
[2024-05-24 02:17:33] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2024-05-24 02:17:33] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:17:33] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:17:33] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:17:34] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:17:34] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2024-05-24 02:17:34] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:17:34] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:17:34] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:17:35] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:17:35] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:17:35] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:17:35] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:17:36] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:17:36] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:17:36] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:17:36] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:17:37] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:40] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:17:40] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:17:41] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:17:42] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:17:42] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:17:42] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 3 ms to minimize.
[2024-05-24 02:17:43] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:17:48] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 60480ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61858 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 6 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 85 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 02:17:51] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 02:17:51] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 02:17:51] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:17:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:17:51] [INFO ] After 17ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 2
[2024-05-24 02:17:51] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:17:51] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 768 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 295 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p2)]
Support contains 3 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 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 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 14 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 69 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2024-05-24 02:17:52] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:17:52] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:17:52] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-24 02:17:52] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:17:52] [INFO ] Invariant cache hit.
[2024-05-24 02:17:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:17:53] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-24 02:17:53] [INFO ] Redundant transitions in 5 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:17:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:17:53] [INFO ] Invariant cache hit.
[2024-05-24 02:17:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:17:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:17:58] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:17:59] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:17:59] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:17:59] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:17:59] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-24 02:17:59] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:00] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:02] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:18:03] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:09] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-24 02:18:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-24 02:18:09] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2024-05-24 02:18:09] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:22] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 70 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:18:31] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 2 ms to minimize.
[2024-05-24 02:18:33] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:18:33] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:18:33] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:37] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 2 ms to minimize.
[2024-05-24 02:18:37] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:18:38] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:18:38] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:18:38] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:18:38] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:18:39] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:18:39] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:18:39] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:18:39] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:18:39] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:40] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:42] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:18:44] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:18:45] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:18:45] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:18:45] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:18:51] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:18:51] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:18:52] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:18:53] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:18:53] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:18:53] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:18:54] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:18:54] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:18:54] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 60456ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61882 ms. Remains : 171/275 places, 596/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 783858 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 1
Probabilistic random walk after 783858 steps, saw 151472 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-24 02:18:57] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:18:57] [INFO ] Invariant cache hit.
[2024-05-24 02:18:57] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 15 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 873498 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 1
Probabilistic random walk after 873498 steps, saw 166872 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2024-05-24 02:19:01] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:19:01] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:19:01] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:19:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/430 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 20 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 20 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 02:19:02] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:19:02] [INFO ] Invariant cache hit.
[2024-05-24 02:19:02] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-24 02:19:02] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:19:02] [INFO ] Invariant cache hit.
[2024-05-24 02:19:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:19:03] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-05-24 02:19:03] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:19:03] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:19:03] [INFO ] Invariant cache hit.
[2024-05-24 02:19:03] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 4 ms to minimize.
[2024-05-24 02:19:08] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:19:08] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:19:08] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:19:08] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:19:08] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-05-24 02:19:09] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:19:10] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 6 ms to minimize.
[2024-05-24 02:19:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:19:10] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:12] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-24 02:19:12] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:19:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-24 02:19:13] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:19:13] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:19:13] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:19:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:19:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2024-05-24 02:19:15] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:20] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:19:20] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:20] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:19:21] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2024-05-24 02:19:21] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:19:21] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:21] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-24 02:19:22] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:19:22] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:19:22] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2024-05-24 02:19:23] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:19:23] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:19:23] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:19:23] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:19:24] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:19:24] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:19:24] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:19:24] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:27] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:19:27] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:19:27] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:19:27] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-05-24 02:19:27] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:19:28] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:19:28] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-24 02:19:29] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:19:29] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:19:29] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:33] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 85 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:36] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:19:36] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:19:36] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:19:37] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:19:37] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 2 ms to minimize.
[2024-05-24 02:19:38] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:19:39] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:19:40] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:19:40] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:19:40] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:19:40] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:42] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:19:43] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:19:45] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:19:45] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:19:45] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 3 ms to minimize.
[2024-05-24 02:19:45] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:19:46] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:19:47] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2024-05-24 02:19:47] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:51] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:19:51] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:19:51] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:51] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:19:52] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:19:52] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:19:52] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:19:52] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:19:54] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:55] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:19:55] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:19:55] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:19:55] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:19:56] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:19:56] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:19:56] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:19:56] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:19:57] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:19:57] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:19:57] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:19:57] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:19:57] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:19:58] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 3 ms to minimize.
[2024-05-24 02:19:58] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:19:58] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:19:58] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:19:59] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:19:59] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:19:59] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:02] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:20:02] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:20:02] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:20:02] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:20:02] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2024-05-24 02:20:03] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 2 ms to minimize.
[2024-05-24 02:20:03] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:20:03] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 147 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 131/131 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61379 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 23 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 02:20:03] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 02:20:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:20:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 02:20:04] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:20:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:20:04] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 02:20:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 02:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 02:20:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 2
[2024-05-24 02:20:04] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:20:04] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 315 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 282 ms.
Product exploration explored 100000 steps with 0 reset in 298 ms.
Built C files in :
/tmp/ltsmin18168125392959796642
[2024-05-24 02:20:05] [INFO ] Computing symmetric may disable matrix : 596 transitions.
[2024-05-24 02:20:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:20:05] [INFO ] Computing symmetric may enable matrix : 596 transitions.
[2024-05-24 02:20:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:20:05] [INFO ] Computing Do-Not-Accords matrix : 596 transitions.
[2024-05-24 02:20:05] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:20:05] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18168125392959796642
Running compilation step : cd /tmp/ltsmin18168125392959796642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18168125392959796642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18168125392959796642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 16 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-24 02:20:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:20:08] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:20:08] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-24 02:20:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:20:08] [INFO ] Invariant cache hit.
[2024-05-24 02:20:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:20:09] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-24 02:20:09] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:20:09] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:20:09] [INFO ] Invariant cache hit.
[2024-05-24 02:20:09] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:20:13] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:20:14] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:20:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:20:14] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:20:14] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:20:15] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-24 02:20:16] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:20:16] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:18] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:20:18] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:20:18] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:20:19] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 3 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:20:20] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:20:21] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:25] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-24 02:20:25] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:20:25] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:20:26] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:20:26] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:20:26] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:20:26] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-24 02:20:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:20:27] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:20:27] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:20:27] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:20:28] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:20:28] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:20:28] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:20:28] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:20:29] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:20:29] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:20:29] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:32] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:20:32] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:20:32] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:20:32] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:20:32] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:20:33] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:20:33] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:20:34] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-05-24 02:20:34] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:20:34] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:37] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 85 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:41] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2024-05-24 02:20:42] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2024-05-24 02:20:42] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-24 02:20:42] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:20:42] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:20:43] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:20:44] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2024-05-24 02:20:45] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:20:45] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:20:45] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-24 02:20:45] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:47] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 4 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 1 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-05-24 02:20:48] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:20:50] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:20:50] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:20:50] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 3 ms to minimize.
[2024-05-24 02:20:51] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:20:51] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 3 ms to minimize.
[2024-05-24 02:20:52] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:20:53] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:20:56] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:20:56] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:20:56] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:20:57] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:20:57] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:20:57] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:20:57] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:20:58] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:20:59] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:21:00] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:21:00] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:21:01] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:21:01] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:21:01] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:21:01] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:21:01] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:21:02] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:21:02] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:21:02] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:21:02] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 3 ms to minimize.
[2024-05-24 02:21:02] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:21:03] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:21:03] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:21:03] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:21:03] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:21:04] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:21:04] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:21:04] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:21:04] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:21:07] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:21:08] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:21:08] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-24 02:21:08] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2024-05-24 02:21:08] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:21:08] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:21:09] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:21:09] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:21:09] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-24 02:21:09] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-05-24 02:21:09] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 150 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 134/134 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61304 ms. Remains : 170/171 places, 595/596 transitions.
Built C files in :
/tmp/ltsmin10972630102749305279
[2024-05-24 02:21:09] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-05-24 02:21:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:21:09] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-05-24 02:21:09] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:21:09] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-05-24 02:21:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:21:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10972630102749305279
Running compilation step : cd /tmp/ltsmin10972630102749305279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2966 ms.
Running link step : cd /tmp/ltsmin10972630102749305279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin10972630102749305279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3017945974280658494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:21:24] [INFO ] Flatten gal took : 45 ms
[2024-05-24 02:21:24] [INFO ] Flatten gal took : 59 ms
[2024-05-24 02:21:24] [INFO ] Time to serialize gal into /tmp/LTL12697776128770928660.gal : 11 ms
[2024-05-24 02:21:24] [INFO ] Time to serialize properties into /tmp/LTL15283563540277602185.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12697776128770928660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13659463734154462707.hoa' '-atoms' '/tmp/LTL15283563540277602185.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15283563540277602185.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13659463734154462707.hoa
Detected timeout of ITS tools.
[2024-05-24 02:21:40] [INFO ] Flatten gal took : 36 ms
[2024-05-24 02:21:40] [INFO ] Flatten gal took : 31 ms
[2024-05-24 02:21:40] [INFO ] Time to serialize gal into /tmp/LTL5994052648401479242.gal : 8 ms
[2024-05-24 02:21:40] [INFO ] Time to serialize properties into /tmp/LTL17781421744632130645.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5994052648401479242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17781421744632130645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((X("((flag_1_waiting==1)&&(p33_4_1==1))"))U("(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))"))||(G("(((turn_4==0)||(flag_4_idle==...178
Formula 0 simplified : !"(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))" & F!"(((turn_4==0)||(flag_4_idle==0))||(p25_1_3==0))" & X(!"(((turn_3==1)&&(flag_...224
Detected timeout of ITS tools.
[2024-05-24 02:21:55] [INFO ] Flatten gal took : 27 ms
[2024-05-24 02:21:55] [INFO ] Applying decomposition
[2024-05-24 02:21:55] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11572759858620034762.txt' '-o' '/tmp/graph11572759858620034762.bin' '-w' '/tmp/graph11572759858620034762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11572759858620034762.bin' '-l' '-1' '-v' '-w' '/tmp/graph11572759858620034762.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:21:55] [INFO ] Decomposing Gal with order
[2024-05-24 02:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:21:55] [INFO ] Removed a total of 1009 redundant transitions.
[2024-05-24 02:21:55] [INFO ] Flatten gal took : 157 ms
[2024-05-24 02:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 41 ms.
[2024-05-24 02:21:55] [INFO ] Time to serialize gal into /tmp/LTL302592367723599597.gal : 14 ms
[2024-05-24 02:21:55] [INFO ] Time to serialize properties into /tmp/LTL11645928827184769870.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL302592367723599597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11645928827184769870.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X("((i4.i1.u3.flag_1_waiting==1)&&(i4.i0.u16.p33_4_1==1))"))U("(((i0.u1.turn_3==1)&&(i7.i1.u2.flag_3_idle==1))&&(i7.i1.u2.p25_2_0...239
Formula 0 simplified : !"(((i0.u1.turn_3==1)&&(i7.i1.u2.flag_3_idle==1))&&(i7.i1.u2.p25_2_0==1))" & F!"(((i0.u1.turn_4==0)||(i3.u0.flag_4_idle==0))||(i0.u1...309
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 394429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!F(X(p1)) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 277 transition count 710
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 277 transition count 710
Applied a total of 6 rules in 7 ms. Remains 277 /280 variables (removed 3) and now considering 710/725 (removed 15) transitions.
[2024-05-24 02:22:10] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-05-24 02:22:10] [INFO ] Computed 16 invariants in 7 ms
[2024-05-24 02:22:11] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-24 02:22:11] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:22:11] [INFO ] Invariant cache hit.
[2024-05-24 02:22:11] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 02:22:12] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-24 02:22:12] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:22:12] [INFO ] Invariant cache hit.
[2024-05-24 02:22:12] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:22:20] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:22:20] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 10 ms to minimize.
[2024-05-24 02:22:20] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:22:20] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:22:21] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:22:21] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 4 ms to minimize.
[2024-05-24 02:22:21] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:22:22] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 5 ms to minimize.
[2024-05-24 02:22:22] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 4 ms to minimize.
[2024-05-24 02:22:22] [INFO ] Deduced a trap composed of 88 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:22:23] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 4 ms to minimize.
[2024-05-24 02:22:23] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 4 ms to minimize.
[2024-05-24 02:22:23] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2024-05-24 02:22:23] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 4 ms to minimize.
[2024-05-24 02:22:24] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 4 ms to minimize.
[2024-05-24 02:22:24] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:22:24] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:22:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:22:25] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 4 ms to minimize.
[2024-05-24 02:22:25] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:22:25] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 13 ms to minimize.
[2024-05-24 02:22:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-24 02:22:26] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:22:26] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:22:26] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 4 ms to minimize.
[2024-05-24 02:22:27] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:22:27] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:22:27] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 4 ms to minimize.
[2024-05-24 02:22:27] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 4 ms to minimize.
[2024-05-24 02:22:28] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 4 ms to minimize.
[2024-05-24 02:22:28] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 4 ms to minimize.
[2024-05-24 02:22:28] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:22:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:22:29] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-24 02:22:29] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:22:29] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 02:22:29] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 4 ms to minimize.
[2024-05-24 02:22:30] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 4 ms to minimize.
[2024-05-24 02:22:30] [INFO ] Deduced a trap composed of 76 places in 247 ms of which 4 ms to minimize.
[2024-05-24 02:22:30] [INFO ] Deduced a trap composed of 76 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:22:37] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 4 ms to minimize.
[2024-05-24 02:22:38] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 3 ms to minimize.
[2024-05-24 02:22:39] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 4 ms to minimize.
[2024-05-24 02:22:39] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 4 ms to minimize.
[2024-05-24 02:22:39] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 4 ms to minimize.
[2024-05-24 02:22:40] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:22:40] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:22:40] [INFO ] Deduced a trap composed of 60 places in 261 ms of which 4 ms to minimize.
[2024-05-24 02:22:41] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 65 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:22:44] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:22:44] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 3 ms to minimize.
[2024-05-24 02:22:45] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 4 ms to minimize.
[2024-05-24 02:22:45] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:22:46] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 4 ms to minimize.
[2024-05-24 02:22:46] [INFO ] Deduced a trap composed of 68 places in 238 ms of which 3 ms to minimize.
[2024-05-24 02:22:46] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:22:46] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 4 ms to minimize.
[2024-05-24 02:22:47] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 3 ms to minimize.
[2024-05-24 02:22:47] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:22:47] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:22:47] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:22:47] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:22:48] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 4 ms to minimize.
[2024-05-24 02:22:48] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:22:48] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:22:49] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:22:49] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 4 ms to minimize.
[2024-05-24 02:22:50] [INFO ] Deduced a trap composed of 57 places in 264 ms of which 4 ms to minimize.
[2024-05-24 02:22:50] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:22:52] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 4 ms to minimize.
[2024-05-24 02:22:52] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:22:53] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:22:55] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:22:55] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 4 ms to minimize.
[2024-05-24 02:22:56] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 4 ms to minimize.
[2024-05-24 02:22:56] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:22:56] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:22:56] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:22:57] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 5 ms to minimize.
[2024-05-24 02:22:57] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 4 ms to minimize.
[2024-05-24 02:22:57] [INFO ] Deduced a trap composed of 53 places in 286 ms of which 5 ms to minimize.
[2024-05-24 02:22:58] [INFO ] Deduced a trap composed of 75 places in 292 ms of which 5 ms to minimize.
[2024-05-24 02:22:58] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 2 ms to minimize.
[2024-05-24 02:22:58] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 4 ms to minimize.
[2024-05-24 02:22:58] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:22:59] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:22:59] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 4 ms to minimize.
[2024-05-24 02:22:59] [INFO ] Deduced a trap composed of 94 places in 279 ms of which 5 ms to minimize.
[2024-05-24 02:23:00] [INFO ] Deduced a trap composed of 97 places in 284 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:23:03] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 5 ms to minimize.
[2024-05-24 02:23:04] [INFO ] Deduced a trap composed of 76 places in 291 ms of which 5 ms to minimize.
[2024-05-24 02:23:05] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 4 ms to minimize.
[2024-05-24 02:23:09] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:23:11] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 3 ms to minimize.
[2024-05-24 02:23:11] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 3 ms to minimize.
[2024-05-24 02:23:11] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:23:12] [INFO ] Deduced a trap composed of 70 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 60453ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 710/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62011 ms. Remains : 277/280 places, 710/725 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 33313 reset in 520 ms.
Product exploration explored 100000 steps with 33213 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 172 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 337 ms. (118 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
[2024-05-24 02:23:14] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:23:14] [INFO ] Invariant cache hit.
[2024-05-24 02:23:14] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:23:16] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1318ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 562 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 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 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 29 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 597 ms. (steps per millisecond=233 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 605 ms. (steps per millisecond=230 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 521 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-24 02:23:18] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:23:18] [INFO ] Invariant cache hit.
[2024-05-24 02:23:19] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-24 02:23:19] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:23:19] [INFO ] Invariant cache hit.
[2024-05-24 02:23:19] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 02:23:19] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-24 02:23:19] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:23:19] [INFO ] Invariant cache hit.
[2024-05-24 02:23:19] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:23:24] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:23:25] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-24 02:23:26] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
[2024-05-24 02:23:26] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:23:27] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:23:27] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:23:27] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 3 ms to minimize.
[2024-05-24 02:23:27] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:23:27] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:23:28] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:23:28] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:23:28] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:23:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-24 02:23:29] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:23:29] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:23:29] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-05-24 02:23:29] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:23:30] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:23:30] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:23:30] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:23:31] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-05-24 02:23:31] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:23:31] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:23:31] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 4 ms to minimize.
[2024-05-24 02:23:31] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:23:32] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:23:32] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:23:32] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-24 02:23:32] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:23:33] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:23:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:23:33] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:23:34] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 3 ms to minimize.
[2024-05-24 02:23:34] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:23:34] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:23:40] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:23:40] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:23:41] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 4 ms to minimize.
[2024-05-24 02:23:41] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-24 02:23:42] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:23:42] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 4 ms to minimize.
[2024-05-24 02:23:42] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:23:43] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:23:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:23:46] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 4 ms to minimize.
[2024-05-24 02:23:46] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:23:47] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:23:47] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 3 ms to minimize.
[2024-05-24 02:23:47] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:23:47] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 3 ms to minimize.
[2024-05-24 02:23:48] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 4 ms to minimize.
[2024-05-24 02:23:48] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-05-24 02:23:49] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 4 ms to minimize.
[2024-05-24 02:23:49] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:23:49] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 76 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:23:52] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:23:52] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 3 ms to minimize.
[2024-05-24 02:23:53] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 4 ms to minimize.
[2024-05-24 02:23:54] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:23:54] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-05-24 02:23:56] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 4 ms to minimize.
[2024-05-24 02:23:56] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 4 ms to minimize.
[2024-05-24 02:23:57] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 4 ms to minimize.
[2024-05-24 02:23:58] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 4 ms to minimize.
[2024-05-24 02:23:59] [INFO ] Deduced a trap composed of 83 places in 312 ms of which 4 ms to minimize.
[2024-05-24 02:23:59] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 4 ms to minimize.
[2024-05-24 02:23:59] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 5 ms to minimize.
[2024-05-24 02:23:59] [INFO ] Deduced a trap composed of 88 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:24:00] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:24:01] [INFO ] Deduced a trap composed of 70 places in 275 ms of which 4 ms to minimize.
[2024-05-24 02:24:01] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 3 ms to minimize.
[2024-05-24 02:24:02] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 4 ms to minimize.
[2024-05-24 02:24:04] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:24:04] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:24:04] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:24:07] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 4 ms to minimize.
[2024-05-24 02:24:08] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 4 ms to minimize.
[2024-05-24 02:24:08] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 3 ms to minimize.
[2024-05-24 02:24:08] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:24:09] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:24:09] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:24:09] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 4 ms to minimize.
[2024-05-24 02:24:10] [INFO ] Deduced a trap composed of 72 places in 217 ms of which 4 ms to minimize.
[2024-05-24 02:24:11] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:24:11] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:24:12] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 4 ms to minimize.
[2024-05-24 02:24:12] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:24:12] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 3 ms to minimize.
[2024-05-24 02:24:13] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:24:13] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 5 ms to minimize.
[2024-05-24 02:24:14] [INFO ] Deduced a trap composed of 52 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:24:14] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 4 ms to minimize.
[2024-05-24 02:24:14] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-05-24 02:24:15] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 4 ms to minimize.
[2024-05-24 02:24:15] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 02:24:18] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:24:18] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:24:19] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:24:19] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:24:19] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:24:20] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in LTL mode , in 1 iterations and 61485 ms. Remains : 277/277 places, 710/710 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 1948 ms. (20 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
[2024-05-24 02:24:21] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 02:24:21] [INFO ] Invariant cache hit.
[2024-05-24 02:24:21] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:24:22] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 514 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 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 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 41 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 796 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 740 ms. (steps per millisecond=188 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 741 ms. (steps per millisecond=188 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 419 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33291 reset in 407 ms.
Product exploration explored 100000 steps with 33348 reset in 435 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 710
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 277 transition count 818
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 277 transition count 818
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 277 transition count 818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 87 ms. Remains 272 /277 variables (removed 5) and now considering 813/710 (removed -103) transitions.
[2024-05-24 02:24:27] [INFO ] Redundant transitions in 13 ms returned []
Running 808 sub problems to find dead transitions.
[2024-05-24 02:24:27] [INFO ] Flow matrix only has 424 transitions (discarded 389 similar events)
// Phase 1: matrix 424 rows 272 cols
[2024-05-24 02:24:27] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:24:27] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-24 02:24:36] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
[2024-05-24 02:24:37] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-05-24 02:24:38] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-05-24 02:24:38] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:24:38] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 2 ms to minimize.
[2024-05-24 02:24:38] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2024-05-24 02:24:39] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-05-24 02:24:40] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:24:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-24 02:24:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-24 02:24:41] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:24:41] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:24:41] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:24:41] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 4 ms to minimize.
[2024-05-24 02:24:42] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 5 ms to minimize.
[2024-05-24 02:24:43] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 5 ms to minimize.
[2024-05-24 02:24:43] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 5 ms to minimize.
[2024-05-24 02:24:43] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 3 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:24:44] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:24:45] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 4 ms to minimize.
[2024-05-24 02:24:45] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-05-24 02:24:52] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:24:52] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:24:52] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 4 ms to minimize.
[2024-05-24 02:24:53] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 4 ms to minimize.
[2024-05-24 02:24:53] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:24:53] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-05-24 02:24:54] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 5 ms to minimize.
[2024-05-24 02:24:54] [INFO ] Deduced a trap composed of 55 places in 364 ms of which 5 ms to minimize.
[2024-05-24 02:24:54] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 4 ms to minimize.
[2024-05-24 02:24:55] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 5 ms to minimize.
[2024-05-24 02:24:55] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 5 ms to minimize.
[2024-05-24 02:24:55] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 5 ms to minimize.
[2024-05-24 02:24:55] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 4 ms to minimize.
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 4 ms to minimize.
[2024-05-24 02:24:56] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:24:57] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 4 ms to minimize.
[2024-05-24 02:24:57] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:24:57] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 4 ms to minimize.
SMT process timed out in 30743ms, After SMT, problems are : Problem set: 207 solved, 601 unsolved
Search for dead transitions found 207 dead transitions in 30759ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 272/277 places, 606/710 transitions.
Graph (complete) has 1446 edges and 272 vertex of which 173 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.5 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 173 /272 variables (removed 99) and now considering 606/606 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/277 places, 606/710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30892 ms. Remains : 173/277 places, 606/710 transitions.
Built C files in :
/tmp/ltsmin11355016030926717816
[2024-05-24 02:24:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11355016030926717816
Running compilation step : cd /tmp/ltsmin11355016030926717816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2461 ms.
Running link step : cd /tmp/ltsmin11355016030926717816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11355016030926717816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13514616346270804699.hoa' '--buchi-type=spotba'
LTSmin run took 3549 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 173115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 35 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 02:25:03] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:25:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:25:04] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-24 02:25:04] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:25:04] [INFO ] Invariant cache hit.
[2024-05-24 02:25:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:25:04] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-05-24 02:25:04] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:25:04] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:25:04] [INFO ] Invariant cache hit.
[2024-05-24 02:25:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2024-05-24 02:25:10] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:25:11] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:25:11] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:25:11] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:25:11] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:25:11] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 2 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 02:25:12] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:25:13] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:25:13] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:25:13] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:25:13] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:25:15] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:25:15] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:25:16] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:25:16] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-24 02:25:17] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:25:17] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:25:17] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:25:17] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:25:17] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:25:18] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:25:18] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-24 02:25:18] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-05-24 02:25:18] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 02:25:19] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:25:19] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:25:19] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:25:19] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 2 ms to minimize.
[2024-05-24 02:25:20] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:25:20] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:25:25] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:25:26] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:25:26] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:25:26] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-24 02:25:27] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:25:30] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:25:31] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:25:31] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:25:31] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:25:32] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:25:32] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:25:32] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:25:32] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:25:33] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:25:33] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:25:33] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:25:33] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:25:34] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:25:34] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:25:34] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:25:34] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:25:34] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:25:35] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:25:35] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30416ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31341 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-09 finished in 31674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 52 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-24 02:25:35] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-24 02:25:35] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:25:35] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-24 02:25:35] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 02:25:35] [INFO ] Invariant cache hit.
[2024-05-24 02:25:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 02:25:36] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-05-24 02:25:36] [INFO ] Redundant transitions in 7 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-24 02:25:36] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 02:25:36] [INFO ] Invariant cache hit.
[2024-05-24 02:25:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:25:40] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 2 ms to minimize.
[2024-05-24 02:25:40] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:25:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:25:41] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 02:25:41] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:25:41] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:25:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-24 02:25:41] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:25:42] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-24 02:25:43] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:25:43] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:25:43] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:25:43] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:25:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-05-24 02:25:44] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:25:44] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:25:45] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:25:45] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-24 02:25:45] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 4 ms to minimize.
[2024-05-24 02:25:45] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2024-05-24 02:25:46] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:25:47] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:25:47] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:25:47] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:25:47] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:25:48] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:25:48] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:25:48] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:25:52] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-05-24 02:25:52] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-24 02:25:52] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:25:52] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:25:53] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:25:53] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:25:53] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:25:53] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:25:53] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 3 ms to minimize.
[2024-05-24 02:25:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:25:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:25:54] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:25:54] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:25:54] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:25:55] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:25:55] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 2 ms to minimize.
[2024-05-24 02:25:55] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 3 ms to minimize.
[2024-05-24 02:25:55] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-05-24 02:25:55] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-24 02:25:56] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:25:59] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:25:59] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:25:59] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:25:59] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:25:59] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:26:00] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:26:01] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:26:01] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:26:01] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:26:01] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:26:02] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:26:02] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:26:03] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:04] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:26:05] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:26:06] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/436 variables, and 97 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:09] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 3 ms to minimize.
[2024-05-24 02:26:11] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:26:11] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:26:11] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:26:11] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:26:12] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:26:12] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:26:12] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:26:14] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:26:14] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:18] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:26:18] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:26:18] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-05-24 02:26:19] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 3 ms to minimize.
[2024-05-24 02:26:20] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 3 ms to minimize.
[2024-05-24 02:26:21] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:24] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 3 ms to minimize.
[2024-05-24 02:26:24] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 2 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:26:25] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:26:26] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 2 ms to minimize.
[2024-05-24 02:26:26] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:26:26] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:26:26] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:26:27] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:26:28] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:29] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:26:31] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:26:32] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:26:32] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:26:32] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:26:32] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:26:32] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:26:33] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:26:33] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:26:33] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:26:33] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/436 variables, and 138 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 122/122 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61542 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 255 ms.
Product exploration explored 100000 steps with 0 reset in 295 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2024-05-24 02:26:38] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 02:26:38] [INFO ] Invariant cache hit.
[2024-05-24 02:26:38] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/68 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/98 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/105 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 177/282 variables, 105/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 47/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/314 variables, 14/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 12/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/362 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/366 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/436 variables, 52/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/436 variables, 61/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 307 constraints, problems are : Problem set: 1 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 02:26:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 22/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 15/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/320 variables, 6/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/326 variables, 3/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/326 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 02:26:38] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:26:39] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:26:39] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:26:39] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:26:39] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 02:26:39] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/326 variables, 6/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/436 variables, 79/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 83/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 315 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1342ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 12 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-10 finished in 64004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 54 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-24 02:26:39] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-24 02:26:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:26:40] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-24 02:26:40] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 02:26:40] [INFO ] Invariant cache hit.
[2024-05-24 02:26:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 02:26:40] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2024-05-24 02:26:40] [INFO ] Redundant transitions in 8 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-24 02:26:40] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-24 02:26:40] [INFO ] Invariant cache hit.
[2024-05-24 02:26:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:44] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:26:44] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-24 02:26:44] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:26:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2024-05-24 02:26:45] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-24 02:26:46] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-05-24 02:26:46] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:26:46] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:26:46] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 02:26:47] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:48] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:26:49] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:26:49] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:26:50] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-24 02:26:50] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:26:50] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:26:51] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:26:52] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:26:52] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:26:52] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:26:52] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-05-24 02:26:53] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:26:53] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:26:53] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 2 ms to minimize.
[2024-05-24 02:26:53] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:26:58] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:26:58] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:26:59] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:26:59] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:26:59] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:26:59] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:26:59] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:27:00] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:27:00] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:27:00] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:27:00] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:27:01] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:27:01] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:27:01] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 3 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2024-05-24 02:27:02] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:27:03] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:27:04] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:27:04] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:27:04] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:27:04] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:27:05] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:27:05] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:27:05] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:27:06] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:27:06] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:27:06] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:27:06] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:27:07] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:27:08] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:27:08] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:27:08] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:27:08] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:27:09] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/436 variables, and 94 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:27:13] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:27:13] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2024-05-24 02:27:13] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-05-24 02:27:14] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 3 ms to minimize.
[2024-05-24 02:27:14] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-05-24 02:27:15] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:27:15] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:27:15] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:27:18] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:27:18] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:27:21] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:27:21] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2024-05-24 02:27:21] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:27:22] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:27:22] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:27:23] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:27:24] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:27:24] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:27:25] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:27:28] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:27:29] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:27:29] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:27:29] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:27:30] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:27:30] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 2 ms to minimize.
[2024-05-24 02:27:30] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 3 ms to minimize.
[2024-05-24 02:27:30] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-24 02:27:35] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:27:35] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:27:35] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2024-05-24 02:27:35] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:27:36] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:27:36] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:27:36] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-05-24 02:27:36] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:27:36] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:27:37] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:27:37] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:27:37] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:27:38] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/436 variables, and 134 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 118/118 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61530 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 8 reset in 168 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-11 finished in 61770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 29 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 02:27:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:27:41] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:27:41] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-24 02:27:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:27:41] [INFO ] Invariant cache hit.
[2024-05-24 02:27:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:27:42] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-05-24 02:27:42] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:27:42] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:27:42] [INFO ] Invariant cache hit.
[2024-05-24 02:27:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-24 02:27:46] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-05-24 02:27:47] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2024-05-24 02:27:48] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:27:49] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:27:49] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:27:50] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:27:50] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 3 ms to minimize.
[2024-05-24 02:27:50] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-24 02:27:50] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:27:51] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:27:51] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:27:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-24 02:27:51] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:27:51] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:27:52] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:27:52] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:27:52] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-24 02:27:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-24 02:27:53] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:27:53] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:27:53] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:27:53] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:27:54] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:28:00] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:28:00] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-24 02:28:00] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:28:00] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-05-24 02:28:00] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:28:01] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:28:02] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:28:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:28:02] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2024-05-24 02:28:02] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:28:03] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:28:05] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:28:06] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:28:07] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
[2024-05-24 02:28:07] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:28:08] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:28:08] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:28:10] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:28:11] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:28:12] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 30287ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31189 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 198 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 31460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(p1)||!p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 6 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 02:28:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 02:28:12] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:28:13] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-24 02:28:13] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:28:13] [INFO ] Invariant cache hit.
[2024-05-24 02:28:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:28:13] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:28:13] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:28:13] [INFO ] Invariant cache hit.
[2024-05-24 02:28:13] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:19] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-24 02:28:19] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-24 02:28:19] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:28:19] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 4 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:28:20] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:28:21] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-05-24 02:28:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-24 02:28:21] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2024-05-24 02:28:22] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:28:22] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:28:22] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:28:22] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:28:23] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:28:23] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:28:23] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:23] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:28:23] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-24 02:28:24] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:28:24] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:28:25] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:28:25] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-05-24 02:28:25] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-24 02:28:25] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:28:25] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:28:26] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:28:26] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:28:26] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 4 ms to minimize.
[2024-05-24 02:28:26] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:28:27] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:28:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-05-24 02:28:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 02:28:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:28:27] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 02:28:28] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:28:28] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:35] [INFO ] Deduced a trap composed of 77 places in 261 ms of which 4 ms to minimize.
[2024-05-24 02:28:35] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 4 ms to minimize.
[2024-05-24 02:28:35] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2024-05-24 02:28:35] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:28:36] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 4 ms to minimize.
[2024-05-24 02:28:36] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:28:36] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 4 ms to minimize.
[2024-05-24 02:28:36] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:28:37] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 4 ms to minimize.
[2024-05-24 02:28:37] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:28:37] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:28:37] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:28:38] [INFO ] Deduced a trap composed of 59 places in 281 ms of which 4 ms to minimize.
[2024-05-24 02:28:39] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 4 ms to minimize.
[2024-05-24 02:28:39] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 4 ms to minimize.
[2024-05-24 02:28:41] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 4 ms to minimize.
[2024-05-24 02:28:41] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 4 ms to minimize.
[2024-05-24 02:28:41] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:28:42] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 2 ms to minimize.
[2024-05-24 02:28:42] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:43] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 77 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:45] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:28:45] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:28:46] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:28:46] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:28:47] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 3 ms to minimize.
[2024-05-24 02:28:47] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:28:48] [INFO ] Deduced a trap composed of 86 places in 218 ms of which 5 ms to minimize.
[2024-05-24 02:28:48] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 4 ms to minimize.
[2024-05-24 02:28:48] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 5 ms to minimize.
[2024-05-24 02:28:48] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:28:49] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:28:49] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:28:49] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-05-24 02:28:49] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 5 ms to minimize.
[2024-05-24 02:28:50] [INFO ] Deduced a trap composed of 62 places in 255 ms of which 4 ms to minimize.
[2024-05-24 02:28:50] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 5 ms to minimize.
[2024-05-24 02:28:52] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:28:52] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:28:53] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 4 ms to minimize.
[2024-05-24 02:28:53] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:28:56] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 2 ms to minimize.
[2024-05-24 02:28:56] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 4 ms to minimize.
[2024-05-24 02:28:56] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:28:58] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 4 ms to minimize.
[2024-05-24 02:28:58] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:28:59] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:28:59] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 4 ms to minimize.
[2024-05-24 02:28:59] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:28:59] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:29:00] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:29:00] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 3 ms to minimize.
[2024-05-24 02:29:01] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 2 ms to minimize.
[2024-05-24 02:29:02] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:29:02] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:29:04] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 5 ms to minimize.
[2024-05-24 02:29:05] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 2 ms to minimize.
[2024-05-24 02:29:06] [INFO ] Deduced a trap composed of 94 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:29:06] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:29:06] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:29:07] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:08] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:29:08] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:29:09] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 4 ms to minimize.
[2024-05-24 02:29:09] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:29:09] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:29:09] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:29:12] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:29:13] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:29:13] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:29:13] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 4 ms to minimize.
[2024-05-24 02:29:14] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:29:14] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 60382ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61406 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 61601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 7 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-24 02:29:14] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:29:14] [INFO ] Invariant cache hit.
[2024-05-24 02:29:14] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-24 02:29:14] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:29:14] [INFO ] Invariant cache hit.
[2024-05-24 02:29:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:29:15] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:29:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:29:15] [INFO ] Invariant cache hit.
[2024-05-24 02:29:15] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:21] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:29:22] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:29:22] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 4 ms to minimize.
[2024-05-24 02:29:22] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 4 ms to minimize.
[2024-05-24 02:29:22] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 4 ms to minimize.
[2024-05-24 02:29:22] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:29:23] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:29:23] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:29:23] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 3 ms to minimize.
[2024-05-24 02:29:23] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 4 ms to minimize.
[2024-05-24 02:29:23] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 4 ms to minimize.
[2024-05-24 02:29:24] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:29:24] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:29:25] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:29:25] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 4 ms to minimize.
[2024-05-24 02:29:25] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 4 ms to minimize.
[2024-05-24 02:29:25] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 4 ms to minimize.
[2024-05-24 02:29:25] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:29:26] [INFO ] Deduced a trap composed of 46 places in 299 ms of which 4 ms to minimize.
[2024-05-24 02:29:26] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:26] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:29:27] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-24 02:29:27] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:29:28] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:29:28] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 4 ms to minimize.
[2024-05-24 02:29:28] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 2 ms to minimize.
[2024-05-24 02:29:28] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:29:29] [INFO ] Deduced a trap composed of 80 places in 276 ms of which 4 ms to minimize.
[2024-05-24 02:29:29] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 4 ms to minimize.
[2024-05-24 02:29:29] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 4 ms to minimize.
[2024-05-24 02:29:29] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:29:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 02:29:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 02:29:31] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 5 ms to minimize.
[2024-05-24 02:29:31] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:38] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 4 ms to minimize.
[2024-05-24 02:29:39] [INFO ] Deduced a trap composed of 86 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:29:39] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:29:39] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:29:39] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:29:40] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 4 ms to minimize.
[2024-05-24 02:29:40] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2024-05-24 02:29:40] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 4 ms to minimize.
[2024-05-24 02:29:40] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 4 ms to minimize.
[2024-05-24 02:29:41] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 4 ms to minimize.
[2024-05-24 02:29:41] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:29:41] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 4 ms to minimize.
[2024-05-24 02:29:42] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:29:42] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 5 ms to minimize.
[2024-05-24 02:29:43] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 4 ms to minimize.
[2024-05-24 02:29:44] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 4 ms to minimize.
[2024-05-24 02:29:44] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 4 ms to minimize.
[2024-05-24 02:29:44] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 4 ms to minimize.
[2024-05-24 02:29:45] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 4 ms to minimize.
[2024-05-24 02:29:45] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 76 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:48] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:29:48] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:29:48] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:29:48] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 4 ms to minimize.
[2024-05-24 02:29:48] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:29:49] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:29:49] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:29:49] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:29:49] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:29:49] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:29:50] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:29:50] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:29:50] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 4 ms to minimize.
[2024-05-24 02:29:51] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:29:51] [INFO ] Deduced a trap composed of 76 places in 321 ms of which 4 ms to minimize.
[2024-05-24 02:29:51] [INFO ] Deduced a trap composed of 78 places in 295 ms of which 4 ms to minimize.
[2024-05-24 02:29:52] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 5 ms to minimize.
[2024-05-24 02:29:52] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 4 ms to minimize.
[2024-05-24 02:29:52] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:29:54] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:29:55] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:29:57] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-05-24 02:29:58] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 5 ms to minimize.
[2024-05-24 02:30:00] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:30:00] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:30:00] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:30:00] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:30:01] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 3 ms to minimize.
[2024-05-24 02:30:01] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:30:01] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:30:01] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:30:02] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 4 ms to minimize.
[2024-05-24 02:30:02] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 8 ms to minimize.
[2024-05-24 02:30:02] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 5 ms to minimize.
[2024-05-24 02:30:03] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:30:03] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:30:03] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 4 ms to minimize.
[2024-05-24 02:30:04] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 4 ms to minimize.
[2024-05-24 02:30:04] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:30:04] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:07] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:30:07] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:30:07] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:30:13] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:30:13] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 4 ms to minimize.
[2024-05-24 02:30:14] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 3 ms to minimize.
[2024-05-24 02:30:14] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 4 ms to minimize.
[2024-05-24 02:30:15] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:30:15] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 4 ms to minimize.
[2024-05-24 02:30:15] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 126 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 110/110 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61372 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 215 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 8 ms. (steps per millisecond=27 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 8 ms. (steps per millisecond=27 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 4 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-24 02:30:17] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:30:17] [INFO ] Invariant cache hit.
[2024-05-24 02:30:17] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-24 02:30:17] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:30:17] [INFO ] Invariant cache hit.
[2024-05-24 02:30:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:30:18] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:30:18] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:30:18] [INFO ] Invariant cache hit.
[2024-05-24 02:30:18] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:25] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:30:25] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:30:26] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2024-05-24 02:30:26] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2024-05-24 02:30:26] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:30:26] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:30:26] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:30:27] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 4 ms to minimize.
[2024-05-24 02:30:27] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:30:27] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:30:27] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 4 ms to minimize.
[2024-05-24 02:30:28] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 02:30:28] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 3 ms to minimize.
[2024-05-24 02:30:28] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:30:29] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:30:29] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 4 ms to minimize.
[2024-05-24 02:30:29] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:30:29] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:30:30] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 4 ms to minimize.
[2024-05-24 02:30:30] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:30] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:30:30] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-24 02:30:31] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 4 ms to minimize.
[2024-05-24 02:30:31] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:30:32] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 4 ms to minimize.
[2024-05-24 02:30:32] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:30:32] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:30:32] [INFO ] Deduced a trap composed of 80 places in 224 ms of which 4 ms to minimize.
[2024-05-24 02:30:33] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:30:33] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 4 ms to minimize.
[2024-05-24 02:30:33] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 4 ms to minimize.
[2024-05-24 02:30:33] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 4 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 4 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-24 02:30:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 02:30:35] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 5 ms to minimize.
[2024-05-24 02:30:35] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:40] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 4 ms to minimize.
[2024-05-24 02:30:40] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 3 ms to minimize.
[2024-05-24 02:30:40] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:30:41] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:30:41] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:30:41] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 4 ms to minimize.
[2024-05-24 02:30:41] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 2 ms to minimize.
[2024-05-24 02:30:42] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:30:42] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 4 ms to minimize.
[2024-05-24 02:30:42] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:30:43] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 4 ms to minimize.
[2024-05-24 02:30:43] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:30:43] [INFO ] Deduced a trap composed of 59 places in 278 ms of which 5 ms to minimize.
[2024-05-24 02:30:44] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-05-24 02:30:44] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 4 ms to minimize.
[2024-05-24 02:30:46] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 4 ms to minimize.
[2024-05-24 02:30:46] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 4 ms to minimize.
[2024-05-24 02:30:46] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:30:46] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:30:47] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:48] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:30:48] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-24 02:30:49] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 79 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:30:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-24 02:30:50] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 3 ms to minimize.
[2024-05-24 02:30:51] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:30:52] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:30:53] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:30:54] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 4 ms to minimize.
[2024-05-24 02:30:54] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:30:54] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:30:54] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 4 ms to minimize.
[2024-05-24 02:30:55] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:30:56] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:30:56] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:30:56] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:30:56] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-05-24 02:30:57] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 2 ms to minimize.
[2024-05-24 02:30:59] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:31:01] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 3 ms to minimize.
[2024-05-24 02:31:01] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:31:01] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:31:02] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:31:03] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:31:03] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:31:03] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:31:10] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:31:11] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:31:12] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 4 ms to minimize.
[2024-05-24 02:31:12] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 4 ms to minimize.
[2024-05-24 02:31:12] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 4 ms to minimize.
[2024-05-24 02:31:12] [INFO ] Deduced a trap composed of 73 places in 240 ms of which 5 ms to minimize.
[2024-05-24 02:31:13] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 4 ms to minimize.
[2024-05-24 02:31:13] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:31:15] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:31:15] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 4 ms to minimize.
[2024-05-24 02:31:16] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 5 ms to minimize.
[2024-05-24 02:31:17] [INFO ] Deduced a trap composed of 50 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:31:17] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 4 ms to minimize.
[2024-05-24 02:31:17] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 116 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 100/100 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in LTL mode , in 1 iterations and 62134 ms. Remains : 275/275 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 10 ms. (steps per millisecond=21 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 11 ms. (steps per millisecond=19 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 274 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 700
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 275 transition count 808
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 275 transition count 808
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 275 transition count 808
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 270 transition count 803
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 270 transition count 803
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 46 ms. Remains 270 /275 variables (removed 5) and now considering 803/700 (removed -103) transitions.
[2024-05-24 02:31:21] [INFO ] Redundant transitions in 13 ms returned []
Running 798 sub problems to find dead transitions.
[2024-05-24 02:31:21] [INFO ] Flow matrix only has 414 transitions (discarded 389 similar events)
// Phase 1: matrix 414 rows 270 cols
[2024-05-24 02:31:21] [INFO ] Computed 16 invariants in 9 ms
[2024-05-24 02:31:21] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-24 02:31:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:31:30] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:31:31] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:31:31] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:31:31] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-05-24 02:31:32] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 2 ms to minimize.
[2024-05-24 02:31:33] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:31:33] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:31:33] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:31:33] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:31:34] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:31:34] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 3 ms to minimize.
[2024-05-24 02:31:34] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-05-24 02:31:34] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:31:34] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:31:35] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:31:35] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:31:35] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:31:35] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:31:36] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:31:36] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 4 ms to minimize.
[2024-05-24 02:31:36] [INFO ] Deduced a trap composed of 45 places in 324 ms of which 4 ms to minimize.
[2024-05-24 02:31:37] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:31:37] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2024-05-24 02:31:37] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-05-24 02:31:43] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 5 ms to minimize.
[2024-05-24 02:31:44] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:31:44] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 4 ms to minimize.
[2024-05-24 02:31:47] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 4 ms to minimize.
[2024-05-24 02:31:47] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-05-24 02:31:48] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 3 ms to minimize.
[2024-05-24 02:31:48] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:31:48] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 4 ms to minimize.
[2024-05-24 02:31:48] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:31:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 02:31:49] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-05-24 02:31:49] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-05-24 02:31:49] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 3 ms to minimize.
[2024-05-24 02:31:50] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:31:50] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 3 ms to minimize.
[2024-05-24 02:31:51] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
SMT process timed out in 30591ms, After SMT, problems are : Problem set: 207 solved, 591 unsolved
Search for dead transitions found 207 dead transitions in 30605ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 270/275 places, 596/700 transitions.
Graph (complete) has 1426 edges and 270 vertex of which 171 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.1 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 171 /270 variables (removed 99) and now considering 596/596 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30697 ms. Remains : 171/275 places, 596/700 transitions.
Built C files in :
/tmp/ltsmin4374738664953980349
[2024-05-24 02:31:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4374738664953980349
Running compilation step : cd /tmp/ltsmin4374738664953980349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2549 ms.
Running link step : cd /tmp/ltsmin4374738664953980349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4374738664953980349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12926386612721120753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-24 02:32:06] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 02:32:06] [INFO ] Computed 16 invariants in 9 ms
[2024-05-24 02:32:07] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-24 02:32:07] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:32:07] [INFO ] Invariant cache hit.
[2024-05-24 02:32:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:32:08] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 02:32:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 02:32:08] [INFO ] Invariant cache hit.
[2024-05-24 02:32:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:14] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:32:14] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:32:14] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 4 ms to minimize.
[2024-05-24 02:32:14] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:32:14] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:32:15] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2024-05-24 02:32:15] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 4 ms to minimize.
[2024-05-24 02:32:15] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:32:15] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2024-05-24 02:32:15] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:32:16] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 4 ms to minimize.
[2024-05-24 02:32:16] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:32:16] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 4 ms to minimize.
[2024-05-24 02:32:17] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 4 ms to minimize.
[2024-05-24 02:32:17] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 4 ms to minimize.
[2024-05-24 02:32:17] [INFO ] Deduced a trap composed of 60 places in 285 ms of which 4 ms to minimize.
[2024-05-24 02:32:18] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:32:18] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 4 ms to minimize.
[2024-05-24 02:32:18] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 4 ms to minimize.
[2024-05-24 02:32:18] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:19] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:32:19] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 5 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-24 02:32:20] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-24 02:32:21] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-24 02:32:21] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:32:21] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 4 ms to minimize.
[2024-05-24 02:32:21] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:32:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:32:23] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-05-24 02:32:23] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:29] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:32:29] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:32:30] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:32:30] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
[2024-05-24 02:32:30] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:32:30] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:32:31] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 4 ms to minimize.
[2024-05-24 02:32:31] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-24 02:32:31] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 2 ms to minimize.
[2024-05-24 02:32:32] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:32:32] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:32:32] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:32:33] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 4 ms to minimize.
[2024-05-24 02:32:33] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 4 ms to minimize.
[2024-05-24 02:32:34] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 5 ms to minimize.
[2024-05-24 02:32:35] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:32:35] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:32:35] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:32:36] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:32:36] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:37] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 77 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:39] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:32:40] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:32:40] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2024-05-24 02:32:41] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 3 ms to minimize.
[2024-05-24 02:32:41] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 4 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:32:42] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:32:43] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 4 ms to minimize.
[2024-05-24 02:32:43] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:32:43] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:32:43] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:32:43] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:32:45] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:32:45] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:32:46] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:32:46] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:32:48] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 3 ms to minimize.
[2024-05-24 02:32:49] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:32:49] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:32:51] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 4 ms to minimize.
[2024-05-24 02:32:51] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 4 ms to minimize.
[2024-05-24 02:32:51] [INFO ] Deduced a trap composed of 75 places in 248 ms of which 4 ms to minimize.
[2024-05-24 02:32:51] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:32:52] [INFO ] Deduced a trap composed of 79 places in 235 ms of which 4 ms to minimize.
[2024-05-24 02:32:52] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 4 ms to minimize.
[2024-05-24 02:32:52] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 4 ms to minimize.
[2024-05-24 02:32:53] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 4 ms to minimize.
[2024-05-24 02:32:53] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 4 ms to minimize.
[2024-05-24 02:32:54] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:32:55] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 2 ms to minimize.
[2024-05-24 02:32:56] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 5 ms to minimize.
[2024-05-24 02:32:57] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 4 ms to minimize.
[2024-05-24 02:32:58] [INFO ] Deduced a trap composed of 94 places in 293 ms of which 4 ms to minimize.
[2024-05-24 02:32:58] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 4 ms to minimize.
[2024-05-24 02:32:58] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 5 ms to minimize.
[2024-05-24 02:32:59] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 02:33:00] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 4 ms to minimize.
[2024-05-24 02:33:01] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 3 ms to minimize.
[2024-05-24 02:33:01] [INFO ] Deduced a trap composed of 57 places in 303 ms of which 5 ms to minimize.
[2024-05-24 02:33:01] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 4 ms to minimize.
[2024-05-24 02:33:02] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 4 ms to minimize.
[2024-05-24 02:33:02] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:33:05] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 4 ms to minimize.
[2024-05-24 02:33:05] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:33:05] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:33:06] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 4 ms to minimize.
[2024-05-24 02:33:06] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:33:06] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 2 ms to minimize.
[2024-05-24 02:33:07] [INFO ] Deduced a trap composed of 85 places in 242 ms of which 4 ms to minimize.
[2024-05-24 02:33:07] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:33:07] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:33:08] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 4 ms to minimize.
[2024-05-24 02:33:08] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 134 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 118/118 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Finished structural reductions in LTL mode , in 1 iterations and 61446 ms. Remains : 275/275 places, 700/700 transitions.
Built C files in :
/tmp/ltsmin5008698822443668275
[2024-05-24 02:33:08] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5008698822443668275
Running compilation step : cd /tmp/ltsmin5008698822443668275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2583 ms.
Running link step : cd /tmp/ltsmin5008698822443668275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5008698822443668275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17079989195721209741.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:33:23] [INFO ] Flatten gal took : 36 ms
[2024-05-24 02:33:23] [INFO ] Flatten gal took : 27 ms
[2024-05-24 02:33:23] [INFO ] Time to serialize gal into /tmp/LTL17763828532178925643.gal : 7 ms
[2024-05-24 02:33:23] [INFO ] Time to serialize properties into /tmp/LTL3008134148707358544.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17763828532178925643.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5905942413609994181.hoa' '-atoms' '/tmp/LTL3008134148707358544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3008134148707358544.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5905942413609994181.hoa
Detected timeout of ITS tools.
[2024-05-24 02:33:38] [INFO ] Flatten gal took : 26 ms
[2024-05-24 02:33:38] [INFO ] Flatten gal took : 37 ms
[2024-05-24 02:33:38] [INFO ] Time to serialize gal into /tmp/LTL12408686480646171869.gal : 9 ms
[2024-05-24 02:33:38] [INFO ] Time to serialize properties into /tmp/LTL5095494243140634394.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12408686480646171869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5095494243140634394.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((flag_2_waiting!=1)||(p33_4_2!=1))")))))
Formula 0 simplified : XXF!"((flag_2_waiting!=1)||(p33_4_2!=1))"
Detected timeout of ITS tools.
[2024-05-24 02:33:53] [INFO ] Flatten gal took : 26 ms
[2024-05-24 02:33:53] [INFO ] Applying decomposition
[2024-05-24 02:33:53] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10279081560791863398.txt' '-o' '/tmp/graph10279081560791863398.bin' '-w' '/tmp/graph10279081560791863398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10279081560791863398.bin' '-l' '-1' '-v' '-w' '/tmp/graph10279081560791863398.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:33:53] [INFO ] Decomposing Gal with order
[2024-05-24 02:33:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:33:53] [INFO ] Removed a total of 1065 redundant transitions.
[2024-05-24 02:33:53] [INFO ] Flatten gal took : 76 ms
[2024-05-24 02:33:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 32 ms.
[2024-05-24 02:33:54] [INFO ] Time to serialize gal into /tmp/LTL1152492270183032976.gal : 10 ms
[2024-05-24 02:33:54] [INFO ] Time to serialize properties into /tmp/LTL2289242158468470739.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1152492270183032976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2289242158468470739.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i11.i1.u1.flag_2_waiting!=1)||(i16.i0.u33.p33_4_2!=1))")))))
Formula 0 simplified : XXF!"((i11.i1.u1.flag_2_waiting!=1)||(i16.i0.u33.p33_4_2!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 294650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-06
Stuttering acceptance computed with spot in 217 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 21 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 02:34:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:34:09] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:34:09] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-24 02:34:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:34:09] [INFO ] Invariant cache hit.
[2024-05-24 02:34:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:34:10] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-24 02:34:10] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:34:10] [INFO ] Invariant cache hit.
[2024-05-24 02:34:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:13] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 3 ms to minimize.
[2024-05-24 02:34:13] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-24 02:34:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:34:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:34:14] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 02:34:14] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:34:14] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:34:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:34:14] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:34:15] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2024-05-24 02:34:16] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:34:16] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:34:16] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:34:16] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-24 02:34:16] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:18] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-24 02:34:18] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:34:19] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:34:19] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 02:34:19] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:34:19] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 4 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:34:20] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:34:21] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:34:21] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:34:21] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:34:21] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:34:21] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:34:22] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:34:22] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:34:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:27] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:34:27] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:34:27] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:34:27] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:34:27] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:34:28] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:34:29] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 4 ms to minimize.
[2024-05-24 02:34:29] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:34:29] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:34:29] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:34:30] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:34:30] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:31] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:34:32] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 4 ms to minimize.
[2024-05-24 02:34:32] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-05-24 02:34:32] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2024-05-24 02:34:32] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-05-24 02:34:34] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:34:35] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:34:35] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:34:35] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:34:35] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:34:36] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-05-24 02:34:36] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:34:36] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:34:36] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:34:36] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:34:37] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:34:37] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:34:37] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:34:37] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-05-24 02:34:37] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 93 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:42] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2024-05-24 02:34:43] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:34:44] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:34:44] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:34:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:34:45] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:34:45] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:34:46] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:34:46] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:34:47] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:34:47] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:34:47] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:34:47] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-24 02:34:48] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:34:48] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:34:48] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-05-24 02:34:48] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:49] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:34:52] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:34:52] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:34:52] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:34:53] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:34:53] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:34:55] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:34:57] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:34:57] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:34:58] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:34:58] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:34:58] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:34:58] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:35:01] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-24 02:35:02] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:35:02] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:35:02] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:35:02] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:35:03] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 2 ms to minimize.
[2024-05-24 02:35:04] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:35:04] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:35:05] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:35:05] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:35:05] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-24 02:35:06] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:35:07] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:35:07] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:35:07] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:35:09] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:35:09] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:35:10] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:35:10] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 147 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 131/131 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61172 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 181 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 211 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 827112 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 1
Probabilistic random walk after 827112 steps, saw 158997 distinct states, run finished after 3004 ms. (steps per millisecond=275 ) properties seen :0
[2024-05-24 02:35:14] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:35:14] [INFO ] Invariant cache hit.
[2024-05-24 02:35:14] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:35:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:35:14] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-24 02:35:14] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:35:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:35:15] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:35:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 27 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 828834 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 828834 steps, saw 159190 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-05-24 02:35:18] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:35:18] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:35:18] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:35:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:35:18] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 02:35:18] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:35:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:35:19] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:35:19] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-24 02:35:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 02:35:19] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:35:19] [INFO ] Invariant cache hit.
[2024-05-24 02:35:19] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-24 02:35:19] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:35:19] [INFO ] Invariant cache hit.
[2024-05-24 02:35:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:35:20] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-24 02:35:20] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:35:20] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:35:20] [INFO ] Invariant cache hit.
[2024-05-24 02:35:20] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:24] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:35:24] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:35:24] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:35:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:35:24] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:35:25] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:35:26] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:35:27] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:35:28] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:35:29] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-24 02:35:29] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:35:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-24 02:35:30] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:35:30] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:35:31] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:35:32] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:35:32] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:35:32] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:35:32] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:35:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:35:33] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 3 ms to minimize.
[2024-05-24 02:35:33] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:36] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-24 02:35:38] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 3 ms to minimize.
[2024-05-24 02:35:38] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:35:38] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:35:38] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:35:39] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:35:39] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:35:40] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:44] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:35:44] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:35:44] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:35:45] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-24 02:35:47] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:35:48] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-24 02:35:48] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2024-05-24 02:35:48] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:35:48] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:49] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:35:49] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:35:49] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:35:50] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:35:50] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:35:50] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:35:50] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 91 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:35:53] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:35:53] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:35:53] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:35:53] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:35:53] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:35:54] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
[2024-05-24 02:35:54] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:35:54] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:35:55] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-24 02:35:55] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-05-24 02:35:55] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:35:55] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:35:55] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:35:56] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:35:57] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:35:57] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:35:57] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:35:58] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:35:58] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:35:59] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:36:02] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:36:02] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:36:02] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:36:02] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:36:03] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 1 ms to minimize.
[2024-05-24 02:36:04] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:36:04] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:36:05] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:36:08] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-05-24 02:36:08] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:36:10] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:36:10] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:36:11] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:36:11] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:36:11] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:36:11] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-05-24 02:36:11] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:36:16] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:36:16] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:36:17] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:36:17] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:36:17] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:36:18] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 134 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 118/118 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61368 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 23 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 02:36:20] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 02:36:20] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:36:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-24 02:36:21] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:36:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:36:21] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 02:36:21] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:36:21] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:36:21] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 02:36:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 101 ms
TRAPS : Iteration 1
[2024-05-24 02:36:21] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:36:21] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p2)]
Support contains 3 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 13 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 02:36:21] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:36:21] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:36:21] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-24 02:36:21] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:36:21] [INFO ] Invariant cache hit.
[2024-05-24 02:36:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:36:22] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2024-05-24 02:36:22] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:36:22] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:36:22] [INFO ] Invariant cache hit.
[2024-05-24 02:36:22] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:36:25] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:36:25] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-24 02:36:25] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 02:36:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:36:26] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:36:26] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:36:26] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:36:26] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 6 ms to minimize.
[2024-05-24 02:36:26] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:36:27] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2024-05-24 02:36:27] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 4 ms to minimize.
[2024-05-24 02:36:27] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-05-24 02:36:27] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:36:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:36:28] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:36:28] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:36:28] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:36:29] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:36:29] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:36:29] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:36:31] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:36:31] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:36:31] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:36:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 02:36:32] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:36:32] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:36:33] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:36:34] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-24 02:36:34] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2024-05-24 02:36:34] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-05-24 02:36:34] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:36:34] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-05-24 02:36:35] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:36:35] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-24 02:36:35] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:36:40] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:36:41] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-24 02:36:41] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2024-05-24 02:36:41] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 2 ms to minimize.
[2024-05-24 02:36:42] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 3 ms to minimize.
[2024-05-24 02:36:42] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 2 ms to minimize.
[2024-05-24 02:36:42] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:36:42] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-05-24 02:36:42] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:36:43] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:36:43] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:36:43] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-24 02:36:43] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:36:43] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-24 02:36:44] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2024-05-24 02:36:44] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:36:44] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:36:46] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:36:46] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:36:47] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-05-24 02:36:47] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:36:47] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:36:48] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:36:49] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:36:49] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:36:49] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:36:49] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:36:49] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:36:50] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:36:51] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:36:51] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:36:51] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 93 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:36:55] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 2 ms to minimize.
[2024-05-24 02:36:55] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:36:56] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:36:56] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:36:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:36:57] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-24 02:36:57] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:36:57] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:36:58] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-05-24 02:36:58] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:36:59] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:37:00] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/110 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:37:01] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:37:02] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-24 02:37:03] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:37:03] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:37:04] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:37:04] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:37:06] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:37:08] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:37:08] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:37:09] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-05-24 02:37:09] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2024-05-24 02:37:09] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-05-24 02:37:09] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:37:12] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:37:12] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:37:12] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:37:12] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:37:12] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 1 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-24 02:37:13] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:37:14] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:37:15] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:37:15] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:37:15] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:37:15] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:37:16] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:37:16] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:37:16] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:37:18] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:37:19] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:37:19] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 5 ms to minimize.
[2024-05-24 02:37:19] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:37:19] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-24 02:37:20] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:37:20] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:37:20] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:37:21] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 152 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 136/136 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61154 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 836898 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836898 steps, saw 160588 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-05-24 02:37:25] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:37:25] [INFO ] Invariant cache hit.
[2024-05-24 02:37:25] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:37:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1092ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 18 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 820674 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 820674 steps, saw 157687 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2024-05-24 02:37:30] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:37:30] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:37:30] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-24 02:37:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 987ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 02:37:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:37:31] [INFO ] Invariant cache hit.
[2024-05-24 02:37:31] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-24 02:37:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:37:31] [INFO ] Invariant cache hit.
[2024-05-24 02:37:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:37:31] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2024-05-24 02:37:32] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:37:32] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:37:32] [INFO ] Invariant cache hit.
[2024-05-24 02:37:32] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:37:36] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 02:37:37] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:37:38] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:37:38] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:37:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:37:38] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 2 ms to minimize.
[2024-05-24 02:37:39] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:37:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-24 02:37:39] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:37:40] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-05-24 02:37:40] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:37:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 02:37:41] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:37:41] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:37:42] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:37:43] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:37:43] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:37:43] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:37:43] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:37:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:37:44] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:37:44] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:37:47] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-24 02:37:50] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:37:50] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:37:50] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:37:50] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:37:50] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:37:51] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:37:51] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:37:55] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:37:55] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:37:56] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:37:57] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2024-05-24 02:37:58] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:37:58] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:37:58] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:37:58] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-24 02:37:58] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:37:59] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-24 02:37:59] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:37:59] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:37:59] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-24 02:37:59] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:00] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:38:01] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:38:01] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:38:01] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:38:01] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:38:02] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:38:02] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 91 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:04] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:38:04] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:38:04] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:38:04] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:38:05] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2024-05-24 02:38:05] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:38:05] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:38:05] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:38:06] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:38:06] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:38:06] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:38:06] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 02:38:06] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:38:07] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:38:08] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:38:08] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-24 02:38:08] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:38:08] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:38:09] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:38:10] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:13] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:38:13] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:38:13] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:38:13] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:38:14] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:38:15] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:38:15] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:38:16] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:19] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:38:19] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:38:20] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 3 ms to minimize.
[2024-05-24 02:38:21] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 2 ms to minimize.
[2024-05-24 02:38:22] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:38:22] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2024-05-24 02:38:22] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:38:22] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:38:22] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:26] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:38:26] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:38:27] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:38:27] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:38:27] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:38:28] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:31] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-05-24 02:38:31] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:38:32] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 137 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 121/121 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61205 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 18 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 02:38:32] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 02:38:32] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:38:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 02:38:32] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:38:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:38:32] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 02:38:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:38:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:38:32] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-24 02:38:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
TRAPS : Iteration 1
[2024-05-24 02:38:32] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:38:32] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 362 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 271 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Built C files in :
/tmp/ltsmin3421857290532096787
[2024-05-24 02:38:33] [INFO ] Computing symmetric may disable matrix : 596 transitions.
[2024-05-24 02:38:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:38:33] [INFO ] Computing symmetric may enable matrix : 596 transitions.
[2024-05-24 02:38:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:38:33] [INFO ] Computing Do-Not-Accords matrix : 596 transitions.
[2024-05-24 02:38:33] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:38:33] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3421857290532096787
Running compilation step : cd /tmp/ltsmin3421857290532096787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2800 ms.
Running link step : cd /tmp/ltsmin3421857290532096787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3421857290532096787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16113806964217869967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 11 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-24 02:38:48] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:38:48] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 02:38:48] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-24 02:38:48] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:38:48] [INFO ] Invariant cache hit.
[2024-05-24 02:38:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:38:49] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-24 02:38:49] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:38:49] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:38:49] [INFO ] Invariant cache hit.
[2024-05-24 02:38:49] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:53] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:38:53] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 02:38:53] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:38:54] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:38:55] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:38:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:38:56] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:38:57] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:38:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:38:57] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:38:58] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:38:59] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:38:59] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:39:00] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 3 ms to minimize.
[2024-05-24 02:39:00] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:39:00] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:39:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 02:39:01] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:39:01] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:39:01] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-05-24 02:39:01] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:39:01] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:39:02] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:39:02] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 2 ms to minimize.
[2024-05-24 02:39:02] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-05-24 02:39:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 02:39:02] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 3 ms to minimize.
[2024-05-24 02:39:03] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:07] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:39:09] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
[2024-05-24 02:39:10] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:39:10] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2024-05-24 02:39:10] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:39:10] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:39:11] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:39:11] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:16] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:39:16] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:39:17] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:39:17] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:39:17] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:39:17] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:39:17] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 2 ms to minimize.
[2024-05-24 02:39:18] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:39:18] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:39:18] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 74 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:23] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:39:23] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:39:23] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:39:23] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:39:24] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:39:24] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:39:24] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:39:24] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:39:25] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:39:26] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-05-24 02:39:26] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:39:26] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:27] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
[2024-05-24 02:39:27] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:39:27] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:39:27] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-24 02:39:27] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:39:28] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2024-05-24 02:39:28] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2024-05-24 02:39:28] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:39:28] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-05-24 02:39:28] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:39:29] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:39:29] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:39:29] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 2 ms to minimize.
[2024-05-24 02:39:30] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:39:30] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:39:30] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:39:30] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:39:31] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2024-05-24 02:39:31] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-24 02:39:31] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:34] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:39:34] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:39:34] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:39:34] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:39:35] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 3 ms to minimize.
[2024-05-24 02:39:36] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:38] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 3 ms to minimize.
[2024-05-24 02:39:39] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:39:39] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:39:39] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:39:44] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:39:46] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 118 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 102/102 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61054 ms. Remains : 170/171 places, 595/596 transitions.
Built C files in :
/tmp/ltsmin1675841767332493934
[2024-05-24 02:39:49] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-05-24 02:39:49] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:39:49] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-05-24 02:39:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:39:49] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-05-24 02:39:49] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:39:49] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1675841767332493934
Running compilation step : cd /tmp/ltsmin1675841767332493934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2972 ms.
Running link step : cd /tmp/ltsmin1675841767332493934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1675841767332493934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13920726670786682521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:40:04] [INFO ] Flatten gal took : 18 ms
[2024-05-24 02:40:04] [INFO ] Flatten gal took : 18 ms
[2024-05-24 02:40:04] [INFO ] Time to serialize gal into /tmp/LTL11186139426931145015.gal : 6 ms
[2024-05-24 02:40:04] [INFO ] Time to serialize properties into /tmp/LTL3953612362051116486.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11186139426931145015.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15882850524790804344.hoa' '-atoms' '/tmp/LTL3953612362051116486.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3953612362051116486.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15882850524790804344.hoa
Detected timeout of ITS tools.
[2024-05-24 02:40:19] [INFO ] Flatten gal took : 17 ms
[2024-05-24 02:40:19] [INFO ] Flatten gal took : 16 ms
[2024-05-24 02:40:19] [INFO ] Time to serialize gal into /tmp/LTL16136507038431215007.gal : 5 ms
[2024-05-24 02:40:19] [INFO ] Time to serialize properties into /tmp/LTL13606871835238629782.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16136507038431215007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13606871835238629782.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((X("((flag_1_waiting==1)&&(p33_4_1==1))"))U("(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))"))||(G("(((turn_4==0)||(flag_4_idle==...178
Formula 0 simplified : !"(((turn_3==1)&&(flag_3_idle==1))&&(p25_2_0==1))" & F!"(((turn_4==0)||(flag_4_idle==0))||(p25_1_3==0))" & X(!"(((turn_3==1)&&(flag_...224
Detected timeout of ITS tools.
[2024-05-24 02:40:34] [INFO ] Flatten gal took : 16 ms
[2024-05-24 02:40:34] [INFO ] Applying decomposition
[2024-05-24 02:40:34] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13099219434595851195.txt' '-o' '/tmp/graph13099219434595851195.bin' '-w' '/tmp/graph13099219434595851195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13099219434595851195.bin' '-l' '-1' '-v' '-w' '/tmp/graph13099219434595851195.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:40:34] [INFO ] Decomposing Gal with order
[2024-05-24 02:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:40:34] [INFO ] Removed a total of 1042 redundant transitions.
[2024-05-24 02:40:34] [INFO ] Flatten gal took : 44 ms
[2024-05-24 02:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 22 ms.
[2024-05-24 02:40:35] [INFO ] Time to serialize gal into /tmp/LTL3421239387815392427.gal : 7 ms
[2024-05-24 02:40:35] [INFO ] Time to serialize properties into /tmp/LTL14733770995743979347.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3421239387815392427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14733770995743979347.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((X("((i6.i1.u2.flag_1_waiting==1)&&(i5.u14.p33_4_1==1))"))U("(((i2.u3.turn_3==1)&&(i3.i1.u43.flag_3_idle==1))&&(i1.u1.p25_2_0==1))...238
Formula 0 simplified : !"(((i2.u3.turn_3==1)&&(i3.i1.u43.flag_3_idle==1))&&(i1.u1.p25_2_0==1))" & F!"(((i1.u1.turn_4==0)||(i6.i1.u23.flag_4_idle==0))||(i0....306
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 400993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-15
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 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 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 29 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-24 02:40:50] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:40:50] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:40:50] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-24 02:40:50] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:40:50] [INFO ] Invariant cache hit.
[2024-05-24 02:40:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:40:51] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-24 02:40:51] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:40:51] [INFO ] Invariant cache hit.
[2024-05-24 02:40:51] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:40:55] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:40:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-24 02:40:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 02:40:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:40:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:40:56] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:40:56] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-24 02:40:56] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:40:56] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:40:57] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-24 02:40:58] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:40:58] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 02:40:58] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:40:58] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:40:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:41:00] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:41:00] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:41:00] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:41:00] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 02:41:01] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-24 02:41:01] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:41:01] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-05-24 02:41:02] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:41:02] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:41:02] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:41:03] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:41:03] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-05-24 02:41:03] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:41:03] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2024-05-24 02:41:03] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-05-24 02:41:04] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 3 ms to minimize.
[2024-05-24 02:41:04] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:41:04] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:41:06] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:12] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-24 02:41:12] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:41:12] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
[2024-05-24 02:41:12] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:41:12] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:41:13] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:15] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:41:15] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:41:16] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 1 ms to minimize.
[2024-05-24 02:41:17] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2024-05-24 02:41:18] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:41:18] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2024-05-24 02:41:18] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-24 02:41:18] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:41:18] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:41:19] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:41:20] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:41:20] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 74 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:24] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:41:24] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-05-24 02:41:25] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:41:25] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:41:25] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-24 02:41:26] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 2 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:41:27] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:41:28] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
[2024-05-24 02:41:28] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:41:28] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:30] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:41:31] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:41:31] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:41:31] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:41:32] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:41:32] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:41:32] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:41:32] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-24 02:41:33] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:41:33] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-24 02:41:33] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 2 ms to minimize.
[2024-05-24 02:41:34] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:41:34] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:41:35] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:41:35] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:41:35] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:41:35] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 4 ms to minimize.
[2024-05-24 02:41:36] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 2 ms to minimize.
[2024-05-24 02:41:36] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:41:38] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:38] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:41:39] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-05-24 02:41:39] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:41:42] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-24 02:41:42] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:41:43] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-05-24 02:41:43] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:49] [INFO ] Deduced a trap composed of 52 places in 239 ms of which 3 ms to minimize.
[2024-05-24 02:41:50] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2024-05-24 02:41:50] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:41:50] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 3 ms to minimize.
[2024-05-24 02:41:51] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 126 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 110/110 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61522 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 270 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 6 ms. (steps per millisecond=18 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 6 ms. (steps per millisecond=18 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 02:41:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:41:53] [INFO ] Invariant cache hit.
[2024-05-24 02:41:53] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-24 02:41:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:41:53] [INFO ] Invariant cache hit.
[2024-05-24 02:41:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:41:54] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-24 02:41:54] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:41:54] [INFO ] Invariant cache hit.
[2024-05-24 02:41:54] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:41:59] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:41:59] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-24 02:41:59] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 02:41:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:41:59] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:42:00] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:42:00] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-24 02:42:00] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:42:00] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:42:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-24 02:42:01] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:42:01] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-05-24 02:42:01] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-24 02:42:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:42:01] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 2 ms to minimize.
[2024-05-24 02:42:02] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:42:02] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2024-05-24 02:42:02] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-24 02:42:02] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:42:02] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:42:04] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-24 02:42:04] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:42:05] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 7 ms to minimize.
[2024-05-24 02:42:05] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 02:42:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:42:06] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-24 02:42:06] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2024-05-24 02:42:07] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-05-24 02:42:07] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:42:08] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 4 ms to minimize.
[2024-05-24 02:42:08] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-05-24 02:42:08] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 02:42:08] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-05-24 02:42:09] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-24 02:42:09] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:42:09] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:42:09] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-05-24 02:42:10] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:42:11] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:18] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-05-24 02:42:18] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:42:19] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-05-24 02:42:19] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 2 ms to minimize.
[2024-05-24 02:42:19] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:42:19] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:22] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-05-24 02:42:23] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:42:24] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:27] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:42:29] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-05-24 02:42:29] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:42:30] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:42:30] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:42:30] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:42:30] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-05-24 02:42:31] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 7 ms to minimize.
[2024-05-24 02:42:31] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:42:31] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:42:31] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-05-24 02:42:32] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 2 ms to minimize.
[2024-05-24 02:42:33] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:42:34] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:42:34] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:42:34] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-24 02:42:34] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:37] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-24 02:42:37] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-05-24 02:42:38] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:42:38] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-05-24 02:42:38] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:42:38] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:42:39] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 2 ms to minimize.
[2024-05-24 02:42:39] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:42:39] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:42:39] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-05-24 02:42:40] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:42:40] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:42:40] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:42:41] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:42:41] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:42:41] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:42:43] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:42:43] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:47] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2024-05-24 02:42:47] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-24 02:42:48] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-05-24 02:42:48] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-24 02:42:48] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-05-24 02:42:50] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2024-05-24 02:42:50] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:42:50] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:53] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-24 02:42:54] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:42:54] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 111 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 95/95 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in LTL mode , in 1 iterations and 61689 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 5 ms. (steps per millisecond=22 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-24 02:42:56] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 02:42:56] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:42:56] [INFO ] Invariant cache hit.
[2024-05-24 02:42:56] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:42:59] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:42:59] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-24 02:42:59] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-24 02:42:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:42:59] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 02:43:00] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:43:01] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:43:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:43:03] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:43:03] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-24 02:43:03] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-24 02:43:03] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:43:04] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-24 02:43:04] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:43:04] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:43:05] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-24 02:43:05] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2024-05-24 02:43:05] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:43:06] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:43:07] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:43:08] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:43:14] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:43:14] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:43:14] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-05-24 02:43:15] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-05-24 02:43:15] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:43:15] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:43:18] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:43:18] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 02:43:18] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:43:19] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:43:20] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:43:20] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:43:20] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:43:20] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:43:20] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-24 02:43:21] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-24 02:43:22] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2024-05-24 02:43:22] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 02:43:24] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2024-05-24 02:43:24] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:43:25] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:43:26] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-24 02:43:26] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-24 02:43:26] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-24 02:43:26] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30356 ms. Remains : 171/171 places, 596/596 transitions.
Built C files in :
/tmp/ltsmin10117276278499716917
[2024-05-24 02:43:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10117276278499716917
Running compilation step : cd /tmp/ltsmin10117276278499716917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1874 ms.
Running link step : cd /tmp/ltsmin10117276278499716917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10117276278499716917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7382233756131483684.hoa' '--buchi-type=spotba'
LTSmin run took 4131 ms.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 162432 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-24 02:43:32] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10628624438178511788
[2024-05-24 02:43:32] [INFO ] Computing symmetric may disable matrix : 725 transitions.
[2024-05-24 02:43:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:43:32] [INFO ] Computing symmetric may enable matrix : 725 transitions.
[2024-05-24 02:43:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:43:32] [INFO ] Applying decomposition
[2024-05-24 02:43:32] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12586286024719836005.txt' '-o' '/tmp/graph12586286024719836005.bin' '-w' '/tmp/graph12586286024719836005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12586286024719836005.bin' '-l' '-1' '-v' '-w' '/tmp/graph12586286024719836005.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:43:32] [INFO ] Decomposing Gal with order
[2024-05-24 02:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:43:32] [INFO ] Computing Do-Not-Accords matrix : 725 transitions.
[2024-05-24 02:43:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:43:32] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10628624438178511788
Running compilation step : cd /tmp/ltsmin10628624438178511788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 02:43:32] [INFO ] Removed a total of 1107 redundant transitions.
[2024-05-24 02:43:32] [INFO ] Flatten gal took : 54 ms
[2024-05-24 02:43:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 14 ms.
[2024-05-24 02:43:32] [INFO ] Time to serialize gal into /tmp/LTLFireability17679092117085660315.gal : 10 ms
[2024-05-24 02:43:32] [INFO ] Time to serialize properties into /tmp/LTLFireability15107225955404149908.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17679092117085660315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15107225955404149908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((((X("((i11.u0.flag_1_waiting==1)&&(i1.i0.u80.p33_4_1==1))"))U("(((i14.u2.turn_3==1)&&(i10.i1.u4.flag_3_idle==1))&&(i14.u2.p25_2_0==...240
Formula 0 simplified : !"(((i14.u2.turn_3==1)&&(i10.i1.u4.flag_3_idle==1))&&(i14.u2.p25_2_0==1))" & F!"(((i14.u2.turn_4==0)||(i13.u1.flag_4_idle==0))||(i13...310
Compilation finished in 3628 ms.
Running link step : cd /tmp/ltsmin10628624438178511788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10628624438178511788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t9, t62, t63, t64, t65, t66, t67, t70, t71, t72, t73, t74, t75, t...2167
LTSmin run took 1520581 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3505723 ms.

BK_STOP 1716520137393

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="EisenbergMcGuire-PT-05"
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-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-05, 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 r158-smll-171636266300164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;