Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418500476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DoubleExponent-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 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 DoubleExponent-PT-010-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678870543931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 08:55:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 08:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:55:47] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-15 08:55:47] [INFO ] Transformed 534 places.
[2023-03-15 08:55:47] [INFO ] Transformed 498 transitions.
[2023-03-15 08:55:47] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 98 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2023-03-15 08:55:48] [INFO ] Computed 51 place invariants in 96 ms
[2023-03-15 08:55:48] [INFO ] Implicit Places using invariants in 646 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 698 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 527 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 527 transition count 497
Applied a total of 2 rules in 164 ms. Remains 527 /528 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 08:55:48] [INFO ] Computed 49 place invariants in 43 ms
[2023-03-15 08:55:49] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-15 08:55:49] [INFO ] Invariant cache hit.
[2023-03-15 08:55:52] [INFO ] Implicit Places using invariants and state equation in 2824 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 527/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4271 ms. Remains : 527/534 places, 497/498 transitions.
Support contains 33 out of 527 places after structural reductions.
[2023-03-15 08:55:52] [INFO ] Flatten gal took : 164 ms
[2023-03-15 08:55:52] [INFO ] Flatten gal took : 65 ms
[2023-03-15 08:55:53] [INFO ] Input system was already deterministic with 497 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 107963 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{6=1, 11=1, 14=1, 17=1}
Probabilistic random walk after 107963 steps, saw 53988 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :4
Running SMT prover for 16 properties.
[2023-03-15 08:55:57] [INFO ] Invariant cache hit.
[2023-03-15 08:55:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:55:57] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 39 ms returned sat
[2023-03-15 08:55:58] [INFO ] After 999ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:14
[2023-03-15 08:55:58] [INFO ] After 1227ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-15 08:55:58] [INFO ] After 1902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-15 08:55:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:55:59] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 64 ms returned sat
[2023-03-15 08:56:00] [INFO ] After 1226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-15 08:56:01] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 12 ms to minimize.
[2023-03-15 08:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-15 08:56:02] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 1 ms to minimize.
[2023-03-15 08:56:02] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 1 ms to minimize.
[2023-03-15 08:56:02] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 1 ms to minimize.
[2023-03-15 08:56:02] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 1 ms to minimize.
[2023-03-15 08:56:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 908 ms
[2023-03-15 08:56:03] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 0 ms to minimize.
[2023-03-15 08:56:03] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 1 ms to minimize.
[2023-03-15 08:56:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-15 08:56:04] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 1 ms to minimize.
[2023-03-15 08:56:04] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 1 ms to minimize.
[2023-03-15 08:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2023-03-15 08:56:04] [INFO ] After 4850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1131 ms.
[2023-03-15 08:56:05] [INFO ] After 6682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 10225 ms.
Support contains 25 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 525 transition count 403
Reduce places removed 92 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 197 place count 433 transition count 392
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 422 transition count 392
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 208 place count 422 transition count 366
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 260 place count 396 transition count 366
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 3 with 148 rules applied. Total rules applied 408 place count 322 transition count 292
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 440 place count 306 transition count 292
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 306 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 444 place count 304 transition count 290
Free-agglomeration rule (complex) applied 49 times.
Iterating global reduction 4 with 49 rules applied. Total rules applied 493 place count 304 transition count 241
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 542 place count 255 transition count 241
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 579 place count 255 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 580 place count 254 transition count 240
Applied a total of 580 rules in 223 ms. Remains 254 /527 variables (removed 273) and now considering 240/497 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 254/527 places, 240/497 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 146805 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{0=1, 11=1}
Probabilistic random walk after 146805 steps, saw 73910 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :2
Running SMT prover for 14 properties.
// Phase 1: matrix 240 rows 254 cols
[2023-03-15 08:56:20] [INFO ] Computed 49 place invariants in 45 ms
[2023-03-15 08:56:20] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 08:56:20] [INFO ] [Real]Absence check using 6 positive and 43 generalized place invariants in 29 ms returned sat
[2023-03-15 08:56:20] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2023-03-15 08:56:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-15 08:56:21] [INFO ] After 235ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1 real:13
[2023-03-15 08:56:21] [INFO ] After 263ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:13
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 08:56:21] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 08:56:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-15 08:56:21] [INFO ] [Nat]Absence check using 6 positive and 43 generalized place invariants in 30 ms returned sat
[2023-03-15 08:56:21] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 08:56:22] [INFO ] After 505ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-15 08:56:22] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 16 ms to minimize.
[2023-03-15 08:56:22] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 1 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 1 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 1 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2023-03-15 08:56:23] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:56:24] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 1 ms to minimize.
[2023-03-15 08:56:24] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 1 ms to minimize.
[2023-03-15 08:56:25] [INFO ] Deduced a trap composed of 55 places in 605 ms of which 1 ms to minimize.
[2023-03-15 08:56:25] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2023-03-15 08:56:25] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:56:25] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 1 ms to minimize.
[2023-03-15 08:56:25] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3650 ms
[2023-03-15 08:56:26] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-15 08:56:26] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 0 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 08:56:26] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-15 08:56:26] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2023-03-15 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-15 08:56:27] [INFO ] After 5411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-15 08:56:28] [INFO ] After 6891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 9431 ms.
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 240/240 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 252 transition count 238
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 252 transition count 238
Applied a total of 5 rules in 62 ms. Remains 252 /254 variables (removed 2) and now considering 238/240 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 252/254 places, 238/240 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 432828 steps, run timeout after 9001 ms. (steps per millisecond=48 ) properties seen :{1=1, 2=1, 11=1}
Probabilistic random walk after 432828 steps, saw 217156 distinct states, run finished after 9001 ms. (steps per millisecond=48 ) properties seen :3
Running SMT prover for 11 properties.
// Phase 1: matrix 238 rows 252 cols
[2023-03-15 08:56:49] [INFO ] Computed 49 place invariants in 47 ms
[2023-03-15 08:56:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:56:50] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-15 08:56:50] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 08:56:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:56:50] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-15 08:56:50] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-15 08:56:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 08:56:51] [INFO ] After 440ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-15 08:56:51] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:56:51] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 4 ms to minimize.
[2023-03-15 08:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2023-03-15 08:56:52] [INFO ] After 1199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-15 08:56:52] [INFO ] After 2192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 9392 ms.
Support contains 19 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 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 252 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 249 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 249 transition count 235
Applied a total of 7 rules in 36 ms. Remains 249 /252 variables (removed 3) and now considering 235/238 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 249/252 places, 235/238 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 320171 steps, run timeout after 6001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 320171 steps, saw 160823 distinct states, run finished after 6002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 235 rows 249 cols
[2023-03-15 08:57:10] [INFO ] Computed 49 place invariants in 18 ms
[2023-03-15 08:57:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:57:10] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-15 08:57:10] [INFO ] After 256ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-15 08:57:10] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 08:57:11] [INFO ] After 279ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 08:57:11] [INFO ] After 755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 08:57:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:57:11] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-15 08:57:11] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-15 08:57:12] [INFO ] After 704ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-15 08:57:12] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-15 08:57:12] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2023-03-15 08:57:12] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-15 08:57:13] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2023-03-15 08:57:13] [INFO ] Deduced a trap composed of 81 places in 214 ms of which 1 ms to minimize.
[2023-03-15 08:57:13] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 1 ms to minimize.
[2023-03-15 08:57:13] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 0 ms to minimize.
[2023-03-15 08:57:14] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 0 ms to minimize.
[2023-03-15 08:57:14] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 0 ms to minimize.
[2023-03-15 08:57:14] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 5 ms to minimize.
[2023-03-15 08:57:14] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 0 ms to minimize.
[2023-03-15 08:57:14] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 1 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 2 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 1 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2023-03-15 08:57:15] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 0 ms to minimize.
[2023-03-15 08:57:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2831 ms
[2023-03-15 08:57:16] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 1 ms to minimize.
[2023-03-15 08:57:16] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 16 ms to minimize.
[2023-03-15 08:57:16] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 1 ms to minimize.
[2023-03-15 08:57:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2023-03-15 08:57:16] [INFO ] After 5004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-15 08:57:17] [INFO ] After 6153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 7568 ms.
Support contains 19 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 12 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 249/249 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 10 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2023-03-15 08:57:24] [INFO ] Invariant cache hit.
[2023-03-15 08:57:25] [INFO ] Implicit Places using invariants in 664 ms returned [21, 27, 49, 57, 80, 86, 107, 114, 136, 142, 143, 165, 171, 193, 199, 206, 240, 246]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 667 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/249 places, 235/235 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 231 transition count 229
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 225 transition count 229
Applied a total of 13 rules in 27 ms. Remains 225 /231 variables (removed 6) and now considering 229/235 (removed 6) transitions.
// Phase 1: matrix 229 rows 225 cols
[2023-03-15 08:57:25] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-15 08:57:25] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-15 08:57:25] [INFO ] Invariant cache hit.
[2023-03-15 08:57:25] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 08:57:27] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/249 places, 229/235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2249 ms. Remains : 225/249 places, 229/235 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 197790 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197790 steps, saw 98908 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-15 08:57:31] [INFO ] Invariant cache hit.
[2023-03-15 08:57:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:57:31] [INFO ] [Real]Absence check using 2 positive and 29 generalized place invariants in 35 ms returned sat
[2023-03-15 08:57:31] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 08:57:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:57:31] [INFO ] [Nat]Absence check using 2 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-15 08:57:32] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-15 08:57:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 08:57:32] [INFO ] After 579ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-15 08:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 0 ms to minimize.
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-15 08:57:33] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 1 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 1 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 12 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2023-03-15 08:57:34] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 1 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 0 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 0 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 1 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 1 ms to minimize.
[2023-03-15 08:57:35] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 0 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 0 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2023-03-15 08:57:36] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2023-03-15 08:57:37] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 1 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 0 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 0 ms to minimize.
[2023-03-15 08:57:38] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 1 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 0 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 1 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 0 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:57:39] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 0 ms to minimize.
[2023-03-15 08:57:40] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2023-03-15 08:57:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-15 08:57:40] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 6890 ms
[2023-03-15 08:57:40] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 1 ms to minimize.
[2023-03-15 08:57:40] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 0 ms to minimize.
[2023-03-15 08:57:40] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 1 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 1 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 1 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 0 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 0 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 0 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 1 ms to minimize.
[2023-03-15 08:57:41] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 0 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 1 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 1 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 1 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 1 ms to minimize.
[2023-03-15 08:57:42] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 0 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 0 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 1 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 1 ms to minimize.
[2023-03-15 08:57:43] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 0 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 0 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 0 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 1 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 0 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 1 ms to minimize.
[2023-03-15 08:57:44] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 1 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 0 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 0 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 0 ms to minimize.
[2023-03-15 08:57:45] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 0 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 0 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 0 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 1 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 0 ms to minimize.
[2023-03-15 08:57:46] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 7 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 1 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 0 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 1 ms to minimize.
[2023-03-15 08:57:47] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 0 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 0 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 1 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2023-03-15 08:57:48] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 0 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 0 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 1 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 1 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2023-03-15 08:57:49] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2023-03-15 08:57:50] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 1 ms to minimize.
[2023-03-15 08:57:50] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 1 ms to minimize.
[2023-03-15 08:57:50] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 1 ms to minimize.
[2023-03-15 08:57:50] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2023-03-15 08:57:50] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 10433 ms
[2023-03-15 08:57:51] [INFO ] After 19100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1258 ms.
[2023-03-15 08:57:52] [INFO ] After 21015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 5848 ms.
Support contains 19 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 229/229 transitions.
Applied a total of 0 rules in 9 ms. Remains 225 /225 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 225/225 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 229/229 transitions.
Applied a total of 0 rules in 7 ms. Remains 225 /225 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2023-03-15 08:57:58] [INFO ] Invariant cache hit.
[2023-03-15 08:57:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-15 08:57:58] [INFO ] Invariant cache hit.
[2023-03-15 08:57:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 08:58:00] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-03-15 08:58:00] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 08:58:00] [INFO ] Invariant cache hit.
[2023-03-15 08:58:00] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 225/225 places, 229/229 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 88 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-15 08:58:00] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 08:58:01] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-15 08:58:01] [INFO ] Invariant cache hit.
[2023-03-15 08:58:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:58:02] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2023-03-15 08:58:02] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 08:58:02] [INFO ] Invariant cache hit.
[2023-03-15 08:58:02] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2260 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-00 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:(GEQ s29 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-00 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 245 place count 403 transition count 354
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 503 place count 274 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 260
Applied a total of 504 rules in 77 ms. Remains 273 /527 variables (removed 254) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 273 cols
[2023-03-15 08:58:03] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-15 08:58:03] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-15 08:58:03] [INFO ] Invariant cache hit.
[2023-03-15 08:58:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:58:05] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2023-03-15 08:58:05] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 08:58:05] [INFO ] Invariant cache hit.
[2023-03-15 08:58:05] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2344 ms. Remains : 273/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9739 reset in 389 ms.
Product exploration explored 100000 steps with 9741 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
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 251 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 16 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-15 08:58:07] [INFO ] Invariant cache hit.
[2023-03-15 08:58:07] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-15 08:58:07] [INFO ] Invariant cache hit.
[2023-03-15 08:58:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:58:08] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2023-03-15 08:58:08] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 08:58:08] [INFO ] Invariant cache hit.
[2023-03-15 08:58:09] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2324 ms. Remains : 273/273 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
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 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9756 reset in 119 ms.
Product exploration explored 100000 steps with 9617 reset in 249 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-15 08:58:10] [INFO ] Invariant cache hit.
[2023-03-15 08:58:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-15 08:58:10] [INFO ] Invariant cache hit.
[2023-03-15 08:58:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:58:12] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-15 08:58:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 08:58:12] [INFO ] Invariant cache hit.
[2023-03-15 08:58:12] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2193 ms. Remains : 273/273 places, 260/260 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-01 finished in 9353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (p1 U p2)))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 65 ms. Remains 277 /527 variables (removed 250) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2023-03-15 08:58:12] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 08:58:13] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-15 08:58:13] [INFO ] Invariant cache hit.
[2023-03-15 08:58:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 08:58:14] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-15 08:58:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:58:14] [INFO ] Invariant cache hit.
[2023-03-15 08:58:14] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/527 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2250 ms. Remains : 277/527 places, 264/497 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s41 1) (GEQ s48 1)), p0:(AND (GEQ s40 1) (GEQ s59 1)), p1:(GEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 114 steps with 14 reset in 2 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-02 finished in 2517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 15 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 08:58:15] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-15 08:58:15] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-15 08:58:15] [INFO ] Invariant cache hit.
[2023-03-15 08:58:18] [INFO ] Implicit Places using invariants and state equation in 3362 ms returned []
Implicit Place search using SMT with State Equation took 3726 ms to find 0 implicit places.
[2023-03-15 08:58:18] [INFO ] Invariant cache hit.
[2023-03-15 08:58:19] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4126 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s72 1) (GEQ s107 1)), p0:(AND (GEQ s426 1) (GEQ s445 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-06 finished in 4477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p0))))))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 14 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-15 08:58:19] [INFO ] Invariant cache hit.
[2023-03-15 08:58:19] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-15 08:58:19] [INFO ] Invariant cache hit.
[2023-03-15 08:58:22] [INFO ] Implicit Places using invariants and state equation in 2863 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
[2023-03-15 08:58:22] [INFO ] Invariant cache hit.
[2023-03-15 08:58:23] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3604 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s345 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 545 ms.
Product exploration explored 100000 steps with 33333 reset in 510 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLFireability-07 finished in 4977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 14 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-15 08:58:24] [INFO ] Invariant cache hit.
[2023-03-15 08:58:24] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-15 08:58:24] [INFO ] Invariant cache hit.
[2023-03-15 08:58:27] [INFO ] Implicit Places using invariants and state equation in 2875 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
[2023-03-15 08:58:27] [INFO ] Invariant cache hit.
[2023-03-15 08:58:28] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3569 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-09 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 (GEQ s480 1) (GEQ s520 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 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-09 finished in 3692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p0 U (p1||G(!p0))))) U G(p2))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 24 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-15 08:58:28] [INFO ] Invariant cache hit.
[2023-03-15 08:58:28] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-15 08:58:28] [INFO ] Invariant cache hit.
[2023-03-15 08:58:31] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
[2023-03-15 08:58:31] [INFO ] Invariant cache hit.
[2023-03-15 08:58:31] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s108 1), p1:(AND (NOT (AND (GEQ s368 1) (GEQ s388 1))) (NOT (AND (GEQ s186 1) (GEQ s292 1)))), p0:(AND (GEQ s186 1) (GEQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25053 reset in 358 ms.
Product exploration explored 100000 steps with 25054 reset in 364 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 340 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 112107 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112107 steps, saw 56066 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-15 08:58:36] [INFO ] Invariant cache hit.
[2023-03-15 08:58:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:37] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-15 08:58:37] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-15 08:58:37] [INFO ] After 434ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 08:58:37] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:3
[2023-03-15 08:58:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:37] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-15 08:58:38] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 08:58:38] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 1 ms to minimize.
[2023-03-15 08:58:38] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 1 ms to minimize.
[2023-03-15 08:58:39] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 0 ms to minimize.
[2023-03-15 08:58:39] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 1 ms to minimize.
[2023-03-15 08:58:39] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 0 ms to minimize.
[2023-03-15 08:58:39] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 0 ms to minimize.
[2023-03-15 08:58:39] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 1 ms to minimize.
[2023-03-15 08:58:40] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 0 ms to minimize.
[2023-03-15 08:58:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1556 ms
[2023-03-15 08:58:40] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 0 ms to minimize.
[2023-03-15 08:58:40] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 1 ms to minimize.
[2023-03-15 08:58:40] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 1 ms to minimize.
[2023-03-15 08:58:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 684 ms
[2023-03-15 08:58:41] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 0 ms to minimize.
[2023-03-15 08:58:41] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 0 ms to minimize.
[2023-03-15 08:58:41] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2023-03-15 08:58:41] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 0 ms to minimize.
[2023-03-15 08:58:41] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 2 ms to minimize.
[2023-03-15 08:58:42] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 0 ms to minimize.
[2023-03-15 08:58:42] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 0 ms to minimize.
[2023-03-15 08:58:42] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 1 ms to minimize.
[2023-03-15 08:58:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1558 ms
[2023-03-15 08:58:42] [INFO ] After 4984ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 592 ms.
[2023-03-15 08:58:43] [INFO ] After 5792ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 847 ms.
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 233 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 236 place count 408 transition count 356
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 280 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 458 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 492 place count 280 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 279 transition count 266
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 536 place count 279 transition count 224
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 578 place count 237 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 618 place count 237 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 619 place count 236 transition count 223
Applied a total of 619 rules in 63 ms. Remains 236 /527 variables (removed 291) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 236/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 233460 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233460 steps, saw 116785 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 236 cols
[2023-03-15 08:58:47] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 08:58:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:58:47] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-15 08:58:48] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:58:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 08:58:48] [INFO ] After 123ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:58:48] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-15 08:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-15 08:58:48] [INFO ] After 293ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 08:58:48] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 08:58:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:58:48] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 23 ms returned sat
[2023-03-15 08:58:48] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 08:58:48] [INFO ] After 145ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-15 08:58:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 910 ms
[2023-03-15 08:58:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-15 08:58:50] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-03-15 08:58:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-15 08:58:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-03-15 08:58:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-15 08:58:50] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-15 08:58:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-03-15 08:58:50] [INFO ] After 1597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-15 08:58:50] [INFO ] After 2051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1718 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-15 08:58:52] [INFO ] Invariant cache hit.
[2023-03-15 08:58:52] [INFO ] Implicit Places using invariants in 557 ms returned [20, 26, 46, 52, 74, 79, 99, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 559 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 215
Applied a total of 16 rules in 15 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 210 cols
[2023-03-15 08:58:52] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-15 08:58:53] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-15 08:58:53] [INFO ] Invariant cache hit.
[2023-03-15 08:58:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 08:58:55] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/236 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2836 ms. Remains : 210/236 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 207944 steps, run timeout after 3002 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207944 steps, saw 103994 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 08:58:58] [INFO ] Invariant cache hit.
[2023-03-15 08:58:58] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-15 08:58:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 08:58:58] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:58:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 08:58:58] [INFO ] After 138ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:58:58] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 08:58:58] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:58:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 08:58:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 08:58:59] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 08:58:59] [INFO ] After 370ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 08:59:00] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-15 08:59:00] [INFO ] After 1179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1824 ms.
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 08:59:01] [INFO ] Invariant cache hit.
[2023-03-15 08:59:02] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-15 08:59:02] [INFO ] Invariant cache hit.
[2023-03-15 08:59:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 08:59:04] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2023-03-15 08:59:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:59:04] [INFO ] Invariant cache hit.
[2023-03-15 08:59:04] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2505 ms. Remains : 210/210 places, 215/215 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 194 transition count 199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 187 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 187 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 186 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 186 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 50 place count 185 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 185 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 183 transition count 188
Applied a total of 54 rules in 36 ms. Remains 183 /210 variables (removed 27) and now considering 188/215 (removed 27) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 188 rows 183 cols
[2023-03-15 08:59:04] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-15 08:59:04] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-15 08:59:04] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-15 08:59:04] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:59:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 08:59:04] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:59:04] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 08:59:04] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 08:59:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 08:59:04] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-15 08:59:05] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 08:59:05] [INFO ] After 183ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 332 ms
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-15 08:59:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 0 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 1 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 0 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 0 ms to minimize.
[2023-03-15 08:59:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 678 ms
[2023-03-15 08:59:06] [INFO ] After 1487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-15 08:59:06] [INFO ] After 1961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 386 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 08:59:07] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-15 08:59:07] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-15 08:59:07] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-15 08:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:59:11] [INFO ] [Real]Absence check using state equation in 3663 ms returned sat
[2023-03-15 08:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:59:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:59:11] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 32 ms returned sat
[2023-03-15 08:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:59:14] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2023-03-15 08:59:14] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 0 ms to minimize.
[2023-03-15 08:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 08:59:14] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-15 08:59:21] [INFO ] Added : 342 causal constraints over 69 iterations in 6817 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 527 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 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 235 place count 408 transition count 357
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 455 place count 298 transition count 268
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 489 place count 281 transition count 268
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 492 place count 281 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 267
Applied a total of 493 rules in 59 ms. Remains 280 /527 variables (removed 247) and now considering 267/497 (removed 230) transitions.
// Phase 1: matrix 267 rows 280 cols
[2023-03-15 08:59:21] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-15 08:59:22] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-15 08:59:22] [INFO ] Invariant cache hit.
[2023-03-15 08:59:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-15 08:59:23] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2023-03-15 08:59:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:59:23] [INFO ] Invariant cache hit.
[2023-03-15 08:59:23] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/527 places, 267/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2423 ms. Remains : 280/527 places, 267/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 845 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 494231 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494231 steps, saw 247185 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:59:27] [INFO ] Invariant cache hit.
[2023-03-15 08:59:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:59:27] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-15 08:59:27] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:59:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-15 08:59:27] [INFO ] After 37ms SMT Verify possible using 17 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:59:27] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-15 08:59:27] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 267/267 transitions.
Graph (complete) has 807 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 8 place count 279 transition count 260
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 273 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 272 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 55 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 92 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 131 place count 234 transition count 222
Applied a total of 131 rules in 55 ms. Remains 234 /280 variables (removed 46) and now considering 222/267 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 234/280 places, 222/267 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518890 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518890 steps, saw 259597 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-15 08:59:30] [INFO ] Computed 49 place invariants in 19 ms
[2023-03-15 08:59:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:59:30] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-15 08:59:30] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:59:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 08:59:30] [INFO ] After 66ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:59:30] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 08:59:31] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 11 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-15 08:59:31] [INFO ] Invariant cache hit.
[2023-03-15 08:59:31] [INFO ] Implicit Places using invariants in 657 ms returned [20, 26, 46, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 665 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 9 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-15 08:59:31] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-15 08:59:31] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-15 08:59:31] [INFO ] Invariant cache hit.
[2023-03-15 08:59:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 08:59:33] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2562 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568135 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568135 steps, saw 284126 distinct states, run finished after 3004 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:59:36] [INFO ] Invariant cache hit.
[2023-03-15 08:59:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 08:59:36] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-15 08:59:36] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:59:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 08:59:36] [INFO ] After 115ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:59:36] [INFO ] After 138ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 08:59:37] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-15 08:59:37] [INFO ] Invariant cache hit.
[2023-03-15 08:59:37] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-15 08:59:37] [INFO ] Invariant cache hit.
[2023-03-15 08:59:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 08:59:39] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2023-03-15 08:59:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:59:39] [INFO ] Invariant cache hit.
[2023-03-15 08:59:39] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2664 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 17 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-15 08:59:39] [INFO ] Computed 31 place invariants in 24 ms
[2023-03-15 08:59:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 08:59:39] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-15 08:59:40] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:59:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 08:59:40] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-15 08:59:40] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:59:40] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:59:40] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2023-03-15 08:59:40] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2023-03-15 08:59:40] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 0 ms to minimize.
[2023-03-15 08:59:41] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-15 08:59:41] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 1 ms to minimize.
[2023-03-15 08:59:41] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2023-03-15 08:59:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 841 ms
[2023-03-15 08:59:41] [INFO ] After 862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 08:59:41] [INFO ] After 1282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
// Phase 1: matrix 267 rows 280 cols
[2023-03-15 08:59:41] [INFO ] Computed 49 place invariants in 12 ms
[2023-03-15 08:59:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 08:59:41] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 49 ms returned sat
[2023-03-15 08:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:59:42] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-15 08:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:59:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:59:43] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-15 08:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:59:43] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2023-03-15 08:59:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-15 08:59:44] [INFO ] [Nat]Added 17 Read/Feed constraints in 232 ms returned sat
[2023-03-15 08:59:44] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-15 08:59:44] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:59:44] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2023-03-15 08:59:45] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-15 08:59:45] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-15 08:59:45] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2023-03-15 08:59:45] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-15 08:59:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1489 ms
[2023-03-15 08:59:45] [INFO ] Computed and/alt/rep : 266/967/266 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-15 08:59:48] [INFO ] Added : 210 causal constraints over 43 iterations in 2969 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-10 finished in 80338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 525 transition count 382
Reduce places removed 113 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 117 rules applied. Total rules applied 231 place count 412 transition count 378
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 457 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 491 place count 280 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 279 transition count 266
Applied a total of 492 rules in 45 ms. Remains 279 /527 variables (removed 248) and now considering 266/497 (removed 231) transitions.
// Phase 1: matrix 266 rows 279 cols
[2023-03-15 08:59:48] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-15 08:59:49] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-15 08:59:49] [INFO ] Invariant cache hit.
[2023-03-15 08:59:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 08:59:50] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-15 08:59:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:59:50] [INFO ] Invariant cache hit.
[2023-03-15 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/527 places, 266/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2144 ms. Remains : 279/527 places, 266/497 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s163 1) (GEQ s170 1)), p1:(AND (LT s16 1) (OR (LT s251 1) (LT s269 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-11 finished in 2289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 33 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-15 08:59:50] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 08:59:51] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-15 08:59:51] [INFO ] Invariant cache hit.
[2023-03-15 08:59:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:59:52] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
[2023-03-15 08:59:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 08:59:52] [INFO ] Invariant cache hit.
[2023-03-15 08:59:52] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2084 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13920 reset in 125 ms.
Product exploration explored 100000 steps with 13904 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1395 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 489164 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 489164 steps, saw 244658 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:59:56] [INFO ] Invariant cache hit.
[2023-03-15 08:59:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 08:59:56] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-15 08:59:56] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:59:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 08:59:56] [INFO ] After 65ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:59:56] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 08:59:56] [INFO ] After 426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 17 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 532820 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532820 steps, saw 266575 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-15 08:59:59] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 09:00:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:00] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-15 09:00:00] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:00] [INFO ] After 129ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:00] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:00] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-15 09:00:00] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:00] [INFO ] After 140ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:00] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 09:00:00] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-15 09:00:00] [INFO ] Invariant cache hit.
[2023-03-15 09:00:01] [INFO ] Implicit Places using invariants in 533 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 550 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 8 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-15 09:00:01] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-15 09:00:01] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-15 09:00:01] [INFO ] Invariant cache hit.
[2023-03-15 09:00:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:03] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2664 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1400 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568634 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568634 steps, saw 284375 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:00:06] [INFO ] Invariant cache hit.
[2023-03-15 09:00:06] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-15 09:00:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:00:06] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:06] [INFO ] After 119ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:06] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-15 09:00:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:00:07] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:07] [INFO ] After 98ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:07] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 09:00:07] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-15 09:00:07] [INFO ] Invariant cache hit.
[2023-03-15 09:00:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-15 09:00:07] [INFO ] Invariant cache hit.
[2023-03-15 09:00:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:09] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2023-03-15 09:00:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:09] [INFO ] Invariant cache hit.
[2023-03-15 09:00:09] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2181 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 14 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-15 09:00:09] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-15 09:00:09] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-15 09:00:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 09:00:09] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:00:09] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:09] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:00:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:00:10] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:10] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:10] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 09:00:10] [INFO ] After 254ms 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 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-15 09:00:10] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 09:00:10] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-15 09:00:10] [INFO ] Invariant cache hit.
[2023-03-15 09:00:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 09:00:12] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-15 09:00:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:12] [INFO ] Invariant cache hit.
[2023-03-15 09:00:12] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2034 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
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 183 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1383 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 485367 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485367 steps, saw 242757 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:00:15] [INFO ] Invariant cache hit.
[2023-03-15 09:00:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:00:15] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-15 09:00:16] [INFO ] After 211ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 09:00:16] [INFO ] After 66ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 09:00:16] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 09:00:16] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 14 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 532609 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532609 steps, saw 266474 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-15 09:00:19] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-15 09:00:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:19] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 23 ms returned sat
[2023-03-15 09:00:19] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:19] [INFO ] After 129ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:19] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:19] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-15 09:00:19] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:20] [INFO ] After 143ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:20] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 09:00:20] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-15 09:00:20] [INFO ] Invariant cache hit.
[2023-03-15 09:00:20] [INFO ] Implicit Places using invariants in 742 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 756 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-15 09:00:20] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-15 09:00:21] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-15 09:00:21] [INFO ] Invariant cache hit.
[2023-03-15 09:00:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:22] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2644 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 570791 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570791 steps, saw 285453 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:00:25] [INFO ] Invariant cache hit.
[2023-03-15 09:00:25] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-15 09:00:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:00:26] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:26] [INFO ] After 118ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:26] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-15 09:00:26] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:00:26] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:26] [INFO ] After 98ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:26] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 09:00:26] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-15 09:00:26] [INFO ] Invariant cache hit.
[2023-03-15 09:00:26] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-15 09:00:26] [INFO ] Invariant cache hit.
[2023-03-15 09:00:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:28] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2023-03-15 09:00:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:28] [INFO ] Invariant cache hit.
[2023-03-15 09:00:28] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2388 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 13 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-15 09:00:29] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-15 09:00:29] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 09:00:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-15 09:00:29] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:00:29] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:29] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 09:00:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-15 09:00:29] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:29] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:29] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 09:00:29] [INFO ] After 239ms 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 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13845 reset in 123 ms.
Product exploration explored 100000 steps with 13902 reset in 139 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-15 09:00:30] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-15 09:00:30] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-15 09:00:30] [INFO ] Invariant cache hit.
[2023-03-15 09:00:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 09:00:31] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2023-03-15 09:00:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:31] [INFO ] Invariant cache hit.
[2023-03-15 09:00:32] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2039 ms. Remains : 272/272 places, 260/260 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-12 finished in 41207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U (p1 U p2)) U p2))'
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 84 ms. Remains 274 /527 variables (removed 253) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2023-03-15 09:00:32] [INFO ] Computed 49 place invariants in 19 ms
[2023-03-15 09:00:32] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-15 09:00:32] [INFO ] Invariant cache hit.
[2023-03-15 09:00:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 09:00:34] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
[2023-03-15 09:00:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:34] [INFO ] Invariant cache hit.
[2023-03-15 09:00:34] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/527 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2270 ms. Remains : 274/527 places, 262/497 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s84 1), p0:(GEQ s17 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-13 finished in 2440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 32 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-15 09:00:34] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-15 09:00:34] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-15 09:00:34] [INFO ] Invariant cache hit.
[2023-03-15 09:00:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 09:00:36] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-15 09:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:00:36] [INFO ] Invariant cache hit.
[2023-03-15 09:00:36] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1999 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-14 finished in 2051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U X(!p2)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 09:00:36] [INFO ] Computed 49 place invariants in 22 ms
[2023-03-15 09:00:36] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-15 09:00:36] [INFO ] Invariant cache hit.
[2023-03-15 09:00:40] [INFO ] Implicit Places using invariants and state equation in 3114 ms returned []
Implicit Place search using SMT with State Equation took 3432 ms to find 0 implicit places.
[2023-03-15 09:00:40] [INFO ] Invariant cache hit.
[2023-03-15 09:00:40] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3826 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 629 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s309 1) (GEQ s355 1)), p1:(GEQ s24 1), p2:(AND (GEQ s128 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Product exploration explored 100000 steps with 25000 reset in 358 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 345370 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 345370 steps, saw 172718 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:00:45] [INFO ] Invariant cache hit.
[2023-03-15 09:00:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:45] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-15 09:00:45] [INFO ] After 554ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:00:46] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-15 09:00:46] [INFO ] After 821ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:46] [INFO ] After 964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:00:46] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-15 09:00:46] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:47] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 0 ms to minimize.
[2023-03-15 09:00:47] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 0 ms to minimize.
[2023-03-15 09:00:47] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 1 ms to minimize.
[2023-03-15 09:00:47] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:00:47] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 0 ms to minimize.
[2023-03-15 09:00:48] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2023-03-15 09:00:48] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:00:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1494 ms
[2023-03-15 09:00:48] [INFO ] After 2040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-15 09:00:48] [INFO ] After 2242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 45 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536286 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536286 steps, saw 268304 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-15 09:00:51] [INFO ] Computed 49 place invariants in 12 ms
[2023-03-15 09:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 09:00:51] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-15 09:00:51] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:00:51] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-15 09:00:52] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:52] [INFO ] After 159ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:52] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 09:00:52] [INFO ] After 509ms 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 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-15 09:00:52] [INFO ] Invariant cache hit.
[2023-03-15 09:00:52] [INFO ] Implicit Places using invariants in 527 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 546 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 7 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-15 09:00:52] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-15 09:00:53] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-15 09:00:53] [INFO ] Invariant cache hit.
[2023-03-15 09:00:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:54] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2661 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 569944 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569944 steps, saw 285054 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:00:58] [INFO ] Invariant cache hit.
[2023-03-15 09:00:58] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-15 09:00:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:00:58] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:00:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 09:00:58] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:00:58] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:00:58] [INFO ] After 80ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:00:58] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-15 09:00:58] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-15 09:00:58] [INFO ] After 492ms 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 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 09:00:58] [INFO ] Invariant cache hit.
[2023-03-15 09:00:59] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-15 09:00:59] [INFO ] Invariant cache hit.
[2023-03-15 09:00:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:01:00] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2023-03-15 09:01:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 09:01:00] [INFO ] Invariant cache hit.
[2023-03-15 09:01:00] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1871 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 15 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-15 09:01:00] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-15 09:01:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 09:01:00] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-15 09:01:00] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 09:01:00] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-15 09:01:01] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:01:01] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:01] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-15 09:01:01] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 09:01:01] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 198 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 12 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 09:01:02] [INFO ] Computed 49 place invariants in 22 ms
[2023-03-15 09:01:02] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-15 09:01:02] [INFO ] Invariant cache hit.
[2023-03-15 09:01:05] [INFO ] Implicit Places using invariants and state equation in 2966 ms returned []
Implicit Place search using SMT with State Equation took 3290 ms to find 0 implicit places.
[2023-03-15 09:01:05] [INFO ] Invariant cache hit.
[2023-03-15 09:01:05] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3683 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 331 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 345837 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 345837 steps, saw 172952 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:01:09] [INFO ] Invariant cache hit.
[2023-03-15 09:01:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:01:09] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-15 09:01:09] [INFO ] After 570ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:01:09] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 1 ms to minimize.
[2023-03-15 09:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-15 09:01:10] [INFO ] After 846ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:10] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:01:10] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-15 09:01:10] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:10] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 1 ms to minimize.
[2023-03-15 09:01:11] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:01:11] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 0 ms to minimize.
[2023-03-15 09:01:11] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:01:11] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:01:11] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:01:12] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 0 ms to minimize.
[2023-03-15 09:01:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1582 ms
[2023-03-15 09:01:12] [INFO ] After 2124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-15 09:01:12] [INFO ] After 2308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 40 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536681 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536681 steps, saw 268496 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-15 09:01:15] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-15 09:01:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:01:15] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-15 09:01:15] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:01:15] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-15 09:01:15] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:01:16] [INFO ] After 113ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:16] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-15 09:01:16] [INFO ] After 419ms 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 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-15 09:01:16] [INFO ] Invariant cache hit.
[2023-03-15 09:01:16] [INFO ] Implicit Places using invariants in 527 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 551 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 9 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-15 09:01:16] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-15 09:01:16] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-15 09:01:16] [INFO ] Invariant cache hit.
[2023-03-15 09:01:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:01:18] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2603 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568236 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568236 steps, saw 284200 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:01:21] [INFO ] Invariant cache hit.
[2023-03-15 09:01:21] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 09:01:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:01:22] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-15 09:01:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-15 09:01:22] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:01:22] [INFO ] After 82ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-15 09:01:22] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-15 09:01:22] [INFO ] After 473ms 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 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-15 09:01:22] [INFO ] Invariant cache hit.
[2023-03-15 09:01:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-15 09:01:22] [INFO ] Invariant cache hit.
[2023-03-15 09:01:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 09:01:24] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2023-03-15 09:01:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 09:01:24] [INFO ] Invariant cache hit.
[2023-03-15 09:01:24] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 13 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-15 09:01:24] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-15 09:01:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 09:01:24] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-15 09:01:25] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:01:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 09:01:25] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-15 09:01:25] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:01:25] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:01:25] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-15 09:01:25] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 09:01:25] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 155 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 226 ms :[p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 25000 reset in 329 ms.
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 140 places in 3 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 141 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 145 place count 522 transition count 511
Deduced a syphon composed of 136 places in 3 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 522 transition count 511
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 226 places in 2 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 239 place count 522 transition count 529
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 240 place count 521 transition count 528
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 241 place count 521 transition count 528
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 245 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 261 place count 521 transition count 648
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 282 place count 500 transition count 606
Deduced a syphon composed of 224 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 303 place count 500 transition count 606
Deduced a syphon composed of 224 places in 2 ms
Applied a total of 303 rules in 204 ms. Remains 500 /527 variables (removed 27) and now considering 606/497 (removed -109) transitions.
[2023-03-15 09:01:27] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 606 rows 500 cols
[2023-03-15 09:01:27] [INFO ] Computed 49 place invariants in 33 ms
[2023-03-15 09:01:28] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 606/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 972 ms. Remains : 500/527 places, 606/497 transitions.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 40 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-15 09:01:28] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-15 09:01:28] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-15 09:01:28] [INFO ] Invariant cache hit.
[2023-03-15 09:01:31] [INFO ] Implicit Places using invariants and state equation in 3236 ms returned []
Implicit Place search using SMT with State Equation took 3854 ms to find 0 implicit places.
[2023-03-15 09:01:31] [INFO ] Invariant cache hit.
[2023-03-15 09:01:32] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4266 ms. Remains : 527/527 places, 497/497 transitions.
Treatment of property DoubleExponent-PT-010-LTLFireability-15 finished in 55808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U X(!p2)))))'
[2023-03-15 09:01:32] [INFO ] Flatten gal took : 46 ms
[2023-03-15 09:01:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 09:01:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 527 places, 497 transitions and 1392 arcs took 12 ms.
Total runtime 345519 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2507/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2507/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2507/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-010-LTLFireability-01
Could not compute solution for formula : DoubleExponent-PT-010-LTLFireability-12
Could not compute solution for formula : DoubleExponent-PT-010-LTLFireability-15

BK_STOP 1678870894909

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DoubleExponent-PT-010-LTLFireability-01
ltl formula formula --ltl=/tmp/2507/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 527 places, 497 transitions and 1392 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2507/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2507/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2507/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2507/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-010-LTLFireability-12
ltl formula formula --ltl=/tmp/2507/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 527 places, 497 transitions and 1392 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2507/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2507/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2507/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2507/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-010-LTLFireability-15
ltl formula formula --ltl=/tmp/2507/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 527 places, 497 transitions and 1392 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2507/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2507/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2507/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2507/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="DoubleExponent-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418500476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;