Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400931.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400931
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.5K Apr 30 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:34 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-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652985680778

Running Version 202205111006
[2022-05-19 18:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 18:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 18:41:22] [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.
[2022-05-19 18:41:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 18:41:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 610 ms
[2022-05-19 18:41:22] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 18:41:22] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 8 ms.
[2022-05-19 18:41:22] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-09 TRUE 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 14 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 10001 steps, including 318 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 35) seen :19
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 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 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 11 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 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 10 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 10 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 10 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 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 18:41:23] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-19 18:41:23] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 18:41:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 18:41:23] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2022-05-19 18:41:23] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-19 18:41:23] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 11 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=98 )
Parikh walk visited 14 properties in 22 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 18:41:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 18:41:23] [INFO ] Flatten gal took : 17 ms
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 18:41:23] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2022-05-19 18:41:23] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 22 ms.
[2022-05-19 18:41:23] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 1344 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1920 transition count 356
Applied a total of 46 rules in 71 ms. Remains 1920 /1966 variables (removed 46) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 18:41:23] [INFO ] Computed 1565 place invariants in 101 ms
[2022-05-19 18:41:25] [INFO ] Implicit Places using invariants in 1366 ms returned []
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 18:41:25] [INFO ] Computed 1565 place invariants in 60 ms
[2022-05-19 18:41:27] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 3333 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 18:41:27] [INFO ] Computed 1565 place invariants in 51 ms
[2022-05-19 18:41:27] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1920/1966 places, 356/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1920/1966 places, 356/356 transitions.
Support contains 1344 out of 1920 places after structural reductions.
[2022-05-19 18:41:28] [INFO ] Flatten gal took : 143 ms
[2022-05-19 18:41:28] [INFO ] Flatten gal took : 119 ms
[2022-05-19 18:41:28] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 815 out of 1920 places (down from 1344) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 356 rows 1920 cols
[2022-05-19 18:41:29] [INFO ] Computed 1565 place invariants in 39 ms
[2022-05-19 18:41:29] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-19 18:41:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-19 18:41:30] [INFO ] [Nat]Absence check using 2 positive and 1563 generalized place invariants in 276 ms returned sat
[2022-05-19 18:41:41] [INFO ] After 9960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-19 18:41:55] [INFO ] Deduced a trap composed of 6 places in 443 ms of which 1 ms to minimize.
[2022-05-19 18:41:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 18:41:55] [INFO ] After 25469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
Parikh walk visited 18 properties in 49 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1920 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1920 transition count 356
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p2)))'
Support contains 70 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1917 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.21 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1916 transition count 355
Applied a total of 2 rules in 324 ms. Remains 1916 /1920 variables (removed 4) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1916 cols
[2022-05-19 18:41:56] [INFO ] Computed 1562 place invariants in 24 ms
[2022-05-19 18:41:58] [INFO ] Implicit Places using invariants in 2145 ms returned []
// Phase 1: matrix 355 rows 1916 cols
[2022-05-19 18:41:58] [INFO ] Computed 1562 place invariants in 34 ms
[2022-05-19 18:42:02] [INFO ] Implicit Places using invariants and state equation in 4044 ms returned [1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6201 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1920 places, 355/356 transitions.
Applied a total of 0 rules in 91 ms. Remains 1870 /1870 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1870/1920 places, 355/356 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771 s1772) s1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 63 steps with 2 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-02 finished in 6968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(((G(p1)||p2) U G(p1))||p1))))'
Support contains 93 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1916 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1915 transition count 355
Applied a total of 3 rules in 184 ms. Remains 1915 /1920 variables (removed 5) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1915 cols
[2022-05-19 18:42:02] [INFO ] Computed 1562 place invariants in 46 ms
[2022-05-19 18:42:04] [INFO ] Implicit Places using invariants in 1976 ms returned []
// Phase 1: matrix 355 rows 1915 cols
[2022-05-19 18:42:04] [INFO ] Computed 1562 place invariants in 32 ms
[2022-05-19 18:42:08] [INFO ] Implicit Places using invariants and state equation in 3755 ms returned [1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5737 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1920 places, 355/356 transitions.
Applied a total of 0 rules in 89 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1869/1920 places, 355/356 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s1703 s1704 s1705 s1706 s1707 s1708 s1709 s1710 s1711 s1712 s1713 s1714 s1715 s1716 s1717 s1718 s1719 s1720 s1721 s1722 s1723 s1724 s1725) s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3486 reset in 630 ms.
Product exploration explored 100000 steps with 3478 reset in 464 ms.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 (NOT p2) (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), true, (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 769 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:11] [INFO ] Computed 1518 place invariants in 144 ms
[2022-05-19 18:42:11] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 18:42:12] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 254 ms returned sat
[2022-05-19 18:42:14] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 18:42:16] [INFO ] After 3701ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 276 ms.
[2022-05-19 18:42:16] [INFO ] After 4585ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), true, (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (NOT p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 21 factoid took 798 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 70 out of 1869 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 64 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:17] [INFO ] Computed 1518 place invariants in 134 ms
[2022-05-19 18:42:19] [INFO ] Implicit Places using invariants in 2143 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:19] [INFO ] Computed 1518 place invariants in 127 ms
[2022-05-19 18:42:23] [INFO ] Implicit Places using invariants and state equation in 3796 ms returned []
Implicit Place search using SMT with State Equation took 5941 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:23] [INFO ] Computed 1518 place invariants in 135 ms
[2022-05-19 18:42:24] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
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 355 rows 1869 cols
[2022-05-19 18:42:25] [INFO ] Computed 1518 place invariants in 123 ms
[2022-05-19 18:42:25] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:42:25] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 259 ms returned sat
[2022-05-19 18:42:26] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:42:26] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-19 18:42:26] [INFO ] After 1250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p1 p2))]
Knowledge based reduction with 9 factoid took 807 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3472 reset in 394 ms.
Product exploration explored 100000 steps with 3478 reset in 361 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 70 out of 1869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 355/355 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 1869 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 267 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2022-05-19 18:42:29] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:29] [INFO ] Computed 1518 place invariants in 123 ms
[2022-05-19 18:42:29] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1869 places, 355/355 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Product exploration explored 100000 steps with 3471 reset in 345 ms.
Product exploration explored 100000 steps with 3468 reset in 337 ms.
Built C files in :
/tmp/ltsmin10719048383543117494
[2022-05-19 18:42:30] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10719048383543117494
Running compilation step : cd /tmp/ltsmin10719048383543117494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin10719048383543117494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10719048383543117494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3217496814113967613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 70 out of 1869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 86 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:45] [INFO ] Computed 1518 place invariants in 123 ms
[2022-05-19 18:42:47] [INFO ] Implicit Places using invariants in 2125 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:48] [INFO ] Computed 1518 place invariants in 137 ms
[2022-05-19 18:42:51] [INFO ] Implicit Places using invariants and state equation in 3627 ms returned []
Implicit Place search using SMT with State Equation took 5758 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:42:51] [INFO ] Computed 1518 place invariants in 144 ms
[2022-05-19 18:42:52] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1869 places, 355/355 transitions.
Built C files in :
/tmp/ltsmin1481392508571489725
[2022-05-19 18:42:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1481392508571489725
Running compilation step : cd /tmp/ltsmin1481392508571489725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1157 ms.
Running link step : cd /tmp/ltsmin1481392508571489725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1481392508571489725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17040266681116006678.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:43:07] [INFO ] Flatten gal took : 62 ms
[2022-05-19 18:43:07] [INFO ] Flatten gal took : 63 ms
[2022-05-19 18:43:07] [INFO ] Time to serialize gal into /tmp/LTL12698478280084117299.gal : 9 ms
[2022-05-19 18:43:07] [INFO ] Time to serialize properties into /tmp/LTL15879860603916607378.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12698478280084117299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15879860603916607378.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1269847...268
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10+Sst...1484
Formula 0 simplified : !G(F"((((((Sstart_0+Sstart_1)+(Sstart_2+Sstart_3))+((Sstart_4+Sstart_5)+(Sstart_6+Sstart_7)))+(((Sstart_8+Sstart_9)+(Sstart_10+Sstar...1471
Detected timeout of ITS tools.
[2022-05-19 18:43:22] [INFO ] Flatten gal took : 50 ms
[2022-05-19 18:43:22] [INFO ] Applying decomposition
[2022-05-19 18:43:22] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13171408329302940677.txt' '-o' '/tmp/graph13171408329302940677.bin' '-w' '/tmp/graph13171408329302940677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13171408329302940677.bin' '-l' '-1' '-v' '-w' '/tmp/graph13171408329302940677.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:43:23] [INFO ] Decomposing Gal with order
[2022-05-19 18:43:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:43:23] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-19 18:43:23] [INFO ] Flatten gal took : 313 ms
[2022-05-19 18:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 122 ms.
[2022-05-19 18:43:23] [INFO ] Time to serialize gal into /tmp/LTL16206731508311532154.gal : 23 ms
[2022-05-19 18:43:24] [INFO ] Time to serialize properties into /tmp/LTL2121046511790956647.ltl : 264 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16206731508311532154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2121046511790956647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1620673...267
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((gi3.gu32.Sstart_0+gi3.gu32.Sstart_1)+(gi3.gu32.Sstart_2+gi3.gu32.Sstart_3))+((gi3.gu32.Sstart_4+gi3.gu32.Sstart_5)+(gi3...2672
Formula 0 simplified : !G(F"((((((gi3.gu32.Sstart_0+gi3.gu32.Sstart_1)+(gi3.gu32.Sstart_2+gi3.gu32.Sstart_3))+((gi3.gu32.Sstart_4+gi3.gu32.Sstart_5)+(gi3.g...2659
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4881251146757217175
[2022-05-19 18:43:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4881251146757217175
Running compilation step : cd /tmp/ltsmin4881251146757217175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1186 ms.
Running link step : cd /tmp/ltsmin4881251146757217175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4881251146757217175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-03 finished in 111674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X((G(X(p0))&&F(p1)))))))))'
Support contains 48 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1916 transition count 356
Applied a total of 4 rules in 81 ms. Remains 1916 /1920 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 18:43:54] [INFO ] Computed 1562 place invariants in 38 ms
[2022-05-19 18:43:56] [INFO ] Implicit Places using invariants in 1995 ms returned []
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 18:43:56] [INFO ] Computed 1562 place invariants in 32 ms
[2022-05-19 18:44:00] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5872 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1920 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1893/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 9}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={0} source=9 dest: 9}]], initial=8, aps=[p0:(GT s1890 (ADD s1703 s1704 s1705 s1706 s1707 s1708 s1709 s1710 s1711 s1712 s1713 s1714 s1715 s1716 s1717 s1718 s1719 s1720 s1721 s1722 s1723 s1724 s172...], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-04 finished in 6400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 26 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1917 transition count 356
Applied a total of 3 rules in 84 ms. Remains 1917 /1920 variables (removed 3) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 18:44:00] [INFO ] Computed 1563 place invariants in 77 ms
[2022-05-19 18:44:03] [INFO ] Implicit Places using invariants in 2597 ms returned []
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 18:44:03] [INFO ] Computed 1563 place invariants in 69 ms
[2022-05-19 18:44:07] [INFO ] Implicit Places using invariants and state equation in 4355 ms returned []
Implicit Place search using SMT with State Equation took 6977 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 18:44:07] [INFO ] Computed 1563 place invariants in 70 ms
[2022-05-19 18:44:08] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1920 places, 356/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1917/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 2 s1914) (LEQ 3 s1)), p1:(LEQ s1911 (ADD s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766...], 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 50000 reset in 1346 ms.
Product exploration explored 100000 steps with 50000 reset in 1369 ms.
Computed a total of 1917 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1917 transition count 356
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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-05 finished in 11022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 23 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1892 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 184 ms. Remains 1889 /1920 variables (removed 31) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2022-05-19 18:44:11] [INFO ] Computed 1540 place invariants in 23 ms
[2022-05-19 18:44:13] [INFO ] Implicit Places using invariants in 1997 ms returned []
// Phase 1: matrix 351 rows 1889 cols
[2022-05-19 18:44:13] [INFO ] Computed 1540 place invariants in 32 ms
[2022-05-19 18:44:17] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5906 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1920 places, 351/356 transitions.
Applied a total of 0 rules in 79 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1843/1920 places, 351/356 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771))...], 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 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-06 finished in 6217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G(F(p0))&&G(p1)))))))'
Support contains 575 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 765 are kept as prefixes of interest. Removing 1155 places using SCC suffix rule.6 ms
Discarding 1155 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 764 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 763 transition count 215
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 763 transition count 215
Applied a total of 72 rules in 34 ms. Remains 763 /1920 variables (removed 1157) and now considering 215/356 (removed 141) transitions.
// Phase 1: matrix 215 rows 763 cols
[2022-05-19 18:44:18] [INFO ] Computed 550 place invariants in 18 ms
[2022-05-19 18:44:18] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 215 rows 763 cols
[2022-05-19 18:44:18] [INFO ] Computed 550 place invariants in 2 ms
[2022-05-19 18:44:18] [INFO ] Implicit Places using invariants and state equation in 392 ms returned [622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 634 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 717/1920 places, 215/356 transitions.
Applied a total of 0 rules in 6 ms. Remains 717 /717 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 717/1920 places, 215/356 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s552)), p0:(LEQ (ADD s553 s55...], 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 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-10 finished in 750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F((F(!p0)||p1))))'
Support contains 47 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1916 transition count 356
Applied a total of 4 rules in 77 ms. Remains 1916 /1920 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 18:44:18] [INFO ] Computed 1562 place invariants in 40 ms
[2022-05-19 18:44:20] [INFO ] Implicit Places using invariants in 2095 ms returned []
// Phase 1: matrix 356 rows 1916 cols
[2022-05-19 18:44:20] [INFO ] Computed 1562 place invariants in 33 ms
[2022-05-19 18:44:24] [INFO ] Implicit Places using invariants and state equation in 3945 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6047 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1920 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1893/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s1795 s1796 s1797 s1798 s1799 s1800 s1801 s1802 s1803 s1804 s1805 s1806 s1807 s1808 s1809 s1810 s1811 s1812 s1813 s1814 s1815 s1816 s1817) s1...], 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 3719 reset in 283 ms.
Product exploration explored 100000 steps with 3711 reset in 324 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 341 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 373 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 952 steps, run visited all 1 properties in 10 ms. (steps per millisecond=95 )
Probabilistic random walk after 952 steps, saw 928 distinct states, run finished after 11 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 24 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:27] [INFO ] Computed 1540 place invariants in 125 ms
[2022-05-19 18:44:29] [INFO ] Implicit Places using invariants in 2139 ms returned []
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:29] [INFO ] Computed 1540 place invariants in 128 ms
[2022-05-19 18:44:33] [INFO ] Implicit Places using invariants and state equation in 3969 ms returned []
Implicit Place search using SMT with State Equation took 6111 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:33] [INFO ] Computed 1540 place invariants in 118 ms
[2022-05-19 18:44:33] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 952 steps, run visited all 1 properties in 6 ms. (steps per millisecond=158 )
Probabilistic random walk after 952 steps, saw 928 distinct states, run finished after 6 ms. (steps per millisecond=158 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3712 reset in 292 ms.
Product exploration explored 100000 steps with 3719 reset in 305 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 24 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1869 transition count 355
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 160 ms. Remains 1869 /1893 variables (removed 24) and now considering 355/356 (removed 1) transitions.
[2022-05-19 18:44:35] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 355 rows 1869 cols
[2022-05-19 18:44:35] [INFO ] Computed 1518 place invariants in 212 ms
[2022-05-19 18:44:36] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 355/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1869/1893 places, 355/356 transitions.
Product exploration explored 100000 steps with 3709 reset in 663 ms.
Product exploration explored 100000 steps with 3720 reset in 667 ms.
Built C files in :
/tmp/ltsmin1968823025822189236
[2022-05-19 18:44:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1968823025822189236
Running compilation step : cd /tmp/ltsmin1968823025822189236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1166 ms.
Running link step : cd /tmp/ltsmin1968823025822189236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1968823025822189236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17636523653604862839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:53] [INFO ] Computed 1540 place invariants in 139 ms
[2022-05-19 18:44:55] [INFO ] Implicit Places using invariants in 2085 ms returned []
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:55] [INFO ] Computed 1540 place invariants in 140 ms
[2022-05-19 18:44:59] [INFO ] Implicit Places using invariants and state equation in 3924 ms returned []
Implicit Place search using SMT with State Equation took 6012 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1893 cols
[2022-05-19 18:44:59] [INFO ] Computed 1540 place invariants in 115 ms
[2022-05-19 18:44:59] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin9902559279983905286
[2022-05-19 18:44:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9902559279983905286
Running compilation step : cd /tmp/ltsmin9902559279983905286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1163 ms.
Running link step : cd /tmp/ltsmin9902559279983905286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9902559279983905286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9999882301490307923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:45:14] [INFO ] Flatten gal took : 46 ms
[2022-05-19 18:45:14] [INFO ] Flatten gal took : 44 ms
[2022-05-19 18:45:14] [INFO ] Time to serialize gal into /tmp/LTL3918924585254524016.gal : 8 ms
[2022-05-19 18:45:14] [INFO ] Time to serialize properties into /tmp/LTL504347752139266190.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3918924585254524016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL504347752139266190.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3918924...265
Read 1 LTL properties
Checking formula 0 : !(((G(X("((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+(((s3_1...588
Formula 0 simplified : !(GX"((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+(((s3_16+...576
Detected timeout of ITS tools.
[2022-05-19 18:45:30] [INFO ] Flatten gal took : 45 ms
[2022-05-19 18:45:30] [INFO ] Applying decomposition
[2022-05-19 18:45:30] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15818262905634282927.txt' '-o' '/tmp/graph15818262905634282927.bin' '-w' '/tmp/graph15818262905634282927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15818262905634282927.bin' '-l' '-1' '-v' '-w' '/tmp/graph15818262905634282927.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:45:30] [INFO ] Decomposing Gal with order
[2022-05-19 18:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:45:30] [INFO ] Removed a total of 252 redundant transitions.
[2022-05-19 18:45:30] [INFO ] Flatten gal took : 138 ms
[2022-05-19 18:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 42 ms.
[2022-05-19 18:45:30] [INFO ] Time to serialize gal into /tmp/LTL9790065604053092615.gal : 14 ms
[2022-05-19 18:45:30] [INFO ] Time to serialize properties into /tmp/LTL9082439045156145237.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9790065604053092615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9082439045156145237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9790065...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("((((((gu95.s3_0+gu95.s3_1)+(gu95.s3_2+gu95.s3_3))+((gu95.s3_4+gu95.s3_5)+(gu95.s3_6+gu95.s3_7)))+(((gu95.s3_8+gu95.s3_9)+(gu9...943
Formula 0 simplified : !(GX"((((((gu95.s3_0+gu95.s3_1)+(gu95.s3_2+gu95.s3_3))+((gu95.s3_4+gu95.s3_5)+(gu95.s3_6+gu95.s3_7)))+(((gu95.s3_8+gu95.s3_9)+(gu95....931
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6467840902045458505
[2022-05-19 18:45:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6467840902045458505
Running compilation step : cd /tmp/ltsmin6467840902045458505;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1179 ms.
Running link step : cd /tmp/ltsmin6467840902045458505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6467840902045458505;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))&&<>((<>(!(LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 102085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G((F(X(G(X(p0))))||p1))))))'
Support contains 25 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1894 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.6 ms
Discarding 26 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 1891 transition count 351
Applied a total of 5 rules in 178 ms. Remains 1891 /1920 variables (removed 29) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1891 cols
[2022-05-19 18:46:01] [INFO ] Computed 1542 place invariants in 32 ms
[2022-05-19 18:46:03] [INFO ] Implicit Places using invariants in 2172 ms returned []
// Phase 1: matrix 351 rows 1891 cols
[2022-05-19 18:46:03] [INFO ] Computed 1542 place invariants in 30 ms
[2022-05-19 18:46:07] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned [1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6218 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1920 places, 351/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1845/1920 places, 351/356 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s2), p1:(LEQ 3 (ADD s1728 s1729 s1730 s1731 s1732 s1733 s1734 s1735 s1736 s1737 s1738 s1739 s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s17...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3470 reset in 337 ms.
Product exploration explored 100000 steps with 3472 reset in 353 ms.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 446 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 345 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:09] [INFO ] Computed 1497 place invariants in 33 ms
[2022-05-19 18:46:09] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 18:46:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-19 18:46:09] [INFO ] [Nat]Absence check using 1 positive and 1496 generalized place invariants in 270 ms returned sat
[2022-05-19 18:46:11] [INFO ] After 1672ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-19 18:46:11] [INFO ] After 2014ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1992 ms.
[2022-05-19 18:46:13] [INFO ] After 4590ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 433 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 1845 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Applied a total of 0 rules in 86 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:14] [INFO ] Computed 1497 place invariants in 31 ms
[2022-05-19 18:46:16] [INFO ] Implicit Places using invariants in 2018 ms returned []
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:16] [INFO ] Computed 1497 place invariants in 30 ms
[2022-05-19 18:46:20] [INFO ] Implicit Places using invariants and state equation in 3812 ms returned []
Implicit Place search using SMT with State Equation took 5833 ms to find 0 implicit places.
[2022-05-19 18:46:20] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:20] [INFO ] Computed 1497 place invariants in 29 ms
[2022-05-19 18:46:20] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1845 places, 351/351 transitions.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3459 steps, run visited all 1 properties in 18 ms. (steps per millisecond=192 )
Probabilistic random walk after 3459 steps, saw 3366 distinct states, run finished after 18 ms. (steps per millisecond=192 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3470 reset in 254 ms.
Product exploration explored 100000 steps with 3470 reset in 278 ms.
Built C files in :
/tmp/ltsmin7742878275110074668
[2022-05-19 18:46:22] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2022-05-19 18:46:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:22] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2022-05-19 18:46:22] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:22] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2022-05-19 18:46:22] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:22] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7742878275110074668
Running compilation step : cd /tmp/ltsmin7742878275110074668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin7742878275110074668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7742878275110074668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1852501129390375210.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Applied a total of 0 rules in 76 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:37] [INFO ] Computed 1497 place invariants in 31 ms
[2022-05-19 18:46:39] [INFO ] Implicit Places using invariants in 2016 ms returned []
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:39] [INFO ] Computed 1497 place invariants in 31 ms
[2022-05-19 18:46:43] [INFO ] Implicit Places using invariants and state equation in 3953 ms returned []
Implicit Place search using SMT with State Equation took 5971 ms to find 0 implicit places.
[2022-05-19 18:46:43] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 351 rows 1845 cols
[2022-05-19 18:46:43] [INFO ] Computed 1497 place invariants in 26 ms
[2022-05-19 18:46:44] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1845 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin6624993437197100339
[2022-05-19 18:46:44] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2022-05-19 18:46:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:44] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2022-05-19 18:46:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:44] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2022-05-19 18:46:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:46:44] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6624993437197100339
Running compilation step : cd /tmp/ltsmin6624993437197100339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1351 ms.
Running link step : cd /tmp/ltsmin6624993437197100339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6624993437197100339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3054719052355309194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:46:59] [INFO ] Flatten gal took : 43 ms
[2022-05-19 18:46:59] [INFO ] Flatten gal took : 37 ms
[2022-05-19 18:46:59] [INFO ] Time to serialize gal into /tmp/LTL1107449911539272674.gal : 5 ms
[2022-05-19 18:46:59] [INFO ] Time to serialize properties into /tmp/LTL3300849275996086338.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1107449911539272674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3300849275996086338.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1107449...266
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G((F(X(G(X("(CstopAbort_0<=SstopAbort_0)")))))||("((((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+(((s2_8+s2_9)+(s2_...264
Formula 0 simplified : !FGXG("((((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+(((s2_8+s2_9)+(s2_10+s2_11))+((s2_12+s2_13)+(s2_14+s2_15))))+(((s2_1...245
Detected timeout of ITS tools.
[2022-05-19 18:47:14] [INFO ] Flatten gal took : 38 ms
[2022-05-19 18:47:14] [INFO ] Applying decomposition
[2022-05-19 18:47:14] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15979523915578288520.txt' '-o' '/tmp/graph15979523915578288520.bin' '-w' '/tmp/graph15979523915578288520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15979523915578288520.bin' '-l' '-1' '-v' '-w' '/tmp/graph15979523915578288520.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:47:14] [INFO ] Decomposing Gal with order
[2022-05-19 18:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:47:14] [INFO ] Removed a total of 174 redundant transitions.
[2022-05-19 18:47:14] [INFO ] Flatten gal took : 115 ms
[2022-05-19 18:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 11 ms.
[2022-05-19 18:47:14] [INFO ] Time to serialize gal into /tmp/LTL1927469183584444111.gal : 6 ms
[2022-05-19 18:47:14] [INFO ] Time to serialize properties into /tmp/LTL13374242717053244832.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1927469183584444111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13374242717053244832.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1927469...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G((F(X(G(X("(gi1.gi0.gu0.CstopAbort_0<=gi1.gi0.gu0.SstopAbort_0)")))))||("((((((gu54.s2_0+gu54.s2_1)+(gu54.s2_2+gu54.s2_3))+(...403
Formula 0 simplified : !FGXG("((((((gu54.s2_0+gu54.s2_1)+(gu54.s2_2+gu54.s2_3))+((gu54.s2_4+gu54.s2_5)+(gu54.s2_6+gu54.s2_7)))+(((gu54.s2_8+gu54.s2_9)+(gu5...384
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin172279680066288931
[2022-05-19 18:47:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin172279680066288931
Running compilation step : cd /tmp/ltsmin172279680066288931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1172 ms.
Running link step : cd /tmp/ltsmin172279680066288931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin172279680066288931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([]((<>(X([](X((LTLAPp0==true)))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-13 finished in 104142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(F(p1)||F(p2)))))'
Support contains 48 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1892 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 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 1890 transition count 352
Applied a total of 5 rules in 181 ms. Remains 1890 /1920 variables (removed 30) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2022-05-19 18:47:45] [INFO ] Computed 1540 place invariants in 25 ms
[2022-05-19 18:47:47] [INFO ] Implicit Places using invariants in 2124 ms returned []
// Phase 1: matrix 352 rows 1890 cols
[2022-05-19 18:47:47] [INFO ] Computed 1540 place invariants in 24 ms
[2022-05-19 18:47:50] [INFO ] Implicit Places using invariants and state equation in 3513 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5640 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1920 places, 352/356 transitions.
Applied a total of 0 rules in 82 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1867/1920 places, 352/356 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 1 s1865), p2:(LEQ s0 (ADD s1818 s1819 s1820 s1821 s1822 s1823 s1824 s1825 s1826 s1827 s1828 s1829 s1830 s1831 s1832 s1833 s1834 s1835 s1836 s1837 ...], 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 5681 reset in 630 ms.
Product exploration explored 100000 steps with 5662 reset in 655 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
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 p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 529 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:47:53] [INFO ] Computed 1518 place invariants in 171 ms
[2022-05-19 18:47:53] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:47:54] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 275 ms returned sat
[2022-05-19 18:47:55] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:47:55] [INFO ] After 1138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 521 ms.
[2022-05-19 18:47:55] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 8 factoid took 671 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:47:56] [INFO ] Computed 1518 place invariants in 145 ms
[2022-05-19 18:47:59] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 1530 ms returned sat
[2022-05-19 18:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:48:05] [INFO ] [Real]Absence check using state equation in 6028 ms returned sat
[2022-05-19 18:48:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:48:07] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 1580 ms returned sat
[2022-05-19 18:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:48:17] [INFO ] [Nat]Absence check using state equation in 9772 ms returned sat
[2022-05-19 18:48:17] [INFO ] Computed and/alt/rep : 255/301/255 causal constraints (skipped 73 transitions) in 27 ms.
[2022-05-19 18:48:20] [INFO ] Added : 89 causal constraints over 43 iterations in 3090 ms. Result :unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:20] [INFO ] Computed 1518 place invariants in 138 ms
[2022-05-19 18:48:22] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 1697 ms returned sat
[2022-05-19 18:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:48:28] [INFO ] [Real]Absence check using state equation in 5890 ms returned sat
[2022-05-19 18:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:48:30] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 1696 ms returned sat
[2022-05-19 18:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:48:38] [INFO ] [Nat]Absence check using state equation in 7949 ms returned sat
[2022-05-19 18:48:38] [INFO ] Computed and/alt/rep : 255/301/255 causal constraints (skipped 73 transitions) in 24 ms.
[2022-05-19 18:48:39] [INFO ] Added : 36 causal constraints over 8 iterations in 616 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 48 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 86 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:39] [INFO ] Computed 1518 place invariants in 144 ms
[2022-05-19 18:48:41] [INFO ] Implicit Places using invariants in 2169 ms returned []
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:41] [INFO ] Computed 1518 place invariants in 156 ms
[2022-05-19 18:48:45] [INFO ] Implicit Places using invariants and state equation in 3723 ms returned []
Implicit Place search using SMT with State Equation took 5894 ms to find 0 implicit places.
[2022-05-19 18:48:45] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:45] [INFO ] Computed 1518 place invariants in 138 ms
[2022-05-19 18:48:46] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
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 p2) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 474 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:47] [INFO ] Computed 1518 place invariants in 142 ms
[2022-05-19 18:48:47] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:48:47] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 257 ms returned sat
[2022-05-19 18:48:48] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:48:48] [INFO ] After 1131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 301 ms.
[2022-05-19 18:48:49] [INFO ] After 1916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 574 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:48:50] [INFO ] Computed 1518 place invariants in 140 ms
[2022-05-19 18:48:52] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 1577 ms returned sat
[2022-05-19 18:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:48:58] [INFO ] [Real]Absence check using state equation in 6011 ms returned sat
[2022-05-19 18:48:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:49:00] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 1730 ms returned sat
[2022-05-19 18:49:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:49:10] [INFO ] [Nat]Absence check using state equation in 9817 ms returned sat
[2022-05-19 18:49:10] [INFO ] Computed and/alt/rep : 255/301/255 causal constraints (skipped 73 transitions) in 24 ms.
[2022-05-19 18:49:13] [INFO ] Added : 101 causal constraints over 47 iterations in 2861 ms. Result :unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:49:13] [INFO ] Computed 1518 place invariants in 142 ms
[2022-05-19 18:49:15] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 1712 ms returned sat
[2022-05-19 18:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:49:21] [INFO ] [Real]Absence check using state equation in 5902 ms returned sat
[2022-05-19 18:49:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:49:24] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 1700 ms returned sat
[2022-05-19 18:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:49:32] [INFO ] [Nat]Absence check using state equation in 7983 ms returned sat
[2022-05-19 18:49:32] [INFO ] Computed and/alt/rep : 255/301/255 causal constraints (skipped 73 transitions) in 33 ms.
[2022-05-19 18:49:32] [INFO ] Added : 36 causal constraints over 8 iterations in 630 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 5649 reset in 637 ms.
Product exploration explored 100000 steps with 5688 reset in 646 ms.
Built C files in :
/tmp/ltsmin572301473765088612
[2022-05-19 18:49:34] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2022-05-19 18:49:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:34] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2022-05-19 18:49:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:34] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2022-05-19 18:49:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:34] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin572301473765088612
Running compilation step : cd /tmp/ltsmin572301473765088612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1336 ms.
Running link step : cd /tmp/ltsmin572301473765088612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin572301473765088612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2100329282387377585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 80 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:49:49] [INFO ] Computed 1518 place invariants in 155 ms
[2022-05-19 18:49:51] [INFO ] Implicit Places using invariants in 2095 ms returned []
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:49:51] [INFO ] Computed 1518 place invariants in 155 ms
[2022-05-19 18:49:55] [INFO ] Implicit Places using invariants and state equation in 3737 ms returned []
Implicit Place search using SMT with State Equation took 5834 ms to find 0 implicit places.
[2022-05-19 18:49:55] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 352 rows 1867 cols
[2022-05-19 18:49:55] [INFO ] Computed 1518 place invariants in 140 ms
[2022-05-19 18:49:55] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin11497649164257381784
[2022-05-19 18:49:55] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2022-05-19 18:49:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:55] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2022-05-19 18:49:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:55] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2022-05-19 18:49:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:49:55] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11497649164257381784
Running compilation step : cd /tmp/ltsmin11497649164257381784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1389 ms.
Running link step : cd /tmp/ltsmin11497649164257381784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11497649164257381784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12236186760473533073.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:50:11] [INFO ] Flatten gal took : 47 ms
[2022-05-19 18:50:11] [INFO ] Flatten gal took : 48 ms
[2022-05-19 18:50:11] [INFO ] Time to serialize gal into /tmp/LTL7109878869734769734.gal : 5 ms
[2022-05-19 18:50:11] [INFO ] Time to serialize properties into /tmp/LTL17266961368969769361.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7109878869734769734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17266961368969769361.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7109878...267
Read 1 LTL properties
Checking formula 0 : !((F((F("((malicious_reservoir_0<=(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+...637
Formula 0 simplified : !F(F"((malicious_reservoir_0<=(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+(((s5_8+s5_9)+(s5_10+s5_11))+((s5_12+s5_13)+(s...625
Detected timeout of ITS tools.
[2022-05-19 18:50:26] [INFO ] Flatten gal took : 44 ms
[2022-05-19 18:50:26] [INFO ] Applying decomposition
[2022-05-19 18:50:26] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18240335378434979334.txt' '-o' '/tmp/graph18240335378434979334.bin' '-w' '/tmp/graph18240335378434979334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18240335378434979334.bin' '-l' '-1' '-v' '-w' '/tmp/graph18240335378434979334.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:50:26] [INFO ] Decomposing Gal with order
[2022-05-19 18:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:50:26] [INFO ] Removed a total of 253 redundant transitions.
[2022-05-19 18:50:26] [INFO ] Flatten gal took : 144 ms
[2022-05-19 18:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 245 labels/synchronizations in 48 ms.
[2022-05-19 18:50:26] [INFO ] Time to serialize gal into /tmp/LTL16168775492253142898.gal : 12 ms
[2022-05-19 18:50:26] [INFO ] Time to serialize properties into /tmp/LTL15250885132520172648.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16168775492253142898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15250885132520172648.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1616877...268
Read 1 LTL properties
Checking formula 0 : !((F((F("((gu0.malicious_reservoir_0<=(((((gu0.s5_0+gu0.s5_1)+(gu0.s5_2+gu0.s5_3))+((gu0.s5_4+gu0.s5_5)+(gu0.s5_6+gu0.s5_7)))+(((gu0.s...963
Formula 0 simplified : !F(F"((gu0.malicious_reservoir_0<=(((((gu0.s5_0+gu0.s5_1)+(gu0.s5_2+gu0.s5_3))+((gu0.s5_4+gu0.s5_5)+(gu0.s5_6+gu0.s5_7)))+(((gu0.s5_...951
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3166443566268576709
[2022-05-19 18:50:41] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3166443566268576709
Running compilation step : cd /tmp/ltsmin3166443566268576709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1184 ms.
Running link step : cd /tmp/ltsmin3166443566268576709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3166443566268576709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true))&&(<>((LTLAPp1==true))||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-14 finished in 192039 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 24 out of 1920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1917 transition count 356
Applied a total of 3 rules in 72 ms. Remains 1917 /1920 variables (removed 3) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 18:50:57] [INFO ] Computed 1563 place invariants in 84 ms
[2022-05-19 18:50:59] [INFO ] Implicit Places using invariants in 2687 ms returned []
// Phase 1: matrix 356 rows 1917 cols
[2022-05-19 18:50:59] [INFO ] Computed 1563 place invariants in 86 ms
[2022-05-19 18:51:04] [INFO ] Implicit Places using invariants and state equation in 4449 ms returned [1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7144 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1920 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1894/1920 places, 356/356 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 3 s1), p0:(LEQ 2 (ADD s1704 s1705 s1706 s1707 s1708 s1709 s1710 s1711 s1712 s1713 s1714 s1715 s1716 s1717 s1718 s1719 s1720 s1721 s1722 s1723 s1724...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8922 reset in 426 ms.
Product exploration explored 100000 steps with 8880 reset in 440 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 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 356 rows 1894 cols
[2022-05-19 18:51:06] [INFO ] Computed 1540 place invariants in 44 ms
[2022-05-19 18:51:06] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 266 ms returned sat
[2022-05-19 18:51:07] [INFO ] After 1713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:51:08] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 267 ms returned sat
[2022-05-19 18:51:09] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:51:10] [INFO ] After 2115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-19 18:51:10] [INFO ] After 2734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 24 out of 1894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:11] [INFO ] Computed 1540 place invariants in 43 ms
[2022-05-19 18:51:13] [INFO ] Implicit Places using invariants in 2130 ms returned []
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:13] [INFO ] Computed 1540 place invariants in 54 ms
[2022-05-19 18:51:17] [INFO ] Implicit Places using invariants and state equation in 4046 ms returned []
Implicit Place search using SMT with State Equation took 6192 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:17] [INFO ] Computed 1540 place invariants in 40 ms
[2022-05-19 18:51:18] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1894/1894 places, 356/356 transitions.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:18] [INFO ] Computed 1540 place invariants in 48 ms
[2022-05-19 18:51:19] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 280 ms returned sat
[2022-05-19 18:51:20] [INFO ] After 1808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:51:21] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 259 ms returned sat
[2022-05-19 18:51:22] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:51:23] [INFO ] After 2135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-05-19 18:51:23] [INFO ] After 2752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9007 reset in 443 ms.
Product exploration explored 100000 steps with 8952 reset in 439 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 24 out of 1894 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Graph (complete) has 14749 edges and 1894 vertex of which 1870 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 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
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1870 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 152 ms. Remains 1870 /1894 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2022-05-19 18:51:25] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 356 rows 1870 cols
[2022-05-19 18:51:25] [INFO ] Computed 1518 place invariants in 44 ms
[2022-05-19 18:51:25] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1894 places, 356/356 transitions.
Finished structural reductions, in 1 iterations. Remains : 1870/1894 places, 356/356 transitions.
Product exploration explored 100000 steps with 8889 reset in 1250 ms.
Product exploration explored 100000 steps with 8937 reset in 1264 ms.
Built C files in :
/tmp/ltsmin14984352702396464915
[2022-05-19 18:51:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14984352702396464915
Running compilation step : cd /tmp/ltsmin14984352702396464915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1190 ms.
Running link step : cd /tmp/ltsmin14984352702396464915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14984352702396464915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12076187318298124549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 1894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1894/1894 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:43] [INFO ] Computed 1540 place invariants in 42 ms
[2022-05-19 18:51:45] [INFO ] Implicit Places using invariants in 2023 ms returned []
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:45] [INFO ] Computed 1540 place invariants in 39 ms
[2022-05-19 18:51:49] [INFO ] Implicit Places using invariants and state equation in 3994 ms returned []
Implicit Place search using SMT with State Equation took 6021 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 1894 cols
[2022-05-19 18:51:49] [INFO ] Computed 1540 place invariants in 42 ms
[2022-05-19 18:51:50] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1894/1894 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin9869059634755906148
[2022-05-19 18:51:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9869059634755906148
Running compilation step : cd /tmp/ltsmin9869059634755906148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1119 ms.
Running link step : cd /tmp/ltsmin9869059634755906148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9869059634755906148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10661109488193390604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:52:05] [INFO ] Flatten gal took : 44 ms
[2022-05-19 18:52:05] [INFO ] Flatten gal took : 44 ms
[2022-05-19 18:52:05] [INFO ] Time to serialize gal into /tmp/LTL985494854352071641.gal : 4 ms
[2022-05-19 18:52:05] [INFO ] Time to serialize properties into /tmp/LTL12201273513074946370.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL985494854352071641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12201273513074946370.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9854948...266
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+(((n1_1...237
Formula 0 simplified : !XF("((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+(((n1_16+...228
Detected timeout of ITS tools.
[2022-05-19 18:52:20] [INFO ] Flatten gal took : 63 ms
[2022-05-19 18:52:20] [INFO ] Applying decomposition
[2022-05-19 18:52:20] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11353715956923310871.txt' '-o' '/tmp/graph11353715956923310871.bin' '-w' '/tmp/graph11353715956923310871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11353715956923310871.bin' '-l' '-1' '-v' '-w' '/tmp/graph11353715956923310871.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:52:20] [INFO ] Decomposing Gal with order
[2022-05-19 18:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:52:20] [INFO ] Removed a total of 182 redundant transitions.
[2022-05-19 18:52:20] [INFO ] Flatten gal took : 106 ms
[2022-05-19 18:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 45 ms.
[2022-05-19 18:52:21] [INFO ] Time to serialize gal into /tmp/LTL3990631201470229807.gal : 79 ms
[2022-05-19 18:52:21] [INFO ] Time to serialize properties into /tmp/LTL5671639799282584102.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3990631201470229807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5671639799282584102.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3990631...266
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((gu67.n1_0+gu67.n1_1)+(gu67.n1_2+gu67.n1_3))+((gu67.n1_4+gu67.n1_5)+(gu67.n1_6+gu67.n1_7)))+(((gu67.n1_8+gu67.n1_9)+(gu6...369
Formula 0 simplified : !XF("((((((gu67.n1_0+gu67.n1_1)+(gu67.n1_2+gu67.n1_3))+((gu67.n1_4+gu67.n1_5)+(gu67.n1_6+gu67.n1_7)))+(((gu67.n1_8+gu67.n1_9)+(gu67....360
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17258114804096476756
[2022-05-19 18:52:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17258114804096476756
Running compilation step : cd /tmp/ltsmin17258114804096476756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin17258114804096476756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17258114804096476756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-15 finished in 114353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(((G(p1)||p2) U G(p1))||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F((F(!p0)||p1))))'
Found a SL insensitive property : QuasiCertifProtocol-COL-22-LTLCardinality-11
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Support contains 47 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1892 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.11 ms
Discarding 28 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1890 transition count 352
Applied a total of 3 rules in 162 ms. Remains 1890 /1920 variables (removed 30) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2022-05-19 18:52:51] [INFO ] Computed 1540 place invariants in 29 ms
[2022-05-19 18:52:53] [INFO ] Implicit Places using invariants in 1945 ms returned []
// Phase 1: matrix 352 rows 1890 cols
[2022-05-19 18:52:53] [INFO ] Computed 1540 place invariants in 30 ms
[2022-05-19 18:52:57] [INFO ] Implicit Places using invariants and state equation in 3782 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5730 ms to find 46 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1844/1920 places, 352/356 transitions.
Applied a total of 0 rules in 79 ms. Remains 1844 /1844 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1844/1920 places, 352/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771) s1...], 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 3474 reset in 308 ms.
Product exploration explored 100000 steps with 3476 reset in 323 ms.
Computed a total of 1844 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1844 transition count 352
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 p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 466 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 902 steps, run visited all 1 properties in 5 ms. (steps per millisecond=180 )
Probabilistic random walk after 902 steps, saw 880 distinct states, run finished after 5 ms. (steps per millisecond=180 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 395 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 24 out of 1844 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 352/352 transitions.
Applied a total of 0 rules in 62 ms. Remains 1844 /1844 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:00] [INFO ] Computed 1496 place invariants in 143 ms
[2022-05-19 18:53:02] [INFO ] Implicit Places using invariants in 2092 ms returned []
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:02] [INFO ] Computed 1496 place invariants in 144 ms
[2022-05-19 18:53:05] [INFO ] Implicit Places using invariants and state equation in 3827 ms returned []
Implicit Place search using SMT with State Equation took 5934 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:06] [INFO ] Computed 1496 place invariants in 157 ms
[2022-05-19 18:53:06] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 352/352 transitions.
Computed a total of 1844 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1844 transition count 352
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 349 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 902 steps, run visited all 1 properties in 5 ms. (steps per millisecond=180 )
Probabilistic random walk after 902 steps, saw 880 distinct states, run finished after 5 ms. (steps per millisecond=180 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3473 reset in 308 ms.
Product exploration explored 100000 steps with 3478 reset in 322 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 24 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 352/352 transitions.
Applied a total of 0 rules in 91 ms. Remains 1844 /1844 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2022-05-19 18:53:08] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:08] [INFO ] Computed 1496 place invariants in 142 ms
[2022-05-19 18:53:09] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 352/352 transitions.
Product exploration explored 100000 steps with 3479 reset in 612 ms.
Product exploration explored 100000 steps with 3470 reset in 619 ms.
Built C files in :
/tmp/ltsmin697369673990108294
[2022-05-19 18:53:10] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin697369673990108294
Running compilation step : cd /tmp/ltsmin697369673990108294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1102 ms.
Running link step : cd /tmp/ltsmin697369673990108294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin697369673990108294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1699946531913228453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 1844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1844/1844 places, 352/352 transitions.
Applied a total of 0 rules in 59 ms. Remains 1844 /1844 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:25] [INFO ] Computed 1496 place invariants in 138 ms
[2022-05-19 18:53:27] [INFO ] Implicit Places using invariants in 2275 ms returned []
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:28] [INFO ] Computed 1496 place invariants in 140 ms
[2022-05-19 18:53:31] [INFO ] Implicit Places using invariants and state equation in 4029 ms returned []
Implicit Place search using SMT with State Equation took 6309 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 1844 cols
[2022-05-19 18:53:32] [INFO ] Computed 1496 place invariants in 152 ms
[2022-05-19 18:53:32] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin18279159281355118300
[2022-05-19 18:53:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18279159281355118300
Running compilation step : cd /tmp/ltsmin18279159281355118300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1102 ms.
Running link step : cd /tmp/ltsmin18279159281355118300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18279159281355118300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7931040296741917948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:53:47] [INFO ] Flatten gal took : 36 ms
[2022-05-19 18:53:47] [INFO ] Flatten gal took : 35 ms
[2022-05-19 18:53:48] [INFO ] Time to serialize gal into /tmp/LTL6380387981081215601.gal : 468 ms
[2022-05-19 18:53:48] [INFO ] Time to serialize properties into /tmp/LTL4136780953198034735.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6380387981081215601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4136780953198034735.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6380387...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+(((s3_1...588
Formula 0 simplified : !(GX"((((((s3_0+s3_1)+(s3_2+s3_3))+((s3_4+s3_5)+(s3_6+s3_7)))+(((s3_8+s3_9)+(s3_10+s3_11))+((s3_12+s3_13)+(s3_14+s3_15))))+(((s3_16+...576
Detected timeout of ITS tools.
[2022-05-19 18:54:03] [INFO ] Flatten gal took : 40 ms
[2022-05-19 18:54:03] [INFO ] Applying decomposition
[2022-05-19 18:54:03] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15135309922421048508.txt' '-o' '/tmp/graph15135309922421048508.bin' '-w' '/tmp/graph15135309922421048508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15135309922421048508.bin' '-l' '-1' '-v' '-w' '/tmp/graph15135309922421048508.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:54:03] [INFO ] Decomposing Gal with order
[2022-05-19 18:54:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:54:03] [INFO ] Removed a total of 275 redundant transitions.
[2022-05-19 18:54:03] [INFO ] Flatten gal took : 96 ms
[2022-05-19 18:54:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 48 ms.
[2022-05-19 18:54:03] [INFO ] Time to serialize gal into /tmp/LTL9367616824989687563.gal : 8 ms
[2022-05-19 18:54:04] [INFO ] Time to serialize properties into /tmp/LTL3090954008153532171.ltl : 568 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9367616824989687563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3090954008153532171.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9367616...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("((((((gu59.s3_0+gu59.s3_1)+(gu59.s3_2+gu59.s3_3))+((gu59.s3_4+gu59.s3_5)+(gu59.s3_6+gu59.s3_7)))+(((gu59.s3_8+gu59.s3_9)+(gu5...943
Formula 0 simplified : !(GX"((((((gu59.s3_0+gu59.s3_1)+(gu59.s3_2+gu59.s3_3))+((gu59.s3_4+gu59.s3_5)+(gu59.s3_6+gu59.s3_7)))+(((gu59.s3_8+gu59.s3_9)+(gu59....931
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11309536786869181059
[2022-05-19 18:54:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11309536786869181059
Running compilation step : cd /tmp/ltsmin11309536786869181059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1126 ms.
Running link step : cd /tmp/ltsmin11309536786869181059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11309536786869181059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))&&<>((<>(!(LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 103206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G((F(X(G(X(p0))))||p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(F(p1)||F(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a CL insensitive property : QuasiCertifProtocol-COL-22-LTLCardinality-15
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 24 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1920/1920 places, 356/356 transitions.
Graph (complete) has 15469 edges and 1920 vertex of which 1893 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Discarding 27 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 1891 transition count 352
Applied a total of 5 rules in 154 ms. Remains 1891 /1920 variables (removed 29) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1891 cols
[2022-05-19 18:54:35] [INFO ] Computed 1541 place invariants in 74 ms
[2022-05-19 18:54:38] [INFO ] Implicit Places using invariants in 2505 ms returned []
// Phase 1: matrix 352 rows 1891 cols
[2022-05-19 18:54:38] [INFO ] Computed 1541 place invariants in 70 ms
[2022-05-19 18:54:42] [INFO ] Implicit Places using invariants and state equation in 4254 ms returned [1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6768 ms to find 23 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1868/1920 places, 352/356 transitions.
Applied a total of 0 rules in 79 ms. Remains 1868 /1868 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1868/1920 places, 352/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 3 s1), p0:(LEQ 2 (ADD s1681 s1682 s1683 s1684 s1685 s1686 s1687 s1688 s1689 s1690 s1691 s1692 s1693 s1694 s1695 s1696 s1697 s1698 s1699 s1700 s1701...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8919 reset in 403 ms.
Product exploration explored 100000 steps with 8917 reset in 409 ms.
Computed a total of 1868 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 352
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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:44] [INFO ] Computed 1518 place invariants in 32 ms
[2022-05-19 18:54:44] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 258 ms returned sat
[2022-05-19 18:54:45] [INFO ] After 1396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:54:45] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 247 ms returned sat
[2022-05-19 18:54:46] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:54:46] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-19 18:54:46] [INFO ] After 1310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 24 out of 1868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1868/1868 places, 352/352 transitions.
Applied a total of 0 rules in 73 ms. Remains 1868 /1868 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:47] [INFO ] Computed 1518 place invariants in 31 ms
[2022-05-19 18:54:49] [INFO ] Implicit Places using invariants in 1908 ms returned []
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:49] [INFO ] Computed 1518 place invariants in 30 ms
[2022-05-19 18:54:52] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 5513 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:52] [INFO ] Computed 1518 place invariants in 32 ms
[2022-05-19 18:54:53] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1868/1868 places, 352/352 transitions.
Computed a total of 1868 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 352
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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:54] [INFO ] Computed 1518 place invariants in 33 ms
[2022-05-19 18:54:54] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 256 ms returned sat
[2022-05-19 18:54:55] [INFO ] After 1368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 18:54:55] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 255 ms returned sat
[2022-05-19 18:54:56] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 18:54:56] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-19 18:54:56] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 503 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9006 reset in 433 ms.
Product exploration explored 100000 steps with 8945 reset in 432 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 24 out of 1868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1868/1868 places, 352/352 transitions.
Applied a total of 0 rules in 83 ms. Remains 1868 /1868 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2022-05-19 18:54:58] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:54:58] [INFO ] Computed 1518 place invariants in 25 ms
[2022-05-19 18:54:59] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1868/1868 places, 352/352 transitions.
Product exploration explored 100000 steps with 8887 reset in 1244 ms.
Product exploration explored 100000 steps with 8888 reset in 1261 ms.
Built C files in :
/tmp/ltsmin9145826387735881152
[2022-05-19 18:55:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9145826387735881152
Running compilation step : cd /tmp/ltsmin9145826387735881152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1178 ms.
Running link step : cd /tmp/ltsmin9145826387735881152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9145826387735881152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10082875308232859994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 1868 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1868/1868 places, 352/352 transitions.
Applied a total of 0 rules in 64 ms. Remains 1868 /1868 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:55:16] [INFO ] Computed 1518 place invariants in 31 ms
[2022-05-19 18:55:18] [INFO ] Implicit Places using invariants in 2027 ms returned []
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:55:18] [INFO ] Computed 1518 place invariants in 31 ms
[2022-05-19 18:55:22] [INFO ] Implicit Places using invariants and state equation in 3568 ms returned []
Implicit Place search using SMT with State Equation took 5598 ms to find 0 implicit places.
// Phase 1: matrix 352 rows 1868 cols
[2022-05-19 18:55:22] [INFO ] Computed 1518 place invariants in 30 ms
[2022-05-19 18:55:23] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1868/1868 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin9116678436048551696
[2022-05-19 18:55:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9116678436048551696
Running compilation step : cd /tmp/ltsmin9116678436048551696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1261 ms.
Running link step : cd /tmp/ltsmin9116678436048551696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9116678436048551696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6676172733910526221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 18:55:38] [INFO ] Flatten gal took : 55 ms
[2022-05-19 18:55:38] [INFO ] Flatten gal took : 42 ms
[2022-05-19 18:55:38] [INFO ] Time to serialize gal into /tmp/LTL13778397078192129373.gal : 4 ms
[2022-05-19 18:55:38] [INFO ] Time to serialize properties into /tmp/LTL156676069946073498.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13778397078192129373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL156676069946073498.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1377839...266
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+(((n1_1...237
Formula 0 simplified : !XF("((((((n1_0+n1_1)+(n1_2+n1_3))+((n1_4+n1_5)+(n1_6+n1_7)))+(((n1_8+n1_9)+(n1_10+n1_11))+((n1_12+n1_13)+(n1_14+n1_15))))+(((n1_16+...228
Detected timeout of ITS tools.
[2022-05-19 18:55:53] [INFO ] Flatten gal took : 42 ms
[2022-05-19 18:55:53] [INFO ] Applying decomposition
[2022-05-19 18:55:53] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13630311164549219562.txt' '-o' '/tmp/graph13630311164549219562.bin' '-w' '/tmp/graph13630311164549219562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13630311164549219562.bin' '-l' '-1' '-v' '-w' '/tmp/graph13630311164549219562.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:55:53] [INFO ] Decomposing Gal with order
[2022-05-19 18:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:55:53] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-19 18:55:53] [INFO ] Flatten gal took : 112 ms
[2022-05-19 18:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 63 ms.
[2022-05-19 18:55:54] [INFO ] Time to serialize gal into /tmp/LTL9161544471733080480.gal : 10 ms
[2022-05-19 18:55:54] [INFO ] Time to serialize properties into /tmp/LTL16718150709123635393.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9161544471733080480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16718150709123635393.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9161544...267
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((gu43.n1_0+gu43.n1_1)+(gu43.n1_2+gu43.n1_3))+((gu43.n1_4+gu43.n1_5)+(gu43.n1_6+gu43.n1_7)))+(((gu43.n1_8+gu43.n1_9)+(gu4...369
Formula 0 simplified : !XF("((((((gu43.n1_0+gu43.n1_1)+(gu43.n1_2+gu43.n1_3))+((gu43.n1_4+gu43.n1_5)+(gu43.n1_6+gu43.n1_7)))+(((gu43.n1_8+gu43.n1_9)+(gu43....360
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15495964919269902963
[2022-05-19 18:56:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15495964919269902963
Running compilation step : cd /tmp/ltsmin15495964919269902963;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1156 ms.
Running link step : cd /tmp/ltsmin15495964919269902963;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15495964919269902963;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-15 finished in 109335 ms.
[2022-05-19 18:56:24] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin803289070841844053
[2022-05-19 18:56:24] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2022-05-19 18:56:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:56:24] [INFO ] Applying decomposition
[2022-05-19 18:56:24] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2022-05-19 18:56:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:56:24] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2022-05-19 18:56:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:56:24] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin803289070841844053
Running compilation step : cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 18:56:24] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7600458841138386128.txt' '-o' '/tmp/graph7600458841138386128.bin' '-w' '/tmp/graph7600458841138386128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7600458841138386128.bin' '-l' '-1' '-v' '-w' '/tmp/graph7600458841138386128.weights' '-q' '0' '-e' '0.001'
[2022-05-19 18:56:24] [INFO ] Decomposing Gal with order
[2022-05-19 18:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 18:56:24] [INFO ] Removed a total of 350 redundant transitions.
[2022-05-19 18:56:24] [INFO ] Flatten gal took : 96 ms
[2022-05-19 18:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 20 ms.
[2022-05-19 18:56:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality1624820432255116041.gal : 7 ms
[2022-05-19 18:56:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality14388027601194626792.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1624820432255116041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14388027601194626792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 5 LTL properties
Checking formula 0 : !((G((F("((((((gi4.gu27.Sstart_0+gi4.gu27.Sstart_1)+(gi4.gu27.Sstart_2+gi4.gu27.Sstart_3))+((gi4.gu27.Sstart_4+gi4.gu27.Sstart_5)+(gi4...2672
Formula 0 simplified : !G(F"((((((gi4.gu27.Sstart_0+gi4.gu27.Sstart_1)+(gi4.gu27.Sstart_2+gi4.gu27.Sstart_3))+((gi4.gu27.Sstart_4+gi4.gu27.Sstart_5)+(gi4.g...2659
Compilation finished in 1521 ms.
Running link step : cd /tmp/ltsmin803289070841844053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&((([]((LTLAPp1==true))||(LTLAPp2==true)) U []((LTLAPp1==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp3==true)))&&<>((<>(!(LTLAPp3==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: LTL layer: formula: ([](X((LTLAPp3==true)))&&<>((<>(!(LTLAPp3==true))||(LTLAPp4==true))))
pins2lts-mc-linux64( 4/ 8), 0.007: "([](X((LTLAPp3==true)))&&<>((<>(!(LTLAPp3==true))||(LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.138: DFS-FIFO for weak LTL, using special progress label 369
pins2lts-mc-linux64( 0/ 8), 0.138: There are 370 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.138: State length is 1921, there are 365 groups
pins2lts-mc-linux64( 0/ 8), 0.138: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.138: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.138: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.138: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.392: ~1 levels ~960 states ~27696 transitions
pins2lts-mc-linux64( 1/ 8), 0.558: ~1 levels ~1920 states ~43000 transitions
pins2lts-mc-linux64( 5/ 8), 0.767: ~1 levels ~3840 states ~91888 transitions
pins2lts-mc-linux64( 7/ 8), 1.194: ~1 levels ~7680 states ~172576 transitions
pins2lts-mc-linux64( 7/ 8), 2.046: ~1 levels ~15360 states ~426208 transitions
pins2lts-mc-linux64( 7/ 8), 3.461: ~1 levels ~30720 states ~869616 transitions
pins2lts-mc-linux64( 7/ 8), 6.082: ~1 levels ~61440 states ~1746112 transitions
pins2lts-mc-linux64( 1/ 8), 11.296: ~1 levels ~122880 states ~3879176 transitions
pins2lts-mc-linux64( 2/ 8), 20.806: ~1 levels ~245760 states ~7795568 transitions
pins2lts-mc-linux64( 7/ 8), 38.518: ~1 levels ~491520 states ~15418024 transitions
pins2lts-mc-linux64( 2/ 8), 81.308: ~1 levels ~983040 states ~33466424 transitions
pins2lts-mc-linux64( 5/ 8), 101.537: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 102.118:
pins2lts-mc-linux64( 0/ 8), 102.118: mean standard work distribution: 5.2% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 102.118:
pins2lts-mc-linux64( 0/ 8), 102.118: Explored 1121483 states 41386441 transitions, fanout: 36.903
pins2lts-mc-linux64( 0/ 8), 102.118: Total exploration time 101.960 sec (101.400 sec minimum, 101.686 sec on average)
pins2lts-mc-linux64( 0/ 8), 102.118: States per second: 10999, Transitions per second: 405909
pins2lts-mc-linux64( 0/ 8), 102.118:
pins2lts-mc-linux64( 0/ 8), 102.118: Progress states detected: 10123796
pins2lts-mc-linux64( 0/ 8), 102.118: Redundant explorations: -88.9224
pins2lts-mc-linux64( 0/ 8), 102.118:
pins2lts-mc-linux64( 0/ 8), 102.118: Queue width: 8B, total height: 11729178, memory: 89.49MB
pins2lts-mc-linux64( 0/ 8), 102.118: Tree memory: 333.2MB, 34.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 102.118: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 102.118: Stored 432 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 102.118: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 102.118: Est. total memory use: 422.7MB (~1113.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp3==true)))&&<>((<>(!(LTLAPp3==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin803289070841844053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp3==true)))&&<>((<>(!(LTLAPp3==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 19:21:46] [INFO ] Applying decomposition
[2022-05-19 19:21:47] [INFO ] Flatten gal took : 525 ms
[2022-05-19 19:21:47] [INFO ] Decomposing Gal with order
[2022-05-19 19:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:21:48] [INFO ] Removed a total of 374 redundant transitions.
[2022-05-19 19:21:48] [INFO ] Flatten gal took : 369 ms
[2022-05-19 19:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 266 ms.
[2022-05-19 19:21:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality16160826057550466372.gal : 70 ms
[2022-05-19 19:21:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality871691619213898404.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16160826057550466372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality871691619213898404.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 5 LTL properties
Checking formula 0 : !((G((F("((((((gtsid0.Sstart_0+gtsid1.Sstart_1)+(gtsid2.Sstart_2+gtsid3.Sstart_3))+((gtsid4.Sstart_4+gtsid5.Sstart_5)+(gtsid6.Sstart_6...2714
Formula 0 simplified : !G(F"((((((gtsid0.Sstart_0+gtsid1.Sstart_1)+(gtsid2.Sstart_2+gtsid3.Sstart_3))+((gtsid4.Sstart_4+gtsid5.Sstart_5)+(gtsid6.Sstart_6+g...2701

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-22, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017400931"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;