About the Execution of LTSMin+red for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16212.539 | 1134238.00 | 3005683.00 | 10622.60 | FTFFFF?FTFF?TTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951000852.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000852
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679664906346
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 13:35:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 13:35:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:35:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 13:35:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 13:35:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2023-03-24 13:35:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 13:35:09] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 13:35:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10002 steps, including 225 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 13:35:10] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-24 13:35:10] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-24 13:35:10] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-24 13:35:10] [INFO ] After 66ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-24 13:35:10] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-24 13:35:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 13:35:10] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-24 13:35:10] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-24 13:35:10] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 95 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=95 )
Parikh walk visited 10 properties in 7 ms.
[2023-03-24 13:35:10] [INFO ] Flatten gal took : 31 ms
[2023-03-24 13:35:10] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-24 13:35:10] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 31 ms.
[2023-03-24 13:35:10] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 3637 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 32 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:35:11] [INFO ] Computed 3232 place invariants in 208 ms
[2023-03-24 13:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 13:35:12] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2023-03-24 13:35:12] [INFO ] Invariant cache hit.
[2023-03-24 13:35:15] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 4168 ms to find 0 implicit places.
[2023-03-24 13:35:15] [INFO ] Invariant cache hit.
[2023-03-24 13:35:15] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4970 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3637 out of 3736 places after structural reductions.
[2023-03-24 13:35:16] [INFO ] Flatten gal took : 319 ms
[2023-03-24 13:35:16] [INFO ] Flatten gal took : 171 ms
[2023-03-24 13:35:17] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 13:35:18] [INFO ] Invariant cache hit.
[2023-03-24 13:35:21] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 732 ms returned sat
[2023-03-24 13:35:21] [INFO ] After 2691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 13:35:23] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 799 ms returned sat
[2023-03-24 13:35:46] [INFO ] After 21707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-24 13:35:46] [INFO ] After 21714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 13:35:46] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 16 Parikh solutions to 10 different solutions.
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=31 )
Parikh walk visited 16 properties in 55 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(G(p2))||p1))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.47 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 3700 transition count 502
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3700 transition count 502
Applied a total of 4 rules in 972 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 13:35:48] [INFO ] Computed 3200 place invariants in 122 ms
[2023-03-24 13:35:50] [INFO ] Implicit Places using invariants in 2574 ms returned []
[2023-03-24 13:35:50] [INFO ] Invariant cache hit.
[2023-03-24 13:35:55] [INFO ] Implicit Places using invariants and state equation in 4975 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 7553 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 163 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8688 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3492 1)) (AND (GEQ s0 1) (GEQ s3490 1)) (AND (GEQ s0 1) (GEQ s3493 1)) (AND (GEQ s0 1) (GEQ s3491 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 9056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 3700 transition count 502
Applied a total of 3 rules in 576 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 13:35:56] [INFO ] Computed 3200 place invariants in 89 ms
[2023-03-24 13:36:00] [INFO ] Implicit Places using invariants in 3784 ms returned []
[2023-03-24 13:36:00] [INFO ] Invariant cache hit.
[2023-03-24 13:36:10] [INFO ] Implicit Places using invariants and state equation in 10253 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 14042 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 270 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14888 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2465 reset in 784 ms.
Product exploration explored 100000 steps with 2457 reset in 719 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 335 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 17626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 118 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:36:13] [INFO ] Computed 3232 place invariants in 72 ms
[2023-03-24 13:36:16] [INFO ] Implicit Places using invariants in 2746 ms returned []
[2023-03-24 13:36:16] [INFO ] Invariant cache hit.
[2023-03-24 13:36:25] [INFO ] Implicit Places using invariants and state equation in 9311 ms returned []
Implicit Place search using SMT with State Equation took 12069 ms to find 0 implicit places.
[2023-03-24 13:36:25] [INFO ] Invariant cache hit.
[2023-03-24 13:36:27] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13858 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 14044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 5 place count 3699 transition count 501
Applied a total of 5 rules in 302 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-24 13:36:28] [INFO ] Computed 3200 place invariants in 71 ms
[2023-03-24 13:36:30] [INFO ] Implicit Places using invariants in 2556 ms returned []
[2023-03-24 13:36:30] [INFO ] Invariant cache hit.
[2023-03-24 13:36:39] [INFO ] Implicit Places using invariants and state equation in 9109 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 11672 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3666/3736 places, 501/506 transitions.
Applied a total of 0 rules in 146 ms. Remains 3666 /3666 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12122 ms. Remains : 3666/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 12252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Support contains 67 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 239 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:36:40] [INFO ] Computed 3232 place invariants in 73 ms
[2023-03-24 13:36:44] [INFO ] Implicit Places using invariants in 3715 ms returned []
[2023-03-24 13:36:44] [INFO ] Invariant cache hit.
[2023-03-24 13:36:54] [INFO ] Implicit Places using invariants and state equation in 9991 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13709 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14185 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, p1, true, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 14322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((p1&&X(p1))||p0))&&(X(G(p2))||F(p3))))'
Support contains 2245 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 41 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:36:54] [INFO ] Invariant cache hit.
[2023-03-24 13:36:56] [INFO ] Implicit Places using invariants in 1690 ms returned []
[2023-03-24 13:36:56] [INFO ] Invariant cache hit.
[2023-03-24 13:37:01] [INFO ] Implicit Places using invariants and state equation in 5091 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
[2023-03-24 13:37:01] [INFO ] Invariant cache hit.
[2023-03-24 13:37:01] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7534 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 41 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-05 finished in 7768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:37:02] [INFO ] Invariant cache hit.
[2023-03-24 13:37:06] [INFO ] Implicit Places using invariants in 3694 ms returned []
[2023-03-24 13:37:06] [INFO ] Invariant cache hit.
[2023-03-24 13:37:16] [INFO ] Implicit Places using invariants and state equation in 10041 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13754 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 236 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14233 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2679 reset in 569 ms.
Product exploration explored 100000 steps with 2681 reset in 564 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 367 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 269 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 130 ms. (steps per millisecond=71 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 132 ms. (steps per millisecond=70 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 418 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 238 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 13:37:20] [INFO ] Computed 3200 place invariants in 415 ms
[2023-03-24 13:37:23] [INFO ] Implicit Places using invariants in 4010 ms returned []
[2023-03-24 13:37:23] [INFO ] Invariant cache hit.
[2023-03-24 13:37:35] [INFO ] Implicit Places using invariants and state equation in 11767 ms returned []
Implicit Place search using SMT with State Equation took 15781 ms to find 0 implicit places.
[2023-03-24 13:37:35] [INFO ] Invariant cache hit.
[2023-03-24 13:37:37] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17657 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 117 ms. (steps per millisecond=79 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 119 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2679 reset in 493 ms.
Product exploration explored 100000 steps with 2678 reset in 524 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3669 transition count 506
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 821 ms. Remains 3669 /3703 variables (removed 34) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:37:40] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 506 rows 3669 cols
[2023-03-24 13:37:41] [INFO ] Computed 3168 place invariants in 613 ms
[2023-03-24 13:37:43] [INFO ] Dead Transitions using invariants and state equation in 2217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3099 ms. Remains : 3669/3703 places, 506/506 transitions.
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 13:37:43] [INFO ] Computed 3200 place invariants in 389 ms
[2023-03-24 13:37:50] [INFO ] Implicit Places using invariants in 7510 ms returned []
[2023-03-24 13:37:50] [INFO ] Invariant cache hit.
[2023-03-24 13:38:04] [INFO ] Implicit Places using invariants and state equation in 13694 ms returned []
Implicit Place search using SMT with State Equation took 21209 ms to find 0 implicit places.
[2023-03-24 13:38:04] [INFO ] Invariant cache hit.
[2023-03-24 13:38:06] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23078 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 64427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(!p0) U p1) U p2)||G((G(p3)||X(p1))))))'
Support contains 1158 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 123 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:38:06] [INFO ] Computed 3232 place invariants in 61 ms
[2023-03-24 13:38:12] [INFO ] Implicit Places using invariants in 5400 ms returned []
[2023-03-24 13:38:12] [INFO ] Invariant cache hit.
[2023-03-24 13:38:22] [INFO ] Implicit Places using invariants and state equation in 10118 ms returned []
Implicit Place search using SMT with State Equation took 15520 ms to find 0 implicit places.
[2023-03-24 13:38:22] [INFO ] Invariant cache hit.
[2023-03-24 13:38:23] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17281 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s3607 1)) (AND (GEQ s0 1) (GEQ s3608 1)) (AND (GEQ s0 1) (GEQ s3605 1)) (AND (GEQ s0 1) (GEQ s3606 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 17840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))&&p0)))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 3700 transition count 502
Applied a total of 3 rules in 533 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 13:38:25] [INFO ] Computed 3200 place invariants in 61 ms
[2023-03-24 13:38:28] [INFO ] Implicit Places using invariants in 3783 ms returned []
[2023-03-24 13:38:28] [INFO ] Invariant cache hit.
[2023-03-24 13:38:40] [INFO ] Implicit Places using invariants and state equation in 12142 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15929 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 270 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16732 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3573 1)) (OR (LT s0 1) (LT s3572 1)) (OR (LT s0 1) (LT s3571 1)) (OR (LT s0 1) (LT s3570 1)) (OR (LT s0 1) (LT s3577 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2466 reset in 821 ms.
Product exploration explored 100000 steps with 2462 reset in 916 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 418 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 485941 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 485941 steps, saw 84557 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-24 13:38:48] [INFO ] Computed 3136 place invariants in 660 ms
[2023-03-24 13:38:49] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 780 ms returned sat
[2023-03-24 13:38:50] [INFO ] After 2729ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 546 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 35 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 273 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-24 13:38:51] [INFO ] Invariant cache hit.
[2023-03-24 13:38:58] [INFO ] Implicit Places using invariants in 6738 ms returned []
[2023-03-24 13:38:58] [INFO ] Invariant cache hit.
[2023-03-24 13:39:10] [INFO ] Implicit Places using invariants and state equation in 12341 ms returned []
Implicit Place search using SMT with State Equation took 19097 ms to find 0 implicit places.
[2023-03-24 13:39:10] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-24 13:39:10] [INFO ] Invariant cache hit.
[2023-03-24 13:39:12] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21019 ms. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-08 finished in 49067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3700 transition count 502
Applied a total of 5 rules in 527 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 13:39:14] [INFO ] Computed 3200 place invariants in 66 ms
[2023-03-24 13:39:17] [INFO ] Implicit Places using invariants in 3723 ms returned []
[2023-03-24 13:39:17] [INFO ] Invariant cache hit.
[2023-03-24 13:39:29] [INFO ] Implicit Places using invariants and state equation in 11616 ms returned [3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15341 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3736 places, 502/506 transitions.
Applied a total of 0 rules in 264 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16132 ms. Remains : 3667/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3525 1)) (AND (GEQ s0 1) (GEQ s3523 1)) (AND (GEQ s0 1) (GEQ s3526 1)) (AND (GEQ s0 1) (GEQ s3524 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-10 finished in 16191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1||G(p0))))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:39:30] [INFO ] Computed 3232 place invariants in 73 ms
[2023-03-24 13:39:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 13:39:33] [INFO ] Implicit Places using invariants in 3922 ms returned []
[2023-03-24 13:39:33] [INFO ] Invariant cache hit.
[2023-03-24 13:39:45] [INFO ] Implicit Places using invariants and state equation in 11745 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15671 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 241 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16165 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s3700 1) (LT s3701 1)), p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22340 reset in 1242 ms.
Product exploration explored 100000 steps with 22623 reset in 1269 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 13:39:49] [INFO ] Computed 3200 place invariants in 396 ms
[2023-03-24 13:39:51] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 776 ms returned sat
[2023-03-24 13:39:52] [INFO ] After 1446ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 13:39:52] [INFO ] After 1585ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-24 13:39:52] [INFO ] After 2929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:39:53] [INFO ] Invariant cache hit.
[2023-03-24 13:40:00] [INFO ] Implicit Places using invariants in 7156 ms returned []
[2023-03-24 13:40:00] [INFO ] Invariant cache hit.
[2023-03-24 13:40:14] [INFO ] Implicit Places using invariants and state equation in 14098 ms returned []
Implicit Place search using SMT with State Equation took 21257 ms to find 0 implicit places.
[2023-03-24 13:40:14] [INFO ] Invariant cache hit.
[2023-03-24 13:40:16] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23125 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:40:17] [INFO ] Invariant cache hit.
[2023-03-24 13:40:18] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 796 ms returned sat
[2023-03-24 13:40:20] [INFO ] After 1438ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 13:40:20] [INFO ] After 1562ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-24 13:40:20] [INFO ] After 2933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22386 reset in 1306 ms.
Product exploration explored 100000 steps with 21893 reset in 1324 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 103 are kept as prefixes of interest. Removing 3600 places using SCC suffix rule.10 ms
Discarding 3600 places :
Also discarding 237 output transitions
Drop transitions removed 237 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 103 transition count 71
Applied a total of 199 rules in 17 ms. Remains 103 /3703 variables (removed 3600) and now considering 71/506 (removed 435) transitions.
[2023-03-24 13:40:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 103 cols
[2023-03-24 13:40:24] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-24 13:40:24] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/3703 places, 71/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 103/3703 places, 71/506 transitions.
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 249 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 13:40:24] [INFO ] Computed 3200 place invariants in 395 ms
[2023-03-24 13:40:28] [INFO ] Implicit Places using invariants in 4139 ms returned []
[2023-03-24 13:40:28] [INFO ] Invariant cache hit.
[2023-03-24 13:40:40] [INFO ] Implicit Places using invariants and state equation in 11510 ms returned []
Implicit Place search using SMT with State Equation took 15651 ms to find 0 implicit places.
[2023-03-24 13:40:40] [INFO ] Invariant cache hit.
[2023-03-24 13:40:40] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16655 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-11 finished in 71205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:40:41] [INFO ] Computed 3232 place invariants in 69 ms
[2023-03-24 13:40:44] [INFO ] Implicit Places using invariants in 3690 ms returned []
[2023-03-24 13:40:44] [INFO ] Invariant cache hit.
[2023-03-24 13:40:55] [INFO ] Implicit Places using invariants and state equation in 10243 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13935 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 241 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14433 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s0 1) (LT s3499 1)) (OR (LT s0 1) (LT s3509 1)) (OR (LT s0 1) (LT s3508 1)) (OR (LT s0 1) (LT s3511 1)) (OR (LT s0 1) (LT s3510 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4003 reset in 555 ms.
Product exploration explored 100000 steps with 3981 reset in 577 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 16415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:40:57] [INFO ] Invariant cache hit.
[2023-03-24 13:41:01] [INFO ] Implicit Places using invariants in 3705 ms returned []
[2023-03-24 13:41:01] [INFO ] Invariant cache hit.
[2023-03-24 13:41:11] [INFO ] Implicit Places using invariants and state equation in 10650 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14359 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14855 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1623 ms.
Product exploration explored 100000 steps with 33333 reset in 1634 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 18926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X((!p1 U (p2||G(!p1)))) U (p1&&X((!p1 U (p2||G(!p1)))))))||p0)))'
Support contains 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:41:16] [INFO ] Invariant cache hit.
[2023-03-24 13:41:20] [INFO ] Implicit Places using invariants in 3779 ms returned []
[2023-03-24 13:41:20] [INFO ] Invariant cache hit.
[2023-03-24 13:41:29] [INFO ] Implicit Places using invariants and state equation in 9465 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13248 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13745 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s3601 1) (GEQ s3600 1) (GEQ s3603 1) (GEQ s3602 1) (GEQ s3599 1) (GEQ s3598 1) (GEQ s3609 1) (GEQ s3608 1) (GEQ s3611 1) (GEQ s3610 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13252 reset in 1071 ms.
Product exploration explored 100000 steps with 13010 reset in 1080 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 510 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (AND (NOT p2) p1), true, false, false]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 13:41:34] [INFO ] Computed 3200 place invariants in 396 ms
[2023-03-24 13:41:36] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 818 ms returned sat
[2023-03-24 13:41:36] [INFO ] After 1478ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2023-03-24 13:41:37] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 828 ms returned sat
[2023-03-24 13:41:39] [INFO ] After 1751ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-24 13:41:40] [INFO ] After 2212ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-24 13:41:40] [INFO ] After 4078ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 3 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (OR p0 p2 (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p1), (F (AND (NOT p2) p1)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 828 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
[2023-03-24 13:41:41] [INFO ] Invariant cache hit.
[2023-03-24 13:41:49] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 6842 ms returned sat
[2023-03-24 13:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:41:56] [INFO ] [Real]Absence check using state equation in 6790 ms returned unknown
Could not prove EG (NOT p1)
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 13:41:56] [INFO ] Invariant cache hit.
[2023-03-24 13:42:00] [INFO ] Implicit Places using invariants in 3693 ms returned []
[2023-03-24 13:42:00] [INFO ] Invariant cache hit.
[2023-03-24 13:42:12] [INFO ] Implicit Places using invariants and state equation in 12206 ms returned []
Implicit Place search using SMT with State Equation took 15900 ms to find 0 implicit places.
[2023-03-24 13:42:12] [INFO ] Invariant cache hit.
[2023-03-24 13:42:13] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16991 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 463073 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463073 steps, saw 81845 distinct states, run finished after 3002 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:42:17] [INFO ] Invariant cache hit.
[2023-03-24 13:42:17] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Property proved to be false thanks to knowledge :(G (OR p0 (NOT p1)))
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-14 finished in 62082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-32-LTLFireability-06
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.19 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 3700 transition count 502
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3700 transition count 502
Applied a total of 4 rules in 825 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 13:42:19] [INFO ] Computed 3200 place invariants in 77 ms
[2023-03-24 13:42:23] [INFO ] Implicit Places using invariants in 3993 ms returned []
[2023-03-24 13:42:23] [INFO ] Invariant cache hit.
[2023-03-24 13:42:33] [INFO ] Implicit Places using invariants and state equation in 10252 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 14251 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 258 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 15334 ms. Remains : 3634/3736 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2465 reset in 573 ms.
Product exploration explored 100000 steps with 2463 reset in 604 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 244 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1361937 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 1361937 steps, saw 210258 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-24 13:42:39] [INFO ] Computed 3136 place invariants in 481 ms
[2023-03-24 13:42:40] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 751 ms returned sat
[2023-03-24 13:42:41] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:42:42] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 787 ms returned sat
[2023-03-24 13:42:43] [INFO ] After 1696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 13:42:44] [INFO ] After 1844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-24 13:42:44] [INFO ] After 3197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 231 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-24 13:42:45] [INFO ] Invariant cache hit.
[2023-03-24 13:42:51] [INFO ] Implicit Places using invariants in 6762 ms returned []
[2023-03-24 13:42:51] [INFO ] Invariant cache hit.
[2023-03-24 13:43:04] [INFO ] Implicit Places using invariants and state equation in 12751 ms returned []
Implicit Place search using SMT with State Equation took 19514 ms to find 0 implicit places.
[2023-03-24 13:43:04] [INFO ] Invariant cache hit.
[2023-03-24 13:43:06] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21261 ms. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1344499 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1344499 steps, saw 208014 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:43:10] [INFO ] Invariant cache hit.
[2023-03-24 13:43:11] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 762 ms returned sat
[2023-03-24 13:43:11] [INFO ] After 1247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:43:12] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 794 ms returned sat
[2023-03-24 13:43:14] [INFO ] After 1737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 13:43:14] [INFO ] After 1892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-24 13:43:14] [INFO ] After 3273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2465 reset in 589 ms.
Product exploration explored 100000 steps with 2461 reset in 594 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3634 transition count 502
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 493 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-24 13:43:16] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2023-03-24 13:43:17] [INFO ] Computed 3136 place invariants in 475 ms
[2023-03-24 13:43:19] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3634 places, 502/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2600 ms. Remains : 3634/3634 places, 502/502 transitions.
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 242 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-24 13:43:19] [INFO ] Computed 3136 place invariants in 535 ms
[2023-03-24 13:43:23] [INFO ] Implicit Places using invariants in 4241 ms returned []
[2023-03-24 13:43:23] [INFO ] Invariant cache hit.
[2023-03-24 13:43:35] [INFO ] Implicit Places using invariants and state equation in 12394 ms returned []
Implicit Place search using SMT with State Equation took 16636 ms to find 0 implicit places.
[2023-03-24 13:43:35] [INFO ] Invariant cache hit.
[2023-03-24 13:43:37] [INFO ] Dead Transitions using invariants and state equation in 1602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18484 ms. Remains : 3634/3634 places, 502/502 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 79347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1||G(p0))))))'
[2023-03-24 13:43:37] [INFO ] Flatten gal took : 109 ms
[2023-03-24 13:43:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-24 13:43:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 9 ms.
Total runtime 509607 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1966/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1966/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-COL-32-LTLFireability-06
Could not compute solution for formula : QuasiCertifProtocol-COL-32-LTLFireability-11
BK_STOP 1679666040584
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name QuasiCertifProtocol-COL-32-LTLFireability-06
ltl formula formula --ltl=/tmp/1966/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3736 places, 506 transitions and 7870 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1966/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1966/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1966/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1966/ltl_0_
ltl formula name QuasiCertifProtocol-COL-32-LTLFireability-11
ltl formula formula --ltl=/tmp/1966/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3736 places, 506 transitions and 7870 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1966/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1966/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1966/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1966/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d82dada3f4]
1: pnml2lts-mc(+0xa2496) [0x55d82dada496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbd532f2140]
3: pnml2lts-mc(+0x405be5) [0x55d82de3dbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55d82dba33f9]
5: pnml2lts-mc(+0x164ac4) [0x55d82db9cac4]
6: pnml2lts-mc(+0x272e0a) [0x55d82dcaae0a]
7: pnml2lts-mc(+0xb61f0) [0x55d82daee1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbd531454d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbd5314567a]
10: pnml2lts-mc(+0xa1581) [0x55d82dad9581]
11: pnml2lts-mc(+0xa1910) [0x55d82dad9910]
12: pnml2lts-mc(+0xa32a2) [0x55d82dadb2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d82dadd0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55d82de2b4b3]
15: pnml2lts-mc(+0x7c63d) [0x55d82dab463d]
16: pnml2lts-mc(+0x67d86) [0x55d82da9fd86]
17: pnml2lts-mc(+0x60a8a) [0x55d82da98a8a]
18: pnml2lts-mc(+0x5eb15) [0x55d82da96b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbd5312dd0a]
20: pnml2lts-mc(+0x6075e) [0x55d82da9875e]
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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-32, 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 r297-tall-167873951000852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;