Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127800057.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ASLink-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 597K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716420075260

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:21:19] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-05-22 23:21:19] [INFO ] Transformed 1406 places.
[2024-05-22 23:21:19] [INFO ] Transformed 2100 transitions.
[2024-05-22 23:21:19] [INFO ] Found NUPN structural information;
[2024-05-22 23:21:19] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1370 transition count 2078
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1359 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 1358 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 1358 transition count 2027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1357 transition count 2019
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1357 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1356 transition count 2011
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1356 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1355 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1355 transition count 2003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1354 transition count 1995
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1354 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1353 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1353 transition count 1987
Applied a total of 71 rules in 1210 ms. Remains 1353 /1406 variables (removed 53) and now considering 1987/2078 (removed 91) transitions.
// Phase 1: matrix 1987 rows 1353 cols
[2024-05-22 23:21:21] [INFO ] Computed 233 invariants in 235 ms
[2024-05-22 23:21:23] [INFO ] Implicit Places using invariants in 2229 ms returned [1, 19, 23, 33, 51, 69, 198, 220, 221, 239, 257, 386, 408, 409, 427, 445, 574, 596, 597, 615, 633, 762, 784, 785, 803, 821, 973, 1009, 1143, 1161, 1193, 1196, 1214, 1216]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 2292 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1319/1406 places, 1987/2078 transitions.
Applied a total of 0 rules in 51 ms. Remains 1319 /1319 variables (removed 0) and now considering 1987/1987 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3556 ms. Remains : 1319/1406 places, 1987/2078 transitions.
Support contains 34 out of 1319 places after structural reductions.
[2024-05-22 23:21:23] [INFO ] Flatten gal took : 262 ms
[2024-05-22 23:21:23] [INFO ] Flatten gal took : 151 ms
[2024-05-22 23:21:24] [INFO ] Input system was already deterministic with 1987 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1987 rows 1319 cols
[2024-05-22 23:21:25] [INFO ] Computed 199 invariants in 132 ms
[2024-05-22 23:21:26] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 23:21:27] [INFO ] [Nat]Absence check using 45 positive place invariants in 30 ms returned sat
[2024-05-22 23:21:27] [INFO ] [Nat]Absence check using 45 positive and 154 generalized place invariants in 90 ms returned sat
[2024-05-22 23:21:51] [INFO ] After 23806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 23:21:51] [INFO ] After 23973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 23:21:51] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 471 ms.
Support contains 16 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Drop transitions removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1319 transition count 1756
Reduce places removed 231 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 232 rules applied. Total rules applied 463 place count 1088 transition count 1755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 464 place count 1087 transition count 1755
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 464 place count 1087 transition count 1630
Deduced a syphon composed of 125 places in 3 ms
Ensure Unique test removed 51 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 301 rules applied. Total rules applied 765 place count 911 transition count 1630
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 766 place count 911 transition count 1629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 767 place count 910 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 768 place count 909 transition count 1621
Iterating global reduction 5 with 1 rules applied. Total rules applied 769 place count 909 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 770 place count 908 transition count 1613
Iterating global reduction 5 with 1 rules applied. Total rules applied 771 place count 908 transition count 1613
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 772 place count 907 transition count 1605
Iterating global reduction 5 with 1 rules applied. Total rules applied 773 place count 907 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 774 place count 906 transition count 1597
Iterating global reduction 5 with 1 rules applied. Total rules applied 775 place count 906 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 776 place count 905 transition count 1589
Iterating global reduction 5 with 1 rules applied. Total rules applied 777 place count 905 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 778 place count 904 transition count 1581
Iterating global reduction 5 with 1 rules applied. Total rules applied 779 place count 904 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 780 place count 903 transition count 1573
Iterating global reduction 5 with 1 rules applied. Total rules applied 781 place count 903 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 782 place count 902 transition count 1565
Iterating global reduction 5 with 1 rules applied. Total rules applied 783 place count 902 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 784 place count 901 transition count 1557
Iterating global reduction 5 with 1 rules applied. Total rules applied 785 place count 901 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 786 place count 900 transition count 1549
Iterating global reduction 5 with 1 rules applied. Total rules applied 787 place count 900 transition count 1549
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 788 place count 899 transition count 1541
Iterating global reduction 5 with 1 rules applied. Total rules applied 789 place count 899 transition count 1541
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 925 place count 831 transition count 1473
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 5 with 43 rules applied. Total rules applied 968 place count 831 transition count 1430
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 1011 place count 788 transition count 1430
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 1027 place count 788 transition count 1430
Applied a total of 1027 rules in 955 ms. Remains 788 /1319 variables (removed 531) and now considering 1430/1987 (removed 557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 788/1319 places, 1430/1987 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 204044 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 204044 steps, saw 43980 distinct states, run finished after 3008 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1430 rows 788 cols
[2024-05-22 23:21:56] [INFO ] Computed 148 invariants in 20 ms
[2024-05-22 23:21:57] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 23:21:57] [INFO ] [Nat]Absence check using 47 positive place invariants in 26 ms returned sat
[2024-05-22 23:21:57] [INFO ] [Nat]Absence check using 47 positive and 101 generalized place invariants in 55 ms returned sat
[2024-05-22 23:22:21] [INFO ] After 23920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 23:22:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 23:22:22] [INFO ] After 555ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 23:22:22] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 23:22:22] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 449 ms.
Support contains 14 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 1430/1430 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 787 transition count 1429
Applied a total of 2 rules in 82 ms. Remains 787 /788 variables (removed 1) and now considering 1429/1430 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 787/788 places, 1429/1430 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 233240 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233240 steps, saw 48744 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1429 rows 787 cols
[2024-05-22 23:22:26] [INFO ] Computed 148 invariants in 17 ms
[2024-05-22 23:22:26] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 23:22:27] [INFO ] [Nat]Absence check using 46 positive place invariants in 20 ms returned sat
[2024-05-22 23:22:27] [INFO ] [Nat]Absence check using 46 positive and 102 generalized place invariants in 41 ms returned sat
[2024-05-22 23:22:51] [INFO ] After 24626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 23:22:51] [INFO ] State equation strengthened by 38 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 23:22:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 23:22:51] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 14 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 1429/1429 transitions.
Applied a total of 0 rules in 34 ms. Remains 787 /787 variables (removed 0) and now considering 1429/1429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 787/787 places, 1429/1429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 1429/1429 transitions.
Applied a total of 0 rules in 40 ms. Remains 787 /787 variables (removed 0) and now considering 1429/1429 (removed 0) transitions.
[2024-05-22 23:22:52] [INFO ] Invariant cache hit.
[2024-05-22 23:22:53] [INFO ] Implicit Places using invariants in 1416 ms returned [18, 84, 92, 98, 101, 103, 110, 117, 118, 120, 121, 122, 184, 192, 198, 201, 203, 210, 217, 221, 222, 223, 285, 293, 299, 302, 304, 311, 318, 319, 320, 321, 322, 384, 393, 399, 405, 412, 425, 426, 427, 512, 515, 526, 540, 541, 542, 543, 561, 606, 618, 626, 632, 639, 640, 653, 654, 655, 656, 674, 695, 696, 706, 711, 716, 721, 726, 731, 736, 741, 746, 751, 756]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1422 ms to find 73 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 714/787 places, 1429/1429 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 714 transition count 1412
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 697 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 696 transition count 1411
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 36 place count 696 transition count 1383
Deduced a syphon composed of 28 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 93 place count 667 transition count 1383
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 18 rules applied. Total rules applied 111 place count 657 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 119 place count 649 transition count 1375
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 163 place count 605 transition count 1331
Iterating global reduction 5 with 44 rules applied. Total rules applied 207 place count 605 transition count 1331
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 216 place count 605 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 216 place count 605 transition count 1321
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 604 transition count 1321
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 227 place count 595 transition count 1312
Iterating global reduction 6 with 9 rules applied. Total rules applied 236 place count 595 transition count 1312
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 238 place count 593 transition count 1310
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 593 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 592 transition count 1309
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 592 transition count 1309
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 294 place count 566 transition count 1283
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 315 place count 566 transition count 1262
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 341 place count 545 transition count 1257
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 346 place count 545 transition count 1252
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 352 place count 539 transition count 1252
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 353 place count 539 transition count 1251
Applied a total of 353 rules in 456 ms. Remains 539 /714 variables (removed 175) and now considering 1251/1429 (removed 178) transitions.
// Phase 1: matrix 1251 rows 539 cols
[2024-05-22 23:22:53] [INFO ] Computed 63 invariants in 18 ms
[2024-05-22 23:22:54] [INFO ] Implicit Places using invariants in 585 ms returned [73, 88, 145, 160, 219, 234, 290, 309, 371, 388, 402, 407, 408, 460, 475]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 588 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 524/787 places, 1251/1429 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 523 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 523 transition count 1250
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 516 transition count 1243
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 516 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 515 transition count 1242
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 515 transition count 1236
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 30 place count 509 transition count 1236
Applied a total of 30 rules in 131 ms. Remains 509 /524 variables (removed 15) and now considering 1236/1251 (removed 15) transitions.
// Phase 1: matrix 1236 rows 509 cols
[2024-05-22 23:22:54] [INFO ] Computed 48 invariants in 12 ms
[2024-05-22 23:22:55] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-22 23:22:55] [INFO ] Invariant cache hit.
[2024-05-22 23:22:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:22:57] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 2957 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 509/787 places, 1236/1429 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5596 ms. Remains : 509/787 places, 1236/1429 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 125613 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125613 steps, saw 86225 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-22 23:23:01] [INFO ] Invariant cache hit.
[2024-05-22 23:23:01] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 23:23:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 23:23:01] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 19 ms returned sat
[2024-05-22 23:23:13] [INFO ] After 11587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-22 23:23:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:23:26] [INFO ] After 13180ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 23:23:26] [INFO ] After 13181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-22 23:23:26] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 318 ms.
Support contains 14 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1236/1236 transitions.
Applied a total of 0 rules in 42 ms. Remains 509 /509 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 509/509 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1236/1236 transitions.
Applied a total of 0 rules in 37 ms. Remains 509 /509 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-22 23:23:26] [INFO ] Invariant cache hit.
[2024-05-22 23:23:27] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-22 23:23:27] [INFO ] Invariant cache hit.
[2024-05-22 23:23:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:23:29] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2024-05-22 23:23:29] [INFO ] Redundant transitions in 125 ms returned []
[2024-05-22 23:23:29] [INFO ] Invariant cache hit.
[2024-05-22 23:23:30] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3957 ms. Remains : 509/509 places, 1236/1236 transitions.
FORMULA ASLink-PT-06a-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F(G(p2))))'
Support contains 6 out of 1319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1318 transition count 1756
Reduce places removed 243 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 249 rules applied. Total rules applied 479 place count 1075 transition count 1750
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 488 place count 1069 transition count 1747
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 491 place count 1066 transition count 1747
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 150 Pre rules applied. Total rules applied 491 place count 1066 transition count 1597
Deduced a syphon composed of 150 places in 3 ms
Ensure Unique test removed 51 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 351 rules applied. Total rules applied 842 place count 865 transition count 1597
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 29 rules applied. Total rules applied 871 place count 849 transition count 1584
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 884 place count 836 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 884 place count 836 transition count 1583
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 886 place count 835 transition count 1583
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 895 place count 826 transition count 1567
Iterating global reduction 6 with 9 rules applied. Total rules applied 904 place count 826 transition count 1567
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 910 place count 826 transition count 1561
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 913 place count 823 transition count 1551
Iterating global reduction 7 with 3 rules applied. Total rules applied 916 place count 823 transition count 1551
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 919 place count 820 transition count 1541
Iterating global reduction 7 with 3 rules applied. Total rules applied 922 place count 820 transition count 1541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 924 place count 820 transition count 1539
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 925 place count 819 transition count 1531
Iterating global reduction 8 with 1 rules applied. Total rules applied 926 place count 819 transition count 1531
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 927 place count 818 transition count 1523
Iterating global reduction 8 with 1 rules applied. Total rules applied 928 place count 818 transition count 1523
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 929 place count 817 transition count 1515
Iterating global reduction 8 with 1 rules applied. Total rules applied 930 place count 817 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 931 place count 816 transition count 1507
Iterating global reduction 8 with 1 rules applied. Total rules applied 932 place count 816 transition count 1507
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 933 place count 815 transition count 1499
Iterating global reduction 8 with 1 rules applied. Total rules applied 934 place count 815 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 935 place count 814 transition count 1491
Iterating global reduction 8 with 1 rules applied. Total rules applied 936 place count 814 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 937 place count 813 transition count 1483
Iterating global reduction 8 with 1 rules applied. Total rules applied 938 place count 813 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 939 place count 812 transition count 1475
Iterating global reduction 8 with 1 rules applied. Total rules applied 940 place count 812 transition count 1475
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 8 with 152 rules applied. Total rules applied 1092 place count 736 transition count 1399
Applied a total of 1092 rules in 588 ms. Remains 736 /1319 variables (removed 583) and now considering 1399/1987 (removed 588) transitions.
// Phase 1: matrix 1399 rows 736 cols
[2024-05-22 23:23:31] [INFO ] Computed 119 invariants in 16 ms
[2024-05-22 23:23:32] [INFO ] Implicit Places using invariants in 967 ms returned [17, 75, 115, 167, 201, 210, 262, 296, 305, 357, 391, 395, 407, 459, 498, 499, 511, 512, 530, 565, 606, 607, 619, 620, 638, 659, 670, 675, 680, 685, 690, 695, 700, 705, 710, 715, 720, 726, 732]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 974 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 697/1319 places, 1399/1987 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 697 transition count 1373
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 671 transition count 1373
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 671 transition count 1349
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 647 transition count 1349
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 646 transition count 1347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 644 transition count 1347
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 118 place count 631 transition count 1334
Iterating global reduction 4 with 13 rules applied. Total rules applied 131 place count 631 transition count 1334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 631 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 132 place count 631 transition count 1332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 630 transition count 1332
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 137 place count 627 transition count 1329
Iterating global reduction 5 with 3 rules applied. Total rules applied 140 place count 627 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 626 transition count 1328
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 626 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 625 transition count 1327
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 625 transition count 1327
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 192 place count 601 transition count 1303
Applied a total of 192 rules in 138 ms. Remains 601 /697 variables (removed 96) and now considering 1303/1399 (removed 96) transitions.
// Phase 1: matrix 1303 rows 601 cols
[2024-05-22 23:23:32] [INFO ] Computed 79 invariants in 16 ms
[2024-05-22 23:23:33] [INFO ] Implicit Places using invariants in 620 ms returned [88, 94, 99, 173, 179, 184, 260, 266, 271, 349, 355, 438, 444, 449, 525, 531, 536]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 623 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/1319 places, 1303/1987 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 573 transition count 1292
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 573 transition count 1292
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 562 transition count 1281
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 562 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 556 transition count 1275
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 556 transition count 1275
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 550 transition count 1269
Applied a total of 68 rules in 104 ms. Remains 550 /584 variables (removed 34) and now considering 1269/1303 (removed 34) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2024-05-22 23:23:33] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 23:23:34] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-22 23:23:34] [INFO ] Invariant cache hit.
[2024-05-22 23:23:35] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 550/1319 places, 1269/1987 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4600 ms. Remains : 550/1319 places, 1269/1987 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s329 0) (EQ s352 1)), p0:(OR (EQ s317 0) (EQ s311 1)), p2:(OR (EQ s19 0) (EQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1603 reset in 585 ms.
Product exploration explored 100000 steps with 1641 reset in 475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (OR p1 p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), true, (X (X (OR p1 p0))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 11 factoid took 266 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 23:23:38] [INFO ] Invariant cache hit.
[2024-05-22 23:23:38] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 23:23:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 23:23:38] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 39 ms returned sat
[2024-05-22 23:23:55] [INFO ] After 16498ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-22 23:23:58] [INFO ] After 19454ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 891 ms.
[2024-05-22 23:23:59] [INFO ] After 20598ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 550 transition count 1246
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 52 place count 527 transition count 1240
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 71 place count 527 transition count 1221
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 90 place count 508 transition count 1221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 508 transition count 1221
Applied a total of 91 rules in 153 ms. Remains 508 /550 variables (removed 42) and now considering 1221/1269 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 508/550 places, 1221/1269 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 212875 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212875 steps, saw 120530 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1221 rows 508 cols
[2024-05-22 23:24:02] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 23:24:02] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:24:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 23:24:02] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 25 ms returned sat
[2024-05-22 23:24:16] [INFO ] After 13424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:24:18] [INFO ] After 16148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5615 ms.
[2024-05-22 23:24:24] [INFO ] After 21927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 6 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 22 ms. Remains 508 /508 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 508/508 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 21 ms. Remains 508 /508 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-05-22 23:24:24] [INFO ] Invariant cache hit.
[2024-05-22 23:24:25] [INFO ] Implicit Places using invariants in 612 ms returned [89, 90, 160, 161, 231, 232, 299, 308, 309, 379, 380]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 615 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 497/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 23 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 660 ms. Remains : 497/508 places, 1221/1221 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 216061 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 216061 steps, saw 118601 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1221 rows 497 cols
[2024-05-22 23:24:28] [INFO ] Computed 51 invariants in 19 ms
[2024-05-22 23:24:28] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:24:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 23:24:28] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 39 ms returned sat
[2024-05-22 23:24:47] [INFO ] After 18822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1221/1221 transitions.
Applied a total of 0 rules in 25 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 497/497 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1221/1221 transitions.
Applied a total of 0 rules in 21 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-05-22 23:24:47] [INFO ] Invariant cache hit.
[2024-05-22 23:24:48] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-22 23:24:48] [INFO ] Invariant cache hit.
[2024-05-22 23:24:50] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
[2024-05-22 23:24:50] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-22 23:24:50] [INFO ] Invariant cache hit.
[2024-05-22 23:24:51] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4154 ms. Remains : 497/497 places, 1221/1221 transitions.
Applied a total of 0 rules in 25 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 23:24:51] [INFO ] Invariant cache hit.
[2024-05-22 23:24:51] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:24:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 23:24:51] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-22 23:25:10] [INFO ] After 18520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (OR p1 p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), true, (X (X (OR p1 p0))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 227 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 550 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 : 550/550 places, 1269/1269 transitions.
Applied a total of 0 rules in 32 ms. Remains 550 /550 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2024-05-22 23:25:10] [INFO ] Computed 62 invariants in 20 ms
[2024-05-22 23:25:11] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-22 23:25:11] [INFO ] Invariant cache hit.
[2024-05-22 23:25:14] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
[2024-05-22 23:25:14] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-22 23:25:14] [INFO ] Invariant cache hit.
[2024-05-22 23:25:15] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4508 ms. Remains : 550/550 places, 1269/1269 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 126 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:25:15] [INFO ] Invariant cache hit.
[2024-05-22 23:25:15] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:25:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:25:15] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 39 ms returned sat
[2024-05-22 23:25:22] [INFO ] After 7006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:25:23] [INFO ] After 7664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 398 ms.
[2024-05-22 23:25:23] [INFO ] After 8252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 550 transition count 1266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 547 transition count 1266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 547 transition count 1265
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 546 transition count 1265
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 546 transition count 1242
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 60 place count 523 transition count 1236
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 77 place count 523 transition count 1219
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 94 place count 506 transition count 1219
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 506 transition count 1219
Applied a total of 95 rules in 94 ms. Remains 506 /550 variables (removed 44) and now considering 1219/1269 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 506/550 places, 1219/1269 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234861 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234861 steps, saw 126944 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1219 rows 506 cols
[2024-05-22 23:25:27] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:25:27] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:25:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:25:27] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 35 ms returned sat
[2024-05-22 23:25:34] [INFO ] After 7381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:25:43] [INFO ] After 16392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-22 23:25:43] [INFO ] After 16586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1219/1219 transitions.
Applied a total of 0 rules in 17 ms. Remains 506 /506 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 506/506 places, 1219/1219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1219/1219 transitions.
Applied a total of 0 rules in 17 ms. Remains 506 /506 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2024-05-22 23:25:43] [INFO ] Invariant cache hit.
[2024-05-22 23:25:44] [INFO ] Implicit Places using invariants in 874 ms returned [89, 90, 160, 161, 231, 232, 299, 301, 306, 307, 377, 378]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 877 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/506 places, 1219/1219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 1218
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 493 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 492 transition count 1217
Applied a total of 4 rules in 76 ms. Remains 492 /494 variables (removed 2) and now considering 1217/1219 (removed 2) transitions.
// Phase 1: matrix 1217 rows 492 cols
[2024-05-22 23:25:44] [INFO ] Computed 50 invariants in 18 ms
[2024-05-22 23:25:45] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-22 23:25:45] [INFO ] Invariant cache hit.
[2024-05-22 23:25:47] [INFO ] Implicit Places using invariants and state equation in 2193 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/506 places, 1217/1219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4082 ms. Remains : 492/506 places, 1217/1219 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 229145 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229145 steps, saw 145150 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:25:51] [INFO ] Invariant cache hit.
[2024-05-22 23:25:51] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:25:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-22 23:25:51] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 34 ms returned sat
[2024-05-22 23:26:00] [INFO ] After 9781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1217/1217 transitions.
Applied a total of 0 rules in 19 ms. Remains 492 /492 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 492/492 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1217/1217 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2024-05-22 23:26:00] [INFO ] Invariant cache hit.
[2024-05-22 23:26:01] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-22 23:26:01] [INFO ] Invariant cache hit.
[2024-05-22 23:26:03] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2024-05-22 23:26:03] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-22 23:26:03] [INFO ] Invariant cache hit.
[2024-05-22 23:26:04] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3548 ms. Remains : 492/492 places, 1217/1217 transitions.
Applied a total of 0 rules in 17 ms. Remains 492 /492 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:26:04] [INFO ] Invariant cache hit.
[2024-05-22 23:26:04] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:26:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 23:26:04] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 27 ms returned sat
[2024-05-22 23:26:14] [INFO ] After 9575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1556 reset in 412 ms.
Product exploration explored 100000 steps with 1615 reset in 461 ms.
Built C files in :
/tmp/ltsmin17424370032135709508
[2024-05-22 23:26:15] [INFO ] Computing symmetric may disable matrix : 1269 transitions.
[2024-05-22 23:26:15] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:15] [INFO ] Computing symmetric may enable matrix : 1269 transitions.
[2024-05-22 23:26:15] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:15] [INFO ] Computing Do-Not-Accords matrix : 1269 transitions.
[2024-05-22 23:26:16] [INFO ] Computation of Completed DNA matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:16] [INFO ] Built C files in 549ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17424370032135709508
Running compilation step : cd /tmp/ltsmin17424370032135709508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17424370032135709508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17424370032135709508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 550 transition count 1267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 548 transition count 1267
Applied a total of 4 rules in 34 ms. Remains 548 /550 variables (removed 2) and now considering 1267/1269 (removed 2) transitions.
// Phase 1: matrix 1267 rows 548 cols
[2024-05-22 23:26:19] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 23:26:20] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-22 23:26:20] [INFO ] Invariant cache hit.
[2024-05-22 23:26:22] [INFO ] Implicit Places using invariants and state equation in 2563 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2024-05-22 23:26:22] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-22 23:26:22] [INFO ] Invariant cache hit.
[2024-05-22 23:26:24] [INFO ] Dead Transitions using invariants and state equation in 1347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 548/550 places, 1267/1269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4966 ms. Remains : 548/550 places, 1267/1269 transitions.
Built C files in :
/tmp/ltsmin12911874987466411890
[2024-05-22 23:26:24] [INFO ] Computing symmetric may disable matrix : 1267 transitions.
[2024-05-22 23:26:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:24] [INFO ] Computing symmetric may enable matrix : 1267 transitions.
[2024-05-22 23:26:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:24] [INFO ] Computing Do-Not-Accords matrix : 1267 transitions.
[2024-05-22 23:26:24] [INFO ] Computation of Completed DNA matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:24] [INFO ] Built C files in 502ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12911874987466411890
Running compilation step : cd /tmp/ltsmin12911874987466411890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12911874987466411890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12911874987466411890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:26:27] [INFO ] Flatten gal took : 92 ms
[2024-05-22 23:26:27] [INFO ] Flatten gal took : 87 ms
[2024-05-22 23:26:27] [INFO ] Time to serialize gal into /tmp/LTL12829456804118805276.gal : 16 ms
[2024-05-22 23:26:27] [INFO ] Time to serialize properties into /tmp/LTL5336841470196040780.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12829456804118805276.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2223530709776096011.hoa' '-atoms' '/tmp/LTL5336841470196040780.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5336841470196040780.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2223530709776096011.hoa
Detected timeout of ITS tools.
[2024-05-22 23:26:43] [INFO ] Flatten gal took : 109 ms
[2024-05-22 23:26:43] [INFO ] Flatten gal took : 95 ms
[2024-05-22 23:26:43] [INFO ] Time to serialize gal into /tmp/LTL3635981585708801183.gal : 15 ms
[2024-05-22 23:26:43] [INFO ] Time to serialize properties into /tmp/LTL15595099311236336392.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3635981585708801183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15595099311236336392.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("((p713==0)||(p694==1))")U("((p771==0)||(p829==1))")))&&(F(G("((p28==0)||(p463==1))")))))
Formula 0 simplified : F((!"((p713==0)||(p694==1))" R !"((p771==0)||(p829==1))") | GF!"((p28==0)||(p463==1))")
Detected timeout of ITS tools.
[2024-05-22 23:26:58] [INFO ] Flatten gal took : 54 ms
[2024-05-22 23:26:58] [INFO ] Applying decomposition
[2024-05-22 23:26:58] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10123412158558315244.txt' '-o' '/tmp/graph10123412158558315244.bin' '-w' '/tmp/graph10123412158558315244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10123412158558315244.bin' '-l' '-1' '-v' '-w' '/tmp/graph10123412158558315244.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:26:58] [INFO ] Decomposing Gal with order
[2024-05-22 23:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:26:59] [INFO ] Removed a total of 2524 redundant transitions.
[2024-05-22 23:26:59] [INFO ] Flatten gal took : 184 ms
[2024-05-22 23:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 32 ms.
[2024-05-22 23:26:59] [INFO ] Time to serialize gal into /tmp/LTL15502739244562432808.gal : 17 ms
[2024-05-22 23:26:59] [INFO ] Time to serialize properties into /tmp/LTL7821651457059135320.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15502739244562432808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7821651457059135320.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("((i7.u81.p713==0)||(i9.u80.p694==1))")U("((i7.u83.p771==0)||(i11.u91.p829==1))")))&&(F(G("((i2.u8.p28==0)||(i3.u54.p463==1))")...159
Formula 0 simplified : F((!"((i7.u81.p713==0)||(i9.u80.p694==1))" R !"((i7.u83.p771==0)||(i11.u91.p829==1))") | GF!"((i2.u8.p28==0)||(i3.u54.p463==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14963955790146018048
[2024-05-22 23:27:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14963955790146018048
Running compilation step : cd /tmp/ltsmin14963955790146018048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14963955790146018048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14963955790146018048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06a-LTLCardinality-01 finished in 226325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1318 transition count 1979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1318 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1317 transition count 1971
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1316 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1315 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1315 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1314 transition count 1947
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1314 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1313 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1313 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1312 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1312 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1311 transition count 1923
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1311 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1310 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1310 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1309 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1309 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1308 transition count 1899
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1308 transition count 1899
Applied a total of 22 rules in 686 ms. Remains 1308 /1319 variables (removed 11) and now considering 1899/1987 (removed 88) transitions.
// Phase 1: matrix 1899 rows 1308 cols
[2024-05-22 23:27:18] [INFO ] Computed 199 invariants in 18 ms
[2024-05-22 23:27:19] [INFO ] Implicit Places using invariants in 1239 ms returned [18, 207, 212, 390, 395, 573, 578, 756, 761, 940, 945, 946, 964, 1110, 1126, 1131, 1132, 1150, 1171, 1172, 1189, 1197, 1205, 1211, 1217, 1223, 1229, 1237, 1243, 1249, 1257]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1241 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1277/1319 places, 1899/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1264 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1264 transition count 1886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1254 transition count 1876
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1254 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1249 transition count 1871
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1247 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1247 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1245 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1244 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1243 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1242 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1242 transition count 1864
Applied a total of 70 rules in 431 ms. Remains 1242 /1277 variables (removed 35) and now considering 1864/1899 (removed 35) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2024-05-22 23:27:19] [INFO ] Computed 168 invariants in 24 ms
[2024-05-22 23:27:21] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-22 23:27:21] [INFO ] Invariant cache hit.
[2024-05-22 23:27:25] [INFO ] Implicit Places using invariants and state equation in 4791 ms returned []
Implicit Place search using SMT with State Equation took 6112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1242/1319 places, 1864/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8470 ms. Remains : 1242/1319 places, 1864/1987 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s659 0) (EQ s701 1) (EQ s1181 0) (EQ s915 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 546 reset in 644 ms.
Product exploration explored 100000 steps with 540 reset in 337 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202569 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202569 steps, saw 70478 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:27:30] [INFO ] Invariant cache hit.
[2024-05-22 23:27:30] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:27:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2024-05-22 23:27:30] [INFO ] [Nat]Absence check using 40 positive and 128 generalized place invariants in 92 ms returned sat
[2024-05-22 23:27:32] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:32] [INFO ] After 1580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-22 23:27:32] [INFO ] After 2058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1242 transition count 1624
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 381 rules applied. Total rules applied 861 place count 785 transition count 1460
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 880 place count 775 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 889 place count 766 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 889 place count 766 transition count 1427
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 937 place count 742 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 942 place count 737 transition count 1422
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 737 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 951 place count 737 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 952 place count 736 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 952 place count 736 transition count 1417
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 954 place count 735 transition count 1417
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 1088 place count 668 transition count 1350
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1094 place count 668 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1100 place count 662 transition count 1344
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1124 place count 662 transition count 1320
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1149 place count 637 transition count 1320
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1155 place count 637 transition count 1314
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1174 place count 637 transition count 1314
Applied a total of 1174 rules in 379 ms. Remains 637 /1242 variables (removed 605) and now considering 1314/1864 (removed 550) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 637/1242 places, 1314/1864 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 346480 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346480 steps, saw 82137 distinct states, run finished after 3005 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1314 rows 637 cols
[2024-05-22 23:27:36] [INFO ] Computed 104 invariants in 14 ms
[2024-05-22 23:27:36] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:27:36] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2024-05-22 23:27:36] [INFO ] [Nat]Absence check using 24 positive and 80 generalized place invariants in 55 ms returned sat
[2024-05-22 23:27:37] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-22 23:27:38] [INFO ] After 713ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:38] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-22 23:27:38] [INFO ] After 2128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 21 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 637/637 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 21 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2024-05-22 23:27:38] [INFO ] Invariant cache hit.
[2024-05-22 23:27:39] [INFO ] Implicit Places using invariants in 1013 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 273, 279, 282, 284, 287, 294, 295, 296, 366, 372, 378, 381, 394, 463, 469, 472, 474, 477, 485, 486, 487, 556, 562, 565, 567, 570, 583]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 594/637 places, 1314/1314 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 594 transition count 1302
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 582 transition count 1302
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 47 place count 559 transition count 1279
Iterating global reduction 0 with 23 rules applied. Total rules applied 70 place count 559 transition count 1279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 559 transition count 1273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 553 transition count 1267
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 553 transition count 1267
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 547 transition count 1261
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 118 place count 547 transition count 1243
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 136 place count 529 transition count 1243
Applied a total of 136 rules in 149 ms. Remains 529 /594 variables (removed 65) and now considering 1243/1314 (removed 71) transitions.
// Phase 1: matrix 1243 rows 529 cols
[2024-05-22 23:27:39] [INFO ] Computed 61 invariants in 16 ms
[2024-05-22 23:27:40] [INFO ] Implicit Places using invariants in 917 ms returned [72, 89, 145, 162, 218, 235, 291, 312, 374, 392, 448, 465]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 918 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 517/637 places, 1243/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 516 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 516 transition count 1242
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 510 transition count 1236
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 510 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 504 transition count 1230
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 504 transition count 1230
Applied a total of 27 rules in 127 ms. Remains 504 /517 variables (removed 13) and now considering 1230/1243 (removed 13) transitions.
// Phase 1: matrix 1230 rows 504 cols
[2024-05-22 23:27:40] [INFO ] Computed 49 invariants in 18 ms
[2024-05-22 23:27:41] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-22 23:27:41] [INFO ] Invariant cache hit.
[2024-05-22 23:27:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:27:43] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 504/637 places, 1230/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5085 ms. Remains : 504/637 places, 1230/1314 transitions.
Incomplete random walk after 10000 steps, including 178 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 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282841 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282841 steps, saw 206703 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:27:46] [INFO ] Invariant cache hit.
[2024-05-22 23:27:46] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:27:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 23:27:46] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 22 ms returned sat
[2024-05-22 23:27:47] [INFO ] After 1298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:27:48] [INFO ] After 706ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:49] [INFO ] After 1512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-22 23:27:49] [INFO ] After 3021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1230/1230 transitions.
Applied a total of 0 rules in 27 ms. Remains 504 /504 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 504/504 places, 1230/1230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1230/1230 transitions.
Applied a total of 0 rules in 42 ms. Remains 504 /504 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2024-05-22 23:27:49] [INFO ] Invariant cache hit.
[2024-05-22 23:27:50] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-22 23:27:50] [INFO ] Invariant cache hit.
[2024-05-22 23:27:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:27:52] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
[2024-05-22 23:27:52] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-22 23:27:52] [INFO ] Invariant cache hit.
[2024-05-22 23:27:53] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4353 ms. Remains : 504/504 places, 1230/1230 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:27:53] [INFO ] Invariant cache hit.
[2024-05-22 23:27:54] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:27:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 23:27:54] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 23 ms returned sat
[2024-05-22 23:27:55] [INFO ] After 1159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:55] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 23:27:55] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Support contains 4 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1242 transition count 1624
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 381 rules applied. Total rules applied 861 place count 785 transition count 1460
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 880 place count 775 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 889 place count 766 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 889 place count 766 transition count 1427
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 937 place count 742 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 942 place count 737 transition count 1422
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 737 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 951 place count 737 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 952 place count 736 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 952 place count 736 transition count 1417
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 954 place count 735 transition count 1417
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 1088 place count 668 transition count 1350
Applied a total of 1088 rules in 235 ms. Remains 668 /1242 variables (removed 574) and now considering 1350/1864 (removed 514) transitions.
// Phase 1: matrix 1350 rows 668 cols
[2024-05-22 23:27:56] [INFO ] Computed 105 invariants in 20 ms
[2024-05-22 23:27:57] [INFO ] Implicit Places using invariants in 1245 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 284, 290, 295, 311, 382, 388, 394, 413, 483, 489, 494, 511, 581, 587, 592, 611, 665]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1260 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 643/1242 places, 1350/1864 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 1349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 642 transition count 1349
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 642 transition count 1337
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 630 transition count 1337
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 619 transition count 1326
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 619 transition count 1326
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 59 place count 608 transition count 1315
Iterating global reduction 2 with 11 rules applied. Total rules applied 70 place count 608 transition count 1315
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 602 transition count 1309
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 602 transition count 1309
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 590 transition count 1297
Applied a total of 106 rules in 145 ms. Remains 590 /643 variables (removed 53) and now considering 1297/1350 (removed 53) transitions.
// Phase 1: matrix 1297 rows 590 cols
[2024-05-22 23:27:57] [INFO ] Computed 80 invariants in 19 ms
[2024-05-22 23:27:58] [INFO ] Implicit Places using invariants in 1152 ms returned [93, 96, 177, 180, 261, 264, 349, 352, 436, 440, 521, 524]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1156 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 578/1242 places, 1297/1864 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 578 transition count 1291
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 572 transition count 1291
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 566 transition count 1285
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 566 transition count 1285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 566 transition count 1279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 565 transition count 1278
Applied a total of 32 rules in 87 ms. Remains 565 /578 variables (removed 13) and now considering 1278/1297 (removed 19) transitions.
// Phase 1: matrix 1278 rows 565 cols
[2024-05-22 23:27:58] [INFO ] Computed 68 invariants in 19 ms
[2024-05-22 23:27:59] [INFO ] Implicit Places using invariants in 1087 ms returned [72, 151, 231, 311, 398, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1089 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 559/1242 places, 1278/1864 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 553 transition count 1272
Applied a total of 12 rules in 54 ms. Remains 553 /559 variables (removed 6) and now considering 1272/1278 (removed 6) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:28:00] [INFO ] Computed 62 invariants in 19 ms
[2024-05-22 23:28:01] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-05-22 23:28:01] [INFO ] Invariant cache hit.
[2024-05-22 23:28:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:28:04] [INFO ] Implicit Places using invariants and state equation in 2901 ms returned []
Implicit Place search using SMT with State Equation took 3965 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 553/1242 places, 1272/1864 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 7992 ms. Remains : 553/1242 places, 1272/1864 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 136 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341223 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341223 steps, saw 102859 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:28:07] [INFO ] Invariant cache hit.
[2024-05-22 23:28:07] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:28:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 23:28:07] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 32 ms returned sat
[2024-05-22 23:28:08] [INFO ] After 1068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:28:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:28:09] [INFO ] After 686ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:28:09] [INFO ] After 765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 23:28:09] [INFO ] After 2019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 76 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 512/553 places, 1225/1272 transitions.
Incomplete random walk after 10000 steps, including 177 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 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228428 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228428 steps, saw 132182 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 512 cols
[2024-05-22 23:28:12] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:28:12] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:28:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:28:12] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 36 ms returned sat
[2024-05-22 23:28:14] [INFO ] After 1168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:28:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:28:15] [INFO ] After 1051ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:28:15] [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 44 ms.
[2024-05-22 23:28:15] [INFO ] After 2538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 18 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:28:15] [INFO ] Invariant cache hit.
[2024-05-22 23:28:16] [INFO ] Implicit Places using invariants in 866 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 868 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 28 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 916 ms. Remains : 504/512 places, 1225/1225 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240835 steps, run timeout after 3004 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240835 steps, saw 139813 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 504 cols
[2024-05-22 23:28:19] [INFO ] Computed 54 invariants in 10 ms
[2024-05-22 23:28:19] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:28:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 23:28:19] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 24 ms returned sat
[2024-05-22 23:28:29] [INFO ] After 9687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:28:29] [INFO ] Invariant cache hit.
[2024-05-22 23:28:29] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-22 23:28:29] [INFO ] Invariant cache hit.
[2024-05-22 23:28:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:28:32] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
[2024-05-22 23:28:32] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-22 23:28:32] [INFO ] Invariant cache hit.
[2024-05-22 23:28:33] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3990 ms. Remains : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 28 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:28:33] [INFO ] Invariant cache hit.
[2024-05-22 23:28:33] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:28:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-22 23:28:33] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned sat
[2024-05-22 23:28:34] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:28:34] [INFO ] After 1575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 23:28:35] [INFO ] After 1845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1331 reset in 392 ms.
Product exploration explored 100000 steps with 1350 reset in 392 ms.
Built C files in :
/tmp/ltsmin13822598973121177204
[2024-05-22 23:28:36] [INFO ] Computing symmetric may disable matrix : 1272 transitions.
[2024-05-22 23:28:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:36] [INFO ] Computing symmetric may enable matrix : 1272 transitions.
[2024-05-22 23:28:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:36] [INFO ] Computing Do-Not-Accords matrix : 1272 transitions.
[2024-05-22 23:28:36] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:36] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13822598973121177204
Running compilation step : cd /tmp/ltsmin13822598973121177204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13822598973121177204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13822598973121177204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 19 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:28:39] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 23:28:40] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-05-22 23:28:40] [INFO ] Invariant cache hit.
[2024-05-22 23:28:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:28:43] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 3987 ms to find 0 implicit places.
[2024-05-22 23:28:43] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-22 23:28:43] [INFO ] Invariant cache hit.
[2024-05-22 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5235 ms. Remains : 553/553 places, 1272/1272 transitions.
Built C files in :
/tmp/ltsmin15783560930543720674
[2024-05-22 23:28:44] [INFO ] Computing symmetric may disable matrix : 1272 transitions.
[2024-05-22 23:28:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:44] [INFO ] Computing symmetric may enable matrix : 1272 transitions.
[2024-05-22 23:28:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:44] [INFO ] Computing Do-Not-Accords matrix : 1272 transitions.
[2024-05-22 23:28:45] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:28:45] [INFO ] Built C files in 298ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15783560930543720674
Running compilation step : cd /tmp/ltsmin15783560930543720674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15783560930543720674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15783560930543720674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:28:48] [INFO ] Flatten gal took : 56 ms
[2024-05-22 23:28:48] [INFO ] Flatten gal took : 50 ms
[2024-05-22 23:28:48] [INFO ] Time to serialize gal into /tmp/LTL3517535187281854374.gal : 10 ms
[2024-05-22 23:28:48] [INFO ] Time to serialize properties into /tmp/LTL11834366757426764225.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3517535187281854374.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17980598646851973161.hoa' '-atoms' '/tmp/LTL11834366757426764225.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11834366757426764225.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17980598646851973161.hoa
Detected timeout of ITS tools.
[2024-05-22 23:29:03] [INFO ] Flatten gal took : 52 ms
[2024-05-22 23:29:03] [INFO ] Flatten gal took : 50 ms
[2024-05-22 23:29:03] [INFO ] Time to serialize gal into /tmp/LTL6048145516059648377.gal : 9 ms
[2024-05-22 23:29:03] [INFO ] Time to serialize properties into /tmp/LTL17741086163723607791.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6048145516059648377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17741086163723607791.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p712==0)||(p754==1))||((p1310==0)||(p983==1)))"))))
Formula 0 simplified : XF!"(((p712==0)||(p754==1))||((p1310==0)||(p983==1)))"
Detected timeout of ITS tools.
[2024-05-22 23:29:18] [INFO ] Flatten gal took : 46 ms
[2024-05-22 23:29:18] [INFO ] Applying decomposition
[2024-05-22 23:29:18] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4215177975969176073.txt' '-o' '/tmp/graph4215177975969176073.bin' '-w' '/tmp/graph4215177975969176073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4215177975969176073.bin' '-l' '-1' '-v' '-w' '/tmp/graph4215177975969176073.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:29:18] [INFO ] Decomposing Gal with order
[2024-05-22 23:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:29:18] [INFO ] Removed a total of 2556 redundant transitions.
[2024-05-22 23:29:18] [INFO ] Flatten gal took : 98 ms
[2024-05-22 23:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 31 ms.
[2024-05-22 23:29:18] [INFO ] Time to serialize gal into /tmp/LTL16701858031535686797.gal : 11 ms
[2024-05-22 23:29:18] [INFO ] Time to serialize properties into /tmp/LTL835929752354893691.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16701858031535686797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL835929752354893691.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i7.u81.p712==0)||(i7.u82.p754==1))||((i11.u132.p1310==0)||(i7.u101.p983==1)))"))))
Formula 0 simplified : XF!"(((i7.u81.p712==0)||(i7.u82.p754==1))||((i11.u132.p1310==0)||(i7.u101.p983==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15416936863621102311
[2024-05-22 23:29:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15416936863621102311
Running compilation step : cd /tmp/ltsmin15416936863621102311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15416936863621102311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15416936863621102311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06a-LTLCardinality-02 finished in 139566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1318 transition count 1979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1318 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1317 transition count 1971
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1316 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1315 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1315 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1314 transition count 1947
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1314 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1313 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1313 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1312 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1312 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1311 transition count 1923
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1311 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1310 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1310 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1309 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1309 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1308 transition count 1899
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1308 transition count 1899
Applied a total of 22 rules in 468 ms. Remains 1308 /1319 variables (removed 11) and now considering 1899/1987 (removed 88) transitions.
// Phase 1: matrix 1899 rows 1308 cols
[2024-05-22 23:29:37] [INFO ] Computed 199 invariants in 19 ms
[2024-05-22 23:29:39] [INFO ] Implicit Places using invariants in 1915 ms returned [18, 207, 212, 390, 395, 573, 578, 756, 761, 924, 940, 945, 964, 1110, 1126, 1131, 1132, 1150, 1171, 1172, 1189, 1197, 1205, 1211, 1217, 1223, 1229, 1237, 1243, 1249, 1257]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1921 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1277/1319 places, 1899/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1264 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1264 transition count 1886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1254 transition count 1876
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1254 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1249 transition count 1871
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1247 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1247 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1245 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1244 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1243 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1242 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1242 transition count 1864
Applied a total of 70 rules in 542 ms. Remains 1242 /1277 variables (removed 35) and now considering 1864/1899 (removed 35) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2024-05-22 23:29:39] [INFO ] Computed 168 invariants in 25 ms
[2024-05-22 23:29:40] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-22 23:29:40] [INFO ] Invariant cache hit.
[2024-05-22 23:29:44] [INFO ] Implicit Places using invariants and state equation in 3717 ms returned []
Implicit Place search using SMT with State Equation took 4715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1242/1319 places, 1864/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7648 ms. Remains : 1242/1319 places, 1864/1987 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1023 0) (EQ s934 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 569 reset in 438 ms.
Product exploration explored 100000 steps with 543 reset in 521 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223870 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223870 steps, saw 78080 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:29:49] [INFO ] Invariant cache hit.
[2024-05-22 23:29:49] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:29:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2024-05-22 23:29:49] [INFO ] [Nat]Absence check using 39 positive and 129 generalized place invariants in 60 ms returned sat
[2024-05-22 23:29:51] [INFO ] After 1715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:29:51] [INFO ] After 1832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 474 ms.
[2024-05-22 23:29:51] [INFO ] After 2596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1242 transition count 1625
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1003 transition count 1624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1002 transition count 1624
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 161 Pre rules applied. Total rules applied 480 place count 1002 transition count 1463
Deduced a syphon composed of 161 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 375 rules applied. Total rules applied 855 place count 788 transition count 1463
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 19 rules applied. Total rules applied 874 place count 778 transition count 1454
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 883 place count 769 transition count 1454
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 883 place count 769 transition count 1434
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 923 place count 749 transition count 1434
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 928 place count 744 transition count 1429
Iterating global reduction 5 with 5 rules applied. Total rules applied 933 place count 744 transition count 1429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 937 place count 744 transition count 1425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 938 place count 743 transition count 1425
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 938 place count 743 transition count 1424
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 940 place count 742 transition count 1424
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 7 with 140 rules applied. Total rules applied 1080 place count 672 transition count 1354
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1086 place count 672 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1092 place count 666 transition count 1348
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1118 place count 666 transition count 1322
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1145 place count 639 transition count 1322
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1150 place count 639 transition count 1317
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1169 place count 639 transition count 1317
Applied a total of 1169 rules in 387 ms. Remains 639 /1242 variables (removed 603) and now considering 1317/1864 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 639/1242 places, 1317/1864 transitions.
Finished random walk after 390 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06a-LTLCardinality-03 finished in 15411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p2)||p1))||p0)))'
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1318 transition count 1979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1318 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1317 transition count 1971
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1316 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1315 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1315 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1314 transition count 1947
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1314 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1313 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1313 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1312 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1312 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1311 transition count 1923
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1311 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1310 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1310 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1309 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1309 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1308 transition count 1899
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1308 transition count 1899
Applied a total of 22 rules in 792 ms. Remains 1308 /1319 variables (removed 11) and now considering 1899/1987 (removed 88) transitions.
// Phase 1: matrix 1899 rows 1308 cols
[2024-05-22 23:29:53] [INFO ] Computed 199 invariants in 31 ms
[2024-05-22 23:29:55] [INFO ] Implicit Places using invariants in 1934 ms returned [18, 207, 212, 390, 395, 573, 756, 761, 924, 940, 945, 946, 964, 1110, 1126, 1131, 1132, 1150, 1171, 1172, 1189, 1197, 1205, 1211, 1217, 1223, 1229, 1237, 1243, 1249, 1257]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1937 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1277/1319 places, 1899/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1264 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1264 transition count 1886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1254 transition count 1876
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1254 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1249 transition count 1871
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1247 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1247 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1245 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1244 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1243 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1242 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1242 transition count 1864
Applied a total of 70 rules in 579 ms. Remains 1242 /1277 variables (removed 35) and now considering 1864/1899 (removed 35) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2024-05-22 23:29:55] [INFO ] Computed 168 invariants in 28 ms
[2024-05-22 23:29:57] [INFO ] Implicit Places using invariants in 1560 ms returned []
[2024-05-22 23:29:57] [INFO ] Invariant cache hit.
[2024-05-22 23:30:00] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1242/1319 places, 1864/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7938 ms. Remains : 1242/1319 places, 1864/1987 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s600 0) (EQ s1208 1)), p1:(OR (EQ s600 0) (EQ s1208 1)), p2:(AND (EQ s620 0) (EQ s572 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1665 ms.
Product exploration explored 100000 steps with 50000 reset in 1485 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06a-LTLCardinality-05 finished in 11274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1318 transition count 1979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1318 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1317 transition count 1971
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1316 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1315 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1315 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1314 transition count 1947
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1314 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1313 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1313 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1312 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1312 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1311 transition count 1923
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1311 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1310 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1310 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1309 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1309 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1308 transition count 1899
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1308 transition count 1899
Applied a total of 22 rules in 736 ms. Remains 1308 /1319 variables (removed 11) and now considering 1899/1987 (removed 88) transitions.
// Phase 1: matrix 1899 rows 1308 cols
[2024-05-22 23:30:04] [INFO ] Computed 199 invariants in 30 ms
[2024-05-22 23:30:06] [INFO ] Implicit Places using invariants in 1567 ms returned [18, 207, 212, 390, 395, 573, 578, 756, 761, 924, 940, 945, 946, 964, 1110, 1126, 1131, 1132, 1150, 1171, 1172, 1189, 1197, 1205, 1211, 1217, 1223, 1229, 1237, 1243, 1249, 1257]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1570 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1276/1319 places, 1899/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1263 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1263 transition count 1886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1253 transition count 1876
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1253 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1248 transition count 1871
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1248 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1246 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1246 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1244 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1244 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1243 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1243 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1242 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1242 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1241 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1241 transition count 1864
Applied a total of 70 rules in 553 ms. Remains 1241 /1276 variables (removed 35) and now considering 1864/1899 (removed 35) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-05-22 23:30:06] [INFO ] Computed 167 invariants in 27 ms
[2024-05-22 23:30:08] [INFO ] Implicit Places using invariants in 1605 ms returned []
[2024-05-22 23:30:08] [INFO ] Invariant cache hit.
[2024-05-22 23:30:12] [INFO ] Implicit Places using invariants and state equation in 4223 ms returned []
Implicit Place search using SMT with State Equation took 5843 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1241/1319 places, 1864/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8707 ms. Remains : 1241/1319 places, 1864/1987 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(OR (EQ s30 0) (EQ s877 1)), p1:(OR (EQ s355 0) (EQ s912 1))], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 532 reset in 448 ms.
Product exploration explored 100000 steps with 568 reset in 495 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:30:14] [INFO ] Invariant cache hit.
[2024-05-22 23:30:14] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:30:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 34 ms returned sat
[2024-05-22 23:30:14] [INFO ] [Nat]Absence check using 38 positive and 129 generalized place invariants in 97 ms returned sat
[2024-05-22 23:30:18] [INFO ] After 3748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:30:18] [INFO ] After 3879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3122 ms.
[2024-05-22 23:30:21] [INFO ] After 7477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1621
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 998 transition count 1621
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 486 place count 998 transition count 1457
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 866 place count 782 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 885 place count 772 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 894 place count 763 transition count 1448
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 894 place count 763 transition count 1425
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 940 place count 740 transition count 1425
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 945 place count 735 transition count 1420
Iterating global reduction 4 with 5 rules applied. Total rules applied 950 place count 735 transition count 1420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 954 place count 735 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 955 place count 734 transition count 1416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 955 place count 734 transition count 1415
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 957 place count 733 transition count 1415
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 1097 place count 663 transition count 1345
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1103 place count 663 transition count 1339
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1109 place count 657 transition count 1339
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1133 place count 657 transition count 1315
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1158 place count 632 transition count 1315
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1164 place count 632 transition count 1309
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1183 place count 632 transition count 1309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1296
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1226 place count 601 transition count 1290
Iterating global reduction 9 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1284
Applied a total of 1238 rules in 235 ms. Remains 601 /1241 variables (removed 640) and now considering 1284/1864 (removed 580) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 601/1241 places, 1284/1864 transitions.
Incomplete random walk after 10000 steps, including 157 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 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 352491 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352491 steps, saw 72222 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1284 rows 601 cols
[2024-05-22 23:30:25] [INFO ] Computed 92 invariants in 14 ms
[2024-05-22 23:30:25] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:30:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-22 23:30:25] [INFO ] [Nat]Absence check using 17 positive and 75 generalized place invariants in 45 ms returned sat
[2024-05-22 23:30:28] [INFO ] After 3389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:30:31] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2024-05-22 23:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-05-22 23:30:31] [INFO ] After 5705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2911 ms.
[2024-05-22 23:30:34] [INFO ] After 8846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 19 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 601/601 places, 1284/1284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 19 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-05-22 23:30:34] [INFO ] Invariant cache hit.
[2024-05-22 23:30:35] [INFO ] Implicit Places using invariants in 1177 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 445, 448, 450, 451, 456, 457, 509, 526, 532, 535, 537, 538]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 555/601 places, 1284/1284 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 538 transition count 1267
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 538 transition count 1267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 533 transition count 1262
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 533 transition count 1262
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 68 place count 521 transition count 1250
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 85 place count 521 transition count 1233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 102 place count 504 transition count 1233
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 504 transition count 1227
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 114 place count 498 transition count 1227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 498 transition count 1227
Applied a total of 115 rules in 181 ms. Remains 498 /555 variables (removed 57) and now considering 1227/1284 (removed 57) transitions.
// Phase 1: matrix 1227 rows 498 cols
[2024-05-22 23:30:35] [INFO ] Computed 46 invariants in 17 ms
[2024-05-22 23:30:36] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-05-22 23:30:36] [INFO ] Invariant cache hit.
[2024-05-22 23:30:38] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/601 places, 1227/1284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4006 ms. Remains : 498/601 places, 1227/1284 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 301428 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301428 steps, saw 180594 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:30:41] [INFO ] Invariant cache hit.
[2024-05-22 23:30:41] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:30:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 23:30:41] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 20 ms returned sat
[2024-05-22 23:30:43] [INFO ] After 2498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:30:43] [INFO ] After 2566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3554 ms.
[2024-05-22 23:30:47] [INFO ] After 6239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 498/498 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-05-22 23:30:47] [INFO ] Invariant cache hit.
[2024-05-22 23:30:48] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-22 23:30:48] [INFO ] Invariant cache hit.
[2024-05-22 23:30:50] [INFO ] Implicit Places using invariants and state equation in 2059 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2024-05-22 23:30:50] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-22 23:30:50] [INFO ] Invariant cache hit.
[2024-05-22 23:30:51] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4044 ms. Remains : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:30:51] [INFO ] Invariant cache hit.
[2024-05-22 23:30:51] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:30:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:30:51] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 30 ms returned sat
[2024-05-22 23:30:54] [INFO ] After 2399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:30:54] [INFO ] After 2466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3686 ms.
[2024-05-22 23:30:57] [INFO ] After 6346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 61 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-05-22 23:30:58] [INFO ] Computed 167 invariants in 27 ms
[2024-05-22 23:31:00] [INFO ] Implicit Places using invariants in 1574 ms returned []
[2024-05-22 23:31:00] [INFO ] Invariant cache hit.
[2024-05-22 23:31:04] [INFO ] Implicit Places using invariants and state equation in 4478 ms returned []
Implicit Place search using SMT with State Equation took 6054 ms to find 0 implicit places.
[2024-05-22 23:31:04] [INFO ] Invariant cache hit.
[2024-05-22 23:31:06] [INFO ] Dead Transitions using invariants and state equation in 1983 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8101 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:31:07] [INFO ] Invariant cache hit.
[2024-05-22 23:31:07] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:31:07] [INFO ] [Nat]Absence check using 38 positive place invariants in 35 ms returned sat
[2024-05-22 23:31:08] [INFO ] [Nat]Absence check using 38 positive and 129 generalized place invariants in 97 ms returned sat
[2024-05-22 23:31:11] [INFO ] After 3828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:31:12] [INFO ] After 3955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3062 ms.
[2024-05-22 23:31:15] [INFO ] After 7492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1621
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 998 transition count 1621
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 486 place count 998 transition count 1457
Deduced a syphon composed of 164 places in 3 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 866 place count 782 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 885 place count 772 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 894 place count 763 transition count 1448
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 894 place count 763 transition count 1425
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 940 place count 740 transition count 1425
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 945 place count 735 transition count 1420
Iterating global reduction 4 with 5 rules applied. Total rules applied 950 place count 735 transition count 1420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 954 place count 735 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 955 place count 734 transition count 1416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 955 place count 734 transition count 1415
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 957 place count 733 transition count 1415
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 1097 place count 663 transition count 1345
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1103 place count 663 transition count 1339
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1109 place count 657 transition count 1339
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1133 place count 657 transition count 1315
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1158 place count 632 transition count 1315
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1164 place count 632 transition count 1309
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1183 place count 632 transition count 1309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1296
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1226 place count 601 transition count 1290
Iterating global reduction 9 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1284
Applied a total of 1238 rules in 384 ms. Remains 601 /1241 variables (removed 640) and now considering 1284/1864 (removed 580) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 601/1241 places, 1284/1864 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342467 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342467 steps, saw 69910 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1284 rows 601 cols
[2024-05-22 23:31:18] [INFO ] Computed 92 invariants in 12 ms
[2024-05-22 23:31:18] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:31:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-22 23:31:18] [INFO ] [Nat]Absence check using 17 positive and 75 generalized place invariants in 42 ms returned sat
[2024-05-22 23:31:22] [INFO ] After 3390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:31:24] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 1 ms to minimize.
[2024-05-22 23:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2024-05-22 23:31:24] [INFO ] After 5707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2919 ms.
[2024-05-22 23:31:27] [INFO ] After 8841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 21 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 601/601 places, 1284/1284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 18 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-05-22 23:31:27] [INFO ] Invariant cache hit.
[2024-05-22 23:31:28] [INFO ] Implicit Places using invariants in 1333 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 445, 448, 450, 451, 456, 457, 509, 526, 532, 535, 537, 538]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1335 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 555/601 places, 1284/1284 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 538 transition count 1267
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 538 transition count 1267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 533 transition count 1262
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 533 transition count 1262
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 68 place count 521 transition count 1250
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 85 place count 521 transition count 1233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 102 place count 504 transition count 1233
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 504 transition count 1227
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 114 place count 498 transition count 1227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 498 transition count 1227
Applied a total of 115 rules in 179 ms. Remains 498 /555 variables (removed 57) and now considering 1227/1284 (removed 57) transitions.
// Phase 1: matrix 1227 rows 498 cols
[2024-05-22 23:31:29] [INFO ] Computed 46 invariants in 18 ms
[2024-05-22 23:31:29] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-22 23:31:29] [INFO ] Invariant cache hit.
[2024-05-22 23:31:31] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/601 places, 1227/1284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4284 ms. Remains : 498/601 places, 1227/1284 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279547 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279547 steps, saw 163686 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:31:34] [INFO ] Invariant cache hit.
[2024-05-22 23:31:34] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:31:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 23:31:35] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 19 ms returned sat
[2024-05-22 23:31:37] [INFO ] After 2429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:31:37] [INFO ] After 2495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3764 ms.
[2024-05-22 23:31:41] [INFO ] After 6377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 498/498 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-05-22 23:31:41] [INFO ] Invariant cache hit.
[2024-05-22 23:31:42] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-05-22 23:31:42] [INFO ] Invariant cache hit.
[2024-05-22 23:31:44] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
[2024-05-22 23:31:44] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-22 23:31:44] [INFO ] Invariant cache hit.
[2024-05-22 23:31:45] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4158 ms. Remains : 498/498 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:31:45] [INFO ] Invariant cache hit.
[2024-05-22 23:31:45] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:31:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-22 23:31:45] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 30 ms returned sat
[2024-05-22 23:31:48] [INFO ] After 2402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:31:48] [INFO ] After 2468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3792 ms.
[2024-05-22 23:31:52] [INFO ] After 6448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 554 reset in 374 ms.
Product exploration explored 100000 steps with 557 reset in 462 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1241 transition count 1864
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 242 place count 1241 transition count 1893
Deduced a syphon composed of 331 places in 3 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 331 place count 1241 transition count 1893
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 337 place count 1238 transition count 1893
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 372 place count 1203 transition count 1858
Deduced a syphon composed of 301 places in 4 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 407 place count 1203 transition count 1858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 407 place count 1203 transition count 1858
Deduced a syphon composed of 302 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 1203 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 1202 transition count 1857
Deduced a syphon composed of 301 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 1202 transition count 1857
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 455 places in 4 ms
Iterating global reduction 2 with 154 rules applied. Total rules applied 564 place count 1202 transition count 1878
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 643 place count 1123 transition count 1799
Deduced a syphon composed of 376 places in 3 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 722 place count 1123 transition count 1799
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 383 places in 3 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 729 place count 1123 transition count 1839
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 730 place count 1123 transition count 1843
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 732 place count 1121 transition count 1837
Deduced a syphon composed of 382 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 734 place count 1121 transition count 1837
Deduced a syphon composed of 382 places in 2 ms
Applied a total of 734 rules in 949 ms. Remains 1121 /1241 variables (removed 120) and now considering 1837/1864 (removed 27) transitions.
[2024-05-22 23:31:55] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1837 rows 1121 cols
[2024-05-22 23:31:55] [INFO ] Computed 164 invariants in 17 ms
[2024-05-22 23:31:56] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1241 places, 1837/1864 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2304 ms. Remains : 1121/1241 places, 1837/1864 transitions.
Built C files in :
/tmp/ltsmin8841408715773162952
[2024-05-22 23:31:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8841408715773162952
Running compilation step : cd /tmp/ltsmin8841408715773162952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8841408715773162952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8841408715773162952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 49 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-05-22 23:31:59] [INFO ] Computed 167 invariants in 18 ms
[2024-05-22 23:32:00] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-22 23:32:00] [INFO ] Invariant cache hit.
[2024-05-22 23:32:04] [INFO ] Implicit Places using invariants and state equation in 3796 ms returned []
Implicit Place search using SMT with State Equation took 4770 ms to find 0 implicit places.
[2024-05-22 23:32:04] [INFO ] Invariant cache hit.
[2024-05-22 23:32:06] [INFO ] Dead Transitions using invariants and state equation in 2032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6852 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin17796375131346433374
[2024-05-22 23:32:06] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17796375131346433374
Running compilation step : cd /tmp/ltsmin17796375131346433374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17796375131346433374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17796375131346433374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:32:09] [INFO ] Flatten gal took : 81 ms
[2024-05-22 23:32:09] [INFO ] Flatten gal took : 83 ms
[2024-05-22 23:32:09] [INFO ] Time to serialize gal into /tmp/LTL11455899097889342207.gal : 17 ms
[2024-05-22 23:32:09] [INFO ] Time to serialize properties into /tmp/LTL3476137964067189558.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11455899097889342207.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3610877114177493143.hoa' '-atoms' '/tmp/LTL3476137964067189558.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3476137964067189558.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3610877114177493143.hoa
Detected timeout of ITS tools.
[2024-05-22 23:32:24] [INFO ] Flatten gal took : 50 ms
[2024-05-22 23:32:24] [INFO ] Flatten gal took : 53 ms
[2024-05-22 23:32:24] [INFO ] Time to serialize gal into /tmp/LTL8519356889255752136.gal : 16 ms
[2024-05-22 23:32:24] [INFO ] Time to serialize properties into /tmp/LTL6554904509225478157.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8519356889255752136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6554904509225478157.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p38==0)||(p944==1))"))&&(X(F("((p380==0)||(p980==1))")))))))
Formula 0 simplified : XX(F!"((p38==0)||(p944==1))" | XG!"((p380==0)||(p980==1))")
Detected timeout of ITS tools.
[2024-05-22 23:32:40] [INFO ] Flatten gal took : 52 ms
[2024-05-22 23:32:40] [INFO ] Applying decomposition
[2024-05-22 23:32:40] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph312694102573357623.txt' '-o' '/tmp/graph312694102573357623.bin' '-w' '/tmp/graph312694102573357623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph312694102573357623.bin' '-l' '-1' '-v' '-w' '/tmp/graph312694102573357623.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:32:40] [INFO ] Decomposing Gal with order
[2024-05-22 23:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:32:40] [INFO ] Removed a total of 2523 redundant transitions.
[2024-05-22 23:32:40] [INFO ] Flatten gal took : 122 ms
[2024-05-22 23:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 33 ms.
[2024-05-22 23:32:40] [INFO ] Time to serialize gal into /tmp/LTL13371114816833415258.gal : 23 ms
[2024-05-22 23:32:40] [INFO ] Time to serialize properties into /tmp/LTL6005677005925649165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13371114816833415258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6005677005925649165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i0.u11.p38==0)||(i13.i0.u266.p944==1))"))&&(X(F("((i4.i0.u111.p380==0)||(i11.i4.u277.p980==1))")))))))
Formula 0 simplified : XX(F!"((i0.u11.p38==0)||(i13.i0.u266.p944==1))" | XG!"((i4.i0.u111.p380==0)||(i11.i4.u277.p980==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11463909594225833404
[2024-05-22 23:32:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11463909594225833404
Running compilation step : cd /tmp/ltsmin11463909594225833404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11463909594225833404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11463909594225833404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06a-LTLCardinality-08 finished in 175212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1318 transition count 1751
Reduce places removed 247 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 253 rules applied. Total rules applied 488 place count 1071 transition count 1745
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 494 place count 1065 transition count 1745
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 494 place count 1065 transition count 1596
Deduced a syphon composed of 149 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 844 place count 864 transition count 1596
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 28 rules applied. Total rules applied 872 place count 849 transition count 1583
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 885 place count 836 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 885 place count 836 transition count 1582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 887 place count 835 transition count 1582
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 896 place count 826 transition count 1566
Iterating global reduction 5 with 9 rules applied. Total rules applied 905 place count 826 transition count 1566
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 911 place count 826 transition count 1560
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 914 place count 823 transition count 1550
Iterating global reduction 6 with 3 rules applied. Total rules applied 917 place count 823 transition count 1550
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 920 place count 820 transition count 1540
Iterating global reduction 6 with 3 rules applied. Total rules applied 923 place count 820 transition count 1540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 925 place count 820 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 926 place count 819 transition count 1530
Iterating global reduction 7 with 1 rules applied. Total rules applied 927 place count 819 transition count 1530
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 928 place count 818 transition count 1522
Iterating global reduction 7 with 1 rules applied. Total rules applied 929 place count 818 transition count 1522
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 930 place count 817 transition count 1514
Iterating global reduction 7 with 1 rules applied. Total rules applied 931 place count 817 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 932 place count 816 transition count 1506
Iterating global reduction 7 with 1 rules applied. Total rules applied 933 place count 816 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 934 place count 815 transition count 1498
Iterating global reduction 7 with 1 rules applied. Total rules applied 935 place count 815 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 936 place count 814 transition count 1490
Iterating global reduction 7 with 1 rules applied. Total rules applied 937 place count 814 transition count 1490
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 938 place count 813 transition count 1482
Iterating global reduction 7 with 1 rules applied. Total rules applied 939 place count 813 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 940 place count 812 transition count 1474
Iterating global reduction 7 with 1 rules applied. Total rules applied 941 place count 812 transition count 1474
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 7 with 148 rules applied. Total rules applied 1089 place count 738 transition count 1400
Applied a total of 1089 rules in 361 ms. Remains 738 /1319 variables (removed 581) and now considering 1400/1987 (removed 587) transitions.
// Phase 1: matrix 1400 rows 738 cols
[2024-05-22 23:32:59] [INFO ] Computed 120 invariants in 15 ms
[2024-05-22 23:33:00] [INFO ] Implicit Places using invariants in 964 ms returned [17, 75, 120, 121, 173, 207, 216, 268, 302, 311, 363, 397, 409, 461, 500, 501, 513, 514, 532, 567, 608, 609, 621, 622, 640, 661, 672, 677, 682, 687, 692, 697, 702, 707, 712, 717, 722, 728, 734]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 966 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 699/1319 places, 1400/1987 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 699 transition count 1374
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 673 transition count 1374
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 52 place count 673 transition count 1347
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 106 place count 646 transition count 1347
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 644 transition count 1345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 642 transition count 1345
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 125 place count 629 transition count 1332
Iterating global reduction 4 with 13 rules applied. Total rules applied 138 place count 629 transition count 1332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 629 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 139 place count 629 transition count 1330
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 628 transition count 1330
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 625 transition count 1327
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 625 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 624 transition count 1326
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 624 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 623 transition count 1325
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 623 transition count 1325
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 201 place count 598 transition count 1300
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 598 transition count 1300
Applied a total of 202 rules in 166 ms. Remains 598 /699 variables (removed 101) and now considering 1300/1400 (removed 100) transitions.
// Phase 1: matrix 1300 rows 598 cols
[2024-05-22 23:33:00] [INFO ] Computed 79 invariants in 18 ms
[2024-05-22 23:33:01] [INFO ] Implicit Places using invariants in 872 ms returned [88, 94, 99, 174, 180, 185, 261, 267, 272, 348, 354, 359, 435, 441, 446, 522, 528, 533]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 874 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/1319 places, 1300/1987 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 568 transition count 1288
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 568 transition count 1288
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 556 transition count 1276
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 556 transition count 1276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 550 transition count 1270
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 550 transition count 1270
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 544 transition count 1264
Applied a total of 72 rules in 88 ms. Remains 544 /580 variables (removed 36) and now considering 1264/1300 (removed 36) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-05-22 23:33:01] [INFO ] Computed 61 invariants in 12 ms
[2024-05-22 23:33:02] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-22 23:33:02] [INFO ] Invariant cache hit.
[2024-05-22 23:33:04] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2774 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 544/1319 places, 1264/1987 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5230 ms. Remains : 544/1319 places, 1264/1987 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s98 0) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1375 reset in 238 ms.
Product exploration explored 100000 steps with 1354 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246660 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246660 steps, saw 153171 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:33:07] [INFO ] Invariant cache hit.
[2024-05-22 23:33:08] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:33:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-22 23:33:08] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 39 ms returned sat
[2024-05-22 23:33:09] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:33:10] [INFO ] After 2407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9007 ms.
[2024-05-22 23:33:19] [INFO ] After 11610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 544 transition count 1240
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 520 transition count 1235
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 520 transition count 1217
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 89 place count 502 transition count 1217
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 502 transition count 1216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 502 transition count 1216
Applied a total of 91 rules in 100 ms. Remains 502 /544 variables (removed 42) and now considering 1216/1264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 502/544 places, 1216/1264 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281261 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281261 steps, saw 153706 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1216 rows 502 cols
[2024-05-22 23:33:22] [INFO ] Computed 61 invariants in 11 ms
[2024-05-22 23:33:22] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:33:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 23:33:23] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 23 ms returned sat
[2024-05-22 23:33:23] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:33:28] [INFO ] After 4979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 199 ms.
[2024-05-22 23:33:28] [INFO ] After 5300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 31 ms. Remains 502 /502 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 502/502 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 31 ms. Remains 502 /502 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-22 23:33:28] [INFO ] Invariant cache hit.
[2024-05-22 23:33:29] [INFO ] Implicit Places using invariants in 1026 ms returned [88, 89, 160, 161, 231, 232, 302, 303, 373, 374]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1028 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 492/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 30 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1092 ms. Remains : 492/502 places, 1216/1216 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267282 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267282 steps, saw 147609 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1216 rows 492 cols
[2024-05-22 23:33:32] [INFO ] Computed 51 invariants in 11 ms
[2024-05-22 23:33:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:33:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 23:33:32] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 30 ms returned sat
[2024-05-22 23:33:38] [INFO ] After 6323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:33:45] [INFO ] After 12369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 602 ms.
[2024-05-22 23:33:45] [INFO ] After 13106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 492/492 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-22 23:33:45] [INFO ] Invariant cache hit.
[2024-05-22 23:33:46] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-22 23:33:46] [INFO ] Invariant cache hit.
[2024-05-22 23:33:48] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2024-05-22 23:33:48] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-22 23:33:48] [INFO ] Invariant cache hit.
[2024-05-22 23:33:49] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3578 ms. Remains : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:33:49] [INFO ] Invariant cache hit.
[2024-05-22 23:33:49] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:33:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 23:33:49] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-22 23:33:51] [INFO ] After 2141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:33:51] [INFO ] After 2315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1506 ms.
[2024-05-22 23:33:53] [INFO ] After 3943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 19 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-05-22 23:33:53] [INFO ] Computed 61 invariants in 11 ms
[2024-05-22 23:33:54] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-05-22 23:33:54] [INFO ] Invariant cache hit.
[2024-05-22 23:33:56] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2024-05-22 23:33:56] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-22 23:33:56] [INFO ] Invariant cache hit.
[2024-05-22 23:33:58] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4726 ms. Remains : 544/544 places, 1264/1264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251210 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251210 steps, saw 155855 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:34:01] [INFO ] Invariant cache hit.
[2024-05-22 23:34:01] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:34:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-22 23:34:01] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 38 ms returned sat
[2024-05-22 23:34:02] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:34:03] [INFO ] After 2196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9008 ms.
[2024-05-22 23:34:12] [INFO ] After 11356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 544 transition count 1240
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 520 transition count 1235
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 520 transition count 1217
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 89 place count 502 transition count 1217
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 502 transition count 1216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 502 transition count 1216
Applied a total of 91 rules in 99 ms. Remains 502 /544 variables (removed 42) and now considering 1216/1264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 502/544 places, 1216/1264 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235380 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235380 steps, saw 134042 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1216 rows 502 cols
[2024-05-22 23:34:16] [INFO ] Computed 61 invariants in 18 ms
[2024-05-22 23:34:16] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:34:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-22 23:34:16] [INFO ] [Nat]Absence check using 12 positive and 49 generalized place invariants in 36 ms returned sat
[2024-05-22 23:34:17] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:34:21] [INFO ] After 5213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 210 ms.
[2024-05-22 23:34:21] [INFO ] After 5616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 29 ms. Remains 502 /502 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 502/502 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 29 ms. Remains 502 /502 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-22 23:34:21] [INFO ] Invariant cache hit.
[2024-05-22 23:34:22] [INFO ] Implicit Places using invariants in 966 ms returned [88, 89, 160, 161, 231, 232, 302, 303, 373, 374]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 968 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 492/502 places, 1216/1216 transitions.
Applied a total of 0 rules in 31 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1028 ms. Remains : 492/502 places, 1216/1216 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265857 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265857 steps, saw 147019 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1216 rows 492 cols
[2024-05-22 23:34:25] [INFO ] Computed 51 invariants in 10 ms
[2024-05-22 23:34:25] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:34:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 23:34:26] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 25 ms returned sat
[2024-05-22 23:34:32] [INFO ] After 6369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:34:38] [INFO ] After 12583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 436 ms.
[2024-05-22 23:34:39] [INFO ] After 13143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 19 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 492/492 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-22 23:34:39] [INFO ] Invariant cache hit.
[2024-05-22 23:34:39] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-22 23:34:39] [INFO ] Invariant cache hit.
[2024-05-22 23:34:41] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
[2024-05-22 23:34:41] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-22 23:34:41] [INFO ] Invariant cache hit.
[2024-05-22 23:34:42] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3716 ms. Remains : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 18 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:34:42] [INFO ] Invariant cache hit.
[2024-05-22 23:34:42] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:34:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 23:34:43] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-22 23:34:45] [INFO ] After 2059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:34:45] [INFO ] After 2180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1232 ms.
[2024-05-22 23:34:46] [INFO ] After 3536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1394 reset in 360 ms.
Product exploration explored 100000 steps with 1351 reset in 367 ms.
Built C files in :
/tmp/ltsmin16260451748033625837
[2024-05-22 23:34:47] [INFO ] Computing symmetric may disable matrix : 1264 transitions.
[2024-05-22 23:34:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:47] [INFO ] Computing symmetric may enable matrix : 1264 transitions.
[2024-05-22 23:34:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:47] [INFO ] Computing Do-Not-Accords matrix : 1264 transitions.
[2024-05-22 23:34:47] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:47] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16260451748033625837
Running compilation step : cd /tmp/ltsmin16260451748033625837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16260451748033625837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16260451748033625837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 21 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-05-22 23:34:50] [INFO ] Computed 61 invariants in 11 ms
[2024-05-22 23:34:51] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-22 23:34:51] [INFO ] Invariant cache hit.
[2024-05-22 23:34:54] [INFO ] Implicit Places using invariants and state equation in 2711 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2024-05-22 23:34:54] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-22 23:34:54] [INFO ] Invariant cache hit.
[2024-05-22 23:34:56] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5148 ms. Remains : 544/544 places, 1264/1264 transitions.
Built C files in :
/tmp/ltsmin12220781364142330910
[2024-05-22 23:34:56] [INFO ] Computing symmetric may disable matrix : 1264 transitions.
[2024-05-22 23:34:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:56] [INFO ] Computing symmetric may enable matrix : 1264 transitions.
[2024-05-22 23:34:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:56] [INFO ] Computing Do-Not-Accords matrix : 1264 transitions.
[2024-05-22 23:34:56] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:34:56] [INFO ] Built C files in 286ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12220781364142330910
Running compilation step : cd /tmp/ltsmin12220781364142330910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12220781364142330910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12220781364142330910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:34:59] [INFO ] Flatten gal took : 42 ms
[2024-05-22 23:34:59] [INFO ] Flatten gal took : 42 ms
[2024-05-22 23:34:59] [INFO ] Time to serialize gal into /tmp/LTL15575555501253495054.gal : 8 ms
[2024-05-22 23:34:59] [INFO ] Time to serialize properties into /tmp/LTL16393018941034713054.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15575555501253495054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12694073857570751495.hoa' '-atoms' '/tmp/LTL16393018941034713054.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16393018941034713054.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12694073857570751495.hoa
Detected timeout of ITS tools.
[2024-05-22 23:35:14] [INFO ] Flatten gal took : 39 ms
[2024-05-22 23:35:14] [INFO ] Flatten gal took : 39 ms
[2024-05-22 23:35:14] [INFO ] Time to serialize gal into /tmp/LTL2213721958732801892.gal : 7 ms
[2024-05-22 23:35:14] [INFO ] Time to serialize properties into /tmp/LTL18430480779600958369.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2213721958732801892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18430480779600958369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p220==0)||(p441==1))"))))
Formula 0 simplified : FG!"((p220==0)||(p441==1))"
Detected timeout of ITS tools.
[2024-05-22 23:35:29] [INFO ] Flatten gal took : 39 ms
[2024-05-22 23:35:29] [INFO ] Applying decomposition
[2024-05-22 23:35:29] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5113147590855455581.txt' '-o' '/tmp/graph5113147590855455581.bin' '-w' '/tmp/graph5113147590855455581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5113147590855455581.bin' '-l' '-1' '-v' '-w' '/tmp/graph5113147590855455581.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:35:29] [INFO ] Decomposing Gal with order
[2024-05-22 23:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:35:30] [INFO ] Removed a total of 2533 redundant transitions.
[2024-05-22 23:35:30] [INFO ] Flatten gal took : 85 ms
[2024-05-22 23:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 14 ms.
[2024-05-22 23:35:30] [INFO ] Time to serialize gal into /tmp/LTL12944461771720825864.gal : 26 ms
[2024-05-22 23:35:30] [INFO ] Time to serialize properties into /tmp/LTL14083605180931171254.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12944461771720825864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14083605180931171254.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u26.p220==0)||(i5.u53.p441==1))"))))
Formula 0 simplified : FG!"((i0.u26.p220==0)||(i5.u53.p441==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11597749648264427751
[2024-05-22 23:35:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11597749648264427751
Running compilation step : cd /tmp/ltsmin11597749648264427751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11597749648264427751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11597749648264427751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06a-LTLCardinality-10 finished in 169293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Applied a total of 0 rules in 49 ms. Remains 1319 /1319 variables (removed 0) and now considering 1987/1987 (removed 0) transitions.
// Phase 1: matrix 1987 rows 1319 cols
[2024-05-22 23:35:48] [INFO ] Computed 199 invariants in 20 ms
[2024-05-22 23:35:50] [INFO ] Implicit Places using invariants in 1805 ms returned [18, 207, 212, 390, 395, 573, 578, 756, 761, 924, 940, 945, 946, 964, 1110, 1126, 1131, 1132, 1161, 1182, 1183, 1200, 1208, 1216, 1222, 1228, 1234, 1240, 1248, 1254, 1260, 1268]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1808 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1319 places, 1987/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1274 transition count 1974
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1274 transition count 1974
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1264 transition count 1964
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1264 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1259 transition count 1959
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1259 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1257 transition count 1957
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1257 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1255 transition count 1955
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1255 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1254 transition count 1954
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1254 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1253 transition count 1953
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1253 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1252 transition count 1952
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1252 transition count 1952
Applied a total of 70 rules in 629 ms. Remains 1252 /1287 variables (removed 35) and now considering 1952/1987 (removed 35) transitions.
// Phase 1: matrix 1952 rows 1252 cols
[2024-05-22 23:35:50] [INFO ] Computed 167 invariants in 18 ms
[2024-05-22 23:35:51] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2024-05-22 23:35:51] [INFO ] Invariant cache hit.
[2024-05-22 23:35:54] [INFO ] Implicit Places using invariants and state equation in 2910 ms returned []
Implicit Place search using SMT with State Equation took 3980 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1252/1319 places, 1952/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6466 ms. Remains : 1252/1319 places, 1952/1987 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-12 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}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (EQ s384 0) (EQ s212 1)), p0:(OR (AND (EQ s384 0) (EQ s212 1)) (AND (EQ s953 0) (EQ s1121 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-12 finished in 6598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(G(p1))&&F(p2)))))))'
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 233 place count 1318 transition count 1753
Reduce places removed 246 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 252 rules applied. Total rules applied 485 place count 1072 transition count 1747
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 492 place count 1066 transition count 1746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 1065 transition count 1746
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 147 Pre rules applied. Total rules applied 493 place count 1065 transition count 1599
Deduced a syphon composed of 147 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 345 rules applied. Total rules applied 838 place count 867 transition count 1599
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 29 rules applied. Total rules applied 867 place count 851 transition count 1586
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 880 place count 838 transition count 1586
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 880 place count 838 transition count 1585
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 882 place count 837 transition count 1585
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 891 place count 828 transition count 1569
Iterating global reduction 6 with 9 rules applied. Total rules applied 900 place count 828 transition count 1569
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 906 place count 828 transition count 1563
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 909 place count 825 transition count 1553
Iterating global reduction 7 with 3 rules applied. Total rules applied 912 place count 825 transition count 1553
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 915 place count 822 transition count 1543
Iterating global reduction 7 with 3 rules applied. Total rules applied 918 place count 822 transition count 1543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 920 place count 822 transition count 1541
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 921 place count 821 transition count 1533
Iterating global reduction 8 with 1 rules applied. Total rules applied 922 place count 821 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 923 place count 820 transition count 1525
Iterating global reduction 8 with 1 rules applied. Total rules applied 924 place count 820 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 925 place count 819 transition count 1517
Iterating global reduction 8 with 1 rules applied. Total rules applied 926 place count 819 transition count 1517
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 927 place count 818 transition count 1509
Iterating global reduction 8 with 1 rules applied. Total rules applied 928 place count 818 transition count 1509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 929 place count 817 transition count 1501
Iterating global reduction 8 with 1 rules applied. Total rules applied 930 place count 817 transition count 1501
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 931 place count 816 transition count 1493
Iterating global reduction 8 with 1 rules applied. Total rules applied 932 place count 816 transition count 1493
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 933 place count 815 transition count 1485
Iterating global reduction 8 with 1 rules applied. Total rules applied 934 place count 815 transition count 1485
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 935 place count 814 transition count 1477
Iterating global reduction 8 with 1 rules applied. Total rules applied 936 place count 814 transition count 1477
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 8 with 152 rules applied. Total rules applied 1088 place count 738 transition count 1401
Applied a total of 1088 rules in 386 ms. Remains 738 /1319 variables (removed 581) and now considering 1401/1987 (removed 586) transitions.
// Phase 1: matrix 1401 rows 738 cols
[2024-05-22 23:35:55] [INFO ] Computed 119 invariants in 15 ms
[2024-05-22 23:35:56] [INFO ] Implicit Places using invariants in 932 ms returned [17, 75, 97, 118, 170, 205, 214, 266, 300, 309, 361, 397, 409, 461, 500, 501, 513, 514, 532, 567, 608, 609, 621, 622, 640, 661, 672, 677, 682, 687, 692, 697, 702, 707, 712, 717, 722, 728, 734]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 933 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 699/1319 places, 1401/1987 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 699 transition count 1375
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 673 transition count 1374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 672 transition count 1374
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 54 place count 672 transition count 1349
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 104 place count 647 transition count 1349
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 107 place count 646 transition count 1347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 644 transition count 1347
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 122 place count 631 transition count 1334
Iterating global reduction 5 with 13 rules applied. Total rules applied 135 place count 631 transition count 1334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 631 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 136 place count 631 transition count 1332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 630 transition count 1332
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 141 place count 627 transition count 1329
Iterating global reduction 6 with 3 rules applied. Total rules applied 144 place count 627 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 626 transition count 1328
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 626 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 147 place count 625 transition count 1327
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 625 transition count 1327
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 196 place count 601 transition count 1303
Applied a total of 196 rules in 130 ms. Remains 601 /699 variables (removed 98) and now considering 1303/1401 (removed 98) transitions.
// Phase 1: matrix 1303 rows 601 cols
[2024-05-22 23:35:56] [INFO ] Computed 79 invariants in 12 ms
[2024-05-22 23:35:56] [INFO ] Implicit Places using invariants in 626 ms returned [95, 100, 175, 181, 186, 262, 268, 273, 350, 357, 362, 438, 444, 449, 525, 531, 536]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 627 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/1319 places, 1303/1987 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 573 transition count 1292
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 573 transition count 1292
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 563 transition count 1282
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 563 transition count 1282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 559 transition count 1278
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 559 transition count 1278
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 553 transition count 1272
Applied a total of 62 rules in 83 ms. Remains 553 /584 variables (removed 31) and now considering 1272/1303 (removed 31) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:35:56] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:35:57] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-22 23:35:57] [INFO ] Invariant cache hit.
[2024-05-22 23:35:59] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2685 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/1319 places, 1272/1987 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4846 ms. Remains : 553/1319 places, 1272/1987 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s157 1), p2:(OR (EQ s89 0) (EQ s326 1)), p1:(EQ s320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-13 finished in 5094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1318 transition count 1979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1318 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1317 transition count 1971
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1316 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1315 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1315 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1314 transition count 1947
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1314 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1313 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1313 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1312 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1312 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1311 transition count 1923
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1311 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1310 transition count 1915
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1310 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1309 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1309 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1308 transition count 1899
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1308 transition count 1899
Applied a total of 22 rules in 863 ms. Remains 1308 /1319 variables (removed 11) and now considering 1899/1987 (removed 88) transitions.
// Phase 1: matrix 1899 rows 1308 cols
[2024-05-22 23:36:00] [INFO ] Computed 199 invariants in 19 ms
[2024-05-22 23:36:02] [INFO ] Implicit Places using invariants in 1717 ms returned [18, 207, 212, 390, 395, 573, 578, 756, 761, 924, 940, 945, 946, 964, 1110, 1126, 1131, 1132, 1150, 1171, 1172, 1189, 1197, 1205, 1211, 1217, 1223, 1229, 1237, 1243, 1249, 1257]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1720 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1276/1319 places, 1899/1987 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1263 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1263 transition count 1886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1253 transition count 1876
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1253 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1248 transition count 1871
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1248 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1246 transition count 1869
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1246 transition count 1869
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1244 transition count 1867
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1244 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1243 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1243 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1242 transition count 1865
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1242 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1241 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1241 transition count 1864
Applied a total of 70 rules in 669 ms. Remains 1241 /1276 variables (removed 35) and now considering 1864/1899 (removed 35) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-05-22 23:36:03] [INFO ] Computed 167 invariants in 17 ms
[2024-05-22 23:36:04] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-05-22 23:36:04] [INFO ] Invariant cache hit.
[2024-05-22 23:36:08] [INFO ] Implicit Places using invariants and state equation in 3865 ms returned []
Implicit Place search using SMT with State Equation took 4891 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1241/1319 places, 1864/1987 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8144 ms. Remains : 1241/1319 places, 1864/1987 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s964 0) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-15 finished in 8241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F(G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ASLink-PT-06a-LTLCardinality-02
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1319 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1319/1319 places, 1987/1987 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1319 transition count 1752
Reduce places removed 235 places and 0 transitions.
Iterating post reduction 1 with 235 rules applied. Total rules applied 470 place count 1084 transition count 1752
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 470 place count 1084 transition count 1626
Deduced a syphon composed of 126 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 774 place count 906 transition count 1626
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 775 place count 906 transition count 1625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 776 place count 905 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 777 place count 904 transition count 1617
Iterating global reduction 4 with 1 rules applied. Total rules applied 778 place count 904 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 779 place count 903 transition count 1609
Iterating global reduction 4 with 1 rules applied. Total rules applied 780 place count 903 transition count 1609
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 781 place count 902 transition count 1601
Iterating global reduction 4 with 1 rules applied. Total rules applied 782 place count 902 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 783 place count 901 transition count 1593
Iterating global reduction 4 with 1 rules applied. Total rules applied 784 place count 901 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 785 place count 900 transition count 1585
Iterating global reduction 4 with 1 rules applied. Total rules applied 786 place count 900 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 787 place count 899 transition count 1577
Iterating global reduction 4 with 1 rules applied. Total rules applied 788 place count 899 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 789 place count 898 transition count 1569
Iterating global reduction 4 with 1 rules applied. Total rules applied 790 place count 898 transition count 1569
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 791 place count 897 transition count 1561
Iterating global reduction 4 with 1 rules applied. Total rules applied 792 place count 897 transition count 1561
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 793 place count 896 transition count 1553
Iterating global reduction 4 with 1 rules applied. Total rules applied 794 place count 896 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 795 place count 895 transition count 1545
Iterating global reduction 4 with 1 rules applied. Total rules applied 796 place count 895 transition count 1545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 797 place count 894 transition count 1537
Iterating global reduction 4 with 1 rules applied. Total rules applied 798 place count 894 transition count 1537
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 936 place count 825 transition count 1468
Applied a total of 936 rules in 538 ms. Remains 825 /1319 variables (removed 494) and now considering 1468/1987 (removed 519) transitions.
// Phase 1: matrix 1468 rows 825 cols
[2024-05-22 23:36:08] [INFO ] Computed 147 invariants in 24 ms
[2024-05-22 23:36:10] [INFO ] Implicit Places using invariants in 1564 ms returned [18, 128, 129, 130, 235, 236, 237, 342, 343, 344, 454, 455, 456, 570, 571, 572, 573, 591, 676, 690, 691, 692, 693, 711, 732, 733, 744, 749, 754, 759, 764, 769, 774, 779, 784, 789, 794]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1567 ms to find 37 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 788/1319 places, 1468/1987 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 788 transition count 1440
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 760 transition count 1440
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 56 place count 760 transition count 1391
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 155 place count 710 transition count 1391
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 18 rules applied. Total rules applied 173 place count 700 transition count 1383
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 692 transition count 1383
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 677 transition count 1368
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 677 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 677 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 677 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 676 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 673 transition count 1361
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 673 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 672 transition count 1360
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 672 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 671 transition count 1359
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 671 transition count 1359
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 280 place count 644 transition count 1332
Applied a total of 280 rules in 233 ms. Remains 644 /788 variables (removed 144) and now considering 1332/1468 (removed 136) transitions.
// Phase 1: matrix 1332 rows 644 cols
[2024-05-22 23:36:10] [INFO ] Computed 99 invariants in 21 ms
[2024-05-22 23:36:11] [INFO ] Implicit Places using invariants in 1218 ms returned [89, 95, 100, 102, 105, 182, 188, 193, 195, 198, 275, 281, 286, 288, 291, 369, 375, 381, 383, 386, 466, 472, 477, 479, 483, 560, 566, 571, 573, 576, 641]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1220 ms to find 31 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 613/1319 places, 1332/1987 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 613 transition count 1325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 606 transition count 1325
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 31 place count 589 transition count 1308
Iterating global reduction 2 with 17 rules applied. Total rules applied 48 place count 589 transition count 1308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 589 transition count 1302
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 65 place count 578 transition count 1291
Iterating global reduction 3 with 11 rules applied. Total rules applied 76 place count 578 transition count 1291
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 572 transition count 1285
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 572 transition count 1285
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 102 place count 565 transition count 1278
Applied a total of 102 rules in 152 ms. Remains 565 /613 variables (removed 48) and now considering 1278/1332 (removed 54) transitions.
// Phase 1: matrix 1278 rows 565 cols
[2024-05-22 23:36:12] [INFO ] Computed 68 invariants in 19 ms
[2024-05-22 23:36:13] [INFO ] Implicit Places using invariants in 1006 ms returned [72, 151, 231, 311, 398, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 559/1319 places, 1278/1987 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 553 transition count 1272
Applied a total of 12 rules in 56 ms. Remains 553 /559 variables (removed 6) and now considering 1272/1278 (removed 6) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:36:13] [INFO ] Computed 62 invariants in 19 ms
[2024-05-22 23:36:14] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-22 23:36:14] [INFO ] Invariant cache hit.
[2024-05-22 23:36:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:16] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 4 : 553/1319 places, 1272/1987 transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 8280 ms. Remains : 553/1319 places, 1272/1987 transitions.
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s316 0) (EQ s323 1) (EQ s544 0) (EQ s409 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1287 reset in 243 ms.
Product exploration explored 100000 steps with 1351 reset in 331 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308213 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308213 steps, saw 95782 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:36:20] [INFO ] Invariant cache hit.
[2024-05-22 23:36:20] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:36:20] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 27 ms returned sat
[2024-05-22 23:36:21] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:22] [INFO ] After 866ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:22] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-22 23:36:22] [INFO ] After 2163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 87 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 512/553 places, 1225/1272 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264327 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264327 steps, saw 177574 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 512 cols
[2024-05-22 23:36:25] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:36:26] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-22 23:36:26] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 36 ms returned sat
[2024-05-22 23:36:27] [INFO ] After 1537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:29] [INFO ] After 1470ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:29] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 1 ms to minimize.
[2024-05-22 23:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2024-05-22 23:36:29] [INFO ] After 1978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-22 23:36:29] [INFO ] After 3755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 24 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 24 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:36:29] [INFO ] Invariant cache hit.
[2024-05-22 23:36:30] [INFO ] Implicit Places using invariants in 727 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 729 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 25 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 779 ms. Remains : 504/512 places, 1225/1225 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282680 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282680 steps, saw 185055 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 504 cols
[2024-05-22 23:36:33] [INFO ] Computed 54 invariants in 18 ms
[2024-05-22 23:36:33] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-22 23:36:34] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 39 ms returned sat
[2024-05-22 23:36:36] [INFO ] After 2113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:36] [INFO ] After 244ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:36] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 23:36:36] [INFO ] After 2675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 26 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:36:36] [INFO ] Invariant cache hit.
[2024-05-22 23:36:37] [INFO ] Implicit Places using invariants in 893 ms returned []
[2024-05-22 23:36:37] [INFO ] Invariant cache hit.
[2024-05-22 23:36:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:39] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2961 ms to find 0 implicit places.
[2024-05-22 23:36:39] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-22 23:36:39] [INFO ] Invariant cache hit.
[2024-05-22 23:36:40] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4359 ms. Remains : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 30 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:36:40] [INFO ] Invariant cache hit.
[2024-05-22 23:36:41] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 23:36:41] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned sat
[2024-05-22 23:36:42] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:42] [INFO ] After 1075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 23:36:42] [INFO ] After 1306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 34 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:36:42] [INFO ] Computed 62 invariants in 19 ms
[2024-05-22 23:36:43] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-22 23:36:43] [INFO ] Invariant cache hit.
[2024-05-22 23:36:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:45] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
[2024-05-22 23:36:46] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-22 23:36:46] [INFO ] Invariant cache hit.
[2024-05-22 23:36:47] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4692 ms. Remains : 553/553 places, 1272/1272 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308622 steps, run timeout after 3004 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308622 steps, saw 95925 distinct states, run finished after 3005 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:36:50] [INFO ] Invariant cache hit.
[2024-05-22 23:36:50] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:36:50] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 41 ms returned sat
[2024-05-22 23:36:51] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:52] [INFO ] After 893ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:52] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-22 23:36:52] [INFO ] After 2314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 83 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 512/553 places, 1225/1272 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276698 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276698 steps, saw 183196 distinct states, run finished after 3003 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 512 cols
[2024-05-22 23:36:56] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:36:56] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:36:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 23:36:56] [INFO ] [Nat]Absence check using 11 positive and 51 generalized place invariants in 26 ms returned sat
[2024-05-22 23:36:57] [INFO ] After 1473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:36:59] [INFO ] After 1451ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:36:59] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2024-05-22 23:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-05-22 23:36:59] [INFO ] After 1876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-22 23:36:59] [INFO ] After 3548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 33 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 32 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants in 858 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 859 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 18 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 911 ms. Remains : 504/512 places, 1225/1225 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308873 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308873 steps, saw 195331 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1225 rows 504 cols
[2024-05-22 23:37:03] [INFO ] Computed 54 invariants in 11 ms
[2024-05-22 23:37:03] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:37:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 23:37:03] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 22 ms returned sat
[2024-05-22 23:37:06] [INFO ] After 2114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:37:06] [INFO ] After 367ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:06] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 23:37:06] [INFO ] After 2790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 32 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 31 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-22 23:37:06] [INFO ] Invariant cache hit.
[2024-05-22 23:37:07] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-22 23:37:07] [INFO ] Invariant cache hit.
[2024-05-22 23:37:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:37:09] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2999 ms to find 0 implicit places.
[2024-05-22 23:37:09] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-22 23:37:09] [INFO ] Invariant cache hit.
[2024-05-22 23:37:10] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4085 ms. Remains : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 31 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 23:37:10] [INFO ] Invariant cache hit.
[2024-05-22 23:37:10] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:37:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 23:37:11] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned sat
[2024-05-22 23:37:11] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:37:11] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 23:37:12] [INFO ] After 1151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1287 reset in 384 ms.
Product exploration explored 100000 steps with 1312 reset in 413 ms.
Built C files in :
/tmp/ltsmin12912294905445294443
[2024-05-22 23:37:13] [INFO ] Computing symmetric may disable matrix : 1272 transitions.
[2024-05-22 23:37:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:13] [INFO ] Computing symmetric may enable matrix : 1272 transitions.
[2024-05-22 23:37:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:13] [INFO ] Computing Do-Not-Accords matrix : 1272 transitions.
[2024-05-22 23:37:13] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:13] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12912294905445294443
Running compilation step : cd /tmp/ltsmin12912294905445294443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12912294905445294443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12912294905445294443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 21 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-05-22 23:37:16] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 23:37:17] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-22 23:37:17] [INFO ] Invariant cache hit.
[2024-05-22 23:37:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 23:37:19] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
[2024-05-22 23:37:19] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-22 23:37:19] [INFO ] Invariant cache hit.
[2024-05-22 23:37:20] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4064 ms. Remains : 553/553 places, 1272/1272 transitions.
Built C files in :
/tmp/ltsmin6970831251165343171
[2024-05-22 23:37:20] [INFO ] Computing symmetric may disable matrix : 1272 transitions.
[2024-05-22 23:37:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:20] [INFO ] Computing symmetric may enable matrix : 1272 transitions.
[2024-05-22 23:37:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:20] [INFO ] Computing Do-Not-Accords matrix : 1272 transitions.
[2024-05-22 23:37:20] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:37:20] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6970831251165343171
Running compilation step : cd /tmp/ltsmin6970831251165343171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6970831251165343171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6970831251165343171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:37:24] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:37:24] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:37:24] [INFO ] Time to serialize gal into /tmp/LTL12415495257873511238.gal : 6 ms
[2024-05-22 23:37:24] [INFO ] Time to serialize properties into /tmp/LTL12589215869507865460.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12415495257873511238.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11872184035302108551.hoa' '-atoms' '/tmp/LTL12589215869507865460.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12589215869507865460.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11872184035302108551.hoa
Detected timeout of ITS tools.
[2024-05-22 23:37:39] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:37:39] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:37:39] [INFO ] Time to serialize gal into /tmp/LTL15890525180664333059.gal : 6 ms
[2024-05-22 23:37:39] [INFO ] Time to serialize properties into /tmp/LTL1410399371103615340.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15890525180664333059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1410399371103615340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p712==0)||(p754==1))||((p1310==0)||(p983==1)))"))))
Formula 0 simplified : XF!"(((p712==0)||(p754==1))||((p1310==0)||(p983==1)))"
Detected timeout of ITS tools.
[2024-05-22 23:37:54] [INFO ] Flatten gal took : 37 ms
[2024-05-22 23:37:54] [INFO ] Applying decomposition
[2024-05-22 23:37:54] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph943350015605709742.txt' '-o' '/tmp/graph943350015605709742.bin' '-w' '/tmp/graph943350015605709742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph943350015605709742.bin' '-l' '-1' '-v' '-w' '/tmp/graph943350015605709742.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:37:54] [INFO ] Decomposing Gal with order
[2024-05-22 23:37:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:37:54] [INFO ] Removed a total of 2558 redundant transitions.
[2024-05-22 23:37:54] [INFO ] Flatten gal took : 76 ms
[2024-05-22 23:37:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 17 ms.
[2024-05-22 23:37:54] [INFO ] Time to serialize gal into /tmp/LTL5565449850081823962.gal : 10 ms
[2024-05-22 23:37:54] [INFO ] Time to serialize properties into /tmp/LTL5524022612786096597.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5565449850081823962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5524022612786096597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i5.u80.p712==0)||(i5.u81.p754==1))||((i11.u141.p1310==0)||(i5.u102.p983==1)))"))))
Formula 0 simplified : XF!"(((i5.u80.p712==0)||(i5.u81.p754==1))||((i11.u141.p1310==0)||(i5.u102.p983==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17600445806799763739
[2024-05-22 23:38:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17600445806799763739
Running compilation step : cd /tmp/ltsmin17600445806799763739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17600445806799763739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17600445806799763739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06a-LTLCardinality-02 finished in 124454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-22 23:38:13] [INFO ] Flatten gal took : 91 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17609065586961642532
[2024-05-22 23:38:13] [INFO ] Too many transitions (1987) to apply POR reductions. Disabling POR matrices.
[2024-05-22 23:38:13] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17609065586961642532
Running compilation step : cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 23:38:13] [INFO ] Applying decomposition
[2024-05-22 23:38:13] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10103932056519206574.txt' '-o' '/tmp/graph10103932056519206574.bin' '-w' '/tmp/graph10103932056519206574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10103932056519206574.bin' '-l' '-1' '-v' '-w' '/tmp/graph10103932056519206574.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:38:13] [INFO ] Decomposing Gal with order
[2024-05-22 23:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:38:13] [INFO ] Removed a total of 2777 redundant transitions.
[2024-05-22 23:38:13] [INFO ] Flatten gal took : 107 ms
[2024-05-22 23:38:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 25 ms.
[2024-05-22 23:38:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality16481743423623053736.gal : 17 ms
[2024-05-22 23:38:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality741212023647338709.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16481743423623053736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality741212023647338709.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !(((G(("((i7.u210.p713==0)||(i9.u202.p694==1))")U("((i8.u227.p771==0)||(i12.u240.p829==1))")))&&(F(G("((i1.u10.p28==0)||(i2.u132.p463=...165
Formula 0 simplified : F((!"((i7.u210.p713==0)||(i9.u202.p694==1))" R !"((i8.u227.p771==0)||(i12.u240.p829==1))") | GF!"((i1.u10.p28==0)||(i2.u132.p463==1)...158
Compilation finished in 6989 ms.
Running link step : cd /tmp/ltsmin17609065586961642532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](((LTLAPp0==true) U (LTLAPp1==true)))&&<>([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](((LTLAPp0==true) U (LTLAPp1==true)))&&<>([]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 00:03:52] [INFO ] Applying decomposition
[2024-05-23 00:03:52] [INFO ] Flatten gal took : 182 ms
[2024-05-23 00:03:52] [INFO ] Decomposing Gal with order
[2024-05-23 00:03:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:03:53] [INFO ] Removed a total of 2348 redundant transitions.
[2024-05-23 00:03:53] [INFO ] Flatten gal took : 363 ms
[2024-05-23 00:03:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 849 labels/synchronizations in 193 ms.
[2024-05-23 00:03:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality16939096153079285405.gal : 29 ms
[2024-05-23 00:03:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality11051630023934551420.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16939096153079285405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11051630023934551420.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !(((G(("((i33.u118.p713==0)||(i33.i1.u276.p694==1))")U("((i33.i7.u132.p771==0)||(u144.p829==1))")))&&(F(G("((u3.p28==0)||(u76.p463==1)...162
Formula 0 simplified : F((!"((i33.u118.p713==0)||(i33.i1.u276.p694==1))" R !"((i33.i7.u132.p771==0)||(u144.p829==1))") | GF!"((u3.p28==0)||(u76.p463==1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17609065586961642532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp4==true))&&X(<>((LTLAPp5==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10210448 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16017344 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-06a, 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 r021-smll-171620127800057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a 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 ;