Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 110K Jun 3 16:02 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 AutonomousCar-PT-04b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654899506984

Running Version 202205111006
[2022-06-10 22:18:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:18:30] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2022-06-10 22:18:30] [INFO ] Transformed 221 places.
[2022-06-10 22:18:30] [INFO ] Transformed 368 transitions.
[2022-06-10 22:18:30] [INFO ] Found NUPN structural information;
[2022-06-10 22:18:30] [INFO ] Parsed PT model containing 221 places and 368 transitions in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-04b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 343
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 343
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 192 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 192 transition count 339
Applied a total of 58 rules in 117 ms. Remains 192 /221 variables (removed 29) and now considering 339/368 (removed 29) transitions.
// Phase 1: matrix 339 rows 192 cols
[2022-06-10 22:18:30] [INFO ] Computed 9 place invariants in 42 ms
[2022-06-10 22:18:31] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 339 rows 192 cols
[2022-06-10 22:18:31] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-10 22:18:31] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
// Phase 1: matrix 339 rows 192 cols
[2022-06-10 22:18:31] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-10 22:18:31] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/221 places, 339/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/221 places, 339/368 transitions.
Support contains 26 out of 192 places after structural reductions.
[2022-06-10 22:18:32] [INFO ] Flatten gal took : 135 ms
[2022-06-10 22:18:32] [INFO ] Flatten gal took : 64 ms
[2022-06-10 22:18:32] [INFO ] Input system was already deterministic with 339 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 339 rows 192 cols
[2022-06-10 22:18:33] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-10 22:18:33] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 22:18:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-10 22:18:33] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA AutonomousCar-PT-04b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 37 stabilizing places and 38 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!p0) U p1))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 184 transition count 331
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 184 transition count 331
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 181 transition count 328
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 181 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 180 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 180 transition count 327
Applied a total of 24 rules in 33 ms. Remains 180 /192 variables (removed 12) and now considering 327/339 (removed 12) transitions.
// Phase 1: matrix 327 rows 180 cols
[2022-06-10 22:18:34] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:18:34] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 327 rows 180 cols
[2022-06-10 22:18:34] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:18:34] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 327 rows 180 cols
[2022-06-10 22:18:34] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-10 22:18:35] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/192 places, 327/339 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/192 places, 327/339 transitions.
Stuttering acceptance computed with spot in 459 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1 1), p0:(OR (EQ s3 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 561 ms.
Product exploration explored 100000 steps with 50000 reset in 518 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Detected a total of 33/180 stabilizing places and 34/327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-04b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLCardinality-00 finished in 2761 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&F(p2)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 175 edges and 192 vertex of which 4 / 192 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 189 transition count 265
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 97 rules applied. Total rules applied 169 place count 118 transition count 239
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 184 place count 103 transition count 239
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 184 place count 103 transition count 232
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 198 place count 96 transition count 232
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 203 place count 91 transition count 227
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 91 transition count 227
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 272 place count 91 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 272 place count 91 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 90 transition count 162
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 344 place count 55 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 345 place count 55 transition count 125
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 352 place count 48 transition count 97
Iterating global reduction 5 with 7 rules applied. Total rules applied 359 place count 48 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 361 place count 48 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 365 place count 46 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 367 place count 45 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 43 transition count 104
Applied a total of 369 rules in 86 ms. Remains 43 /192 variables (removed 149) and now considering 104/339 (removed 235) transitions.
// Phase 1: matrix 104 rows 43 cols
[2022-06-10 22:18:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 104 rows 43 cols
[2022-06-10 22:18:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:18:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [38, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/192 places, 104/339 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 103
Applied a total of 2 rules in 14 ms. Remains 40 /41 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 40 cols
[2022-06-10 22:18:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 103 rows 40 cols
[2022-06-10 22:18:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:18:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/192 places, 103/339 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/192 places, 103/339 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s20 1), p1:(OR (EQ s2 0) (EQ s19 1)), p2:(EQ s26 0)], nbAcceptance=0, 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 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-01 finished in 603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 330
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 82 place count 183 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 180 transition count 263
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 179 transition count 262
Applied a total of 90 rules in 34 ms. Remains 179 /192 variables (removed 13) and now considering 262/339 (removed 77) transitions.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:37] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:37] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:37] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:38] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/192 places, 262/339 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/192 places, 262/339 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s166 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19 reset in 94 ms.
Product exploration explored 100000 steps with 2 reset in 174 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1782928 steps, run timeout after 3001 ms. (steps per millisecond=594 ) properties seen :{}
Probabilistic random walk after 1782928 steps, saw 275399 distinct states, run finished after 3001 ms. (steps per millisecond=594 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:41] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:18:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:18:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-06-10 22:18:42] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:18:42] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 5 ms to minimize.
[2022-06-10 22:18:42] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-06-10 22:18:42] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2022-06-10 22:18:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2022-06-10 22:18:42] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-10 22:18:42] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 179/179 places, 262/262 transitions.
Graph (trivial) has 168 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 518 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 175 transition count 190
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 95 rules applied. Total rules applied 165 place count 109 transition count 161
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 182 place count 92 transition count 161
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 182 place count 92 transition count 154
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 196 place count 85 transition count 154
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 274 place count 46 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 46 transition count 114
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 283 place count 38 transition count 78
Iterating global reduction 4 with 8 rules applied. Total rules applied 291 place count 38 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 295 place count 38 transition count 74
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 5 with 2 rules applied. Total rules applied 297 place count 37 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 299 place count 36 transition count 86
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 302 place count 36 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 305 place count 33 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 33 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 307 place count 32 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 308 place count 31 transition count 82
Applied a total of 308 rules in 82 ms. Remains 31 /179 variables (removed 148) and now considering 82/262 (removed 180) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/179 places, 82/262 transitions.
Finished random walk after 346 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=115 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 262/262 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:43] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:43] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-10 22:18:43] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:43] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-10 22:18:43] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/179 places, 262/262 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 869 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=434 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 119 ms.
Entered a terminal (fully accepting) state of product in 832 steps with 8 reset in 4 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-04 finished in 6846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(!(X(!X(X(p0))) U (X(p1)&&p2)))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 185 transition count 332
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 78 place count 185 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 183 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 183 transition count 266
Applied a total of 82 rules in 19 ms. Remains 183 /192 variables (removed 9) and now considering 266/339 (removed 73) transitions.
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:18:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:18:44] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:18:44] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 22:18:45] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:18:45] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-10 22:18:45] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/192 places, 266/339 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/192 places, 266/339 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND p1 p2), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=p2, acceptance={0} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=7 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=8 dest: 2}]], initial=0, aps=[p2:(OR (EQ s26 0) (EQ s167 1)), p1:(EQ s20 1), p0:(OR (EQ s108 0) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33267 reset in 141 ms.
Product exploration explored 100000 steps with 33256 reset in 410 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Detected a total of 33/183 stabilizing places and 34/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X p2)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 786 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 331 ms :[(AND p1 p2), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:18:47] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:47] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 22:18:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-10 22:18:48] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X p2)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 p1 (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (NOT p0)), (F (NOT p2)), (F (AND p2 p1)), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 887 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 11 states, 32 edges and 3 AP.
Stuttering acceptance computed with spot in 447 ms :[(AND p1 p2), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false, false, false, (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 416 ms :[(AND p1 p2), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false, false, false, (AND p1 p2 (NOT p0))]
Support contains 5 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 266/266 transitions.
Graph (trivial) has 163 edges and 183 vertex of which 2 / 183 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 181 transition count 204
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 82 rules applied. Total rules applied 143 place count 121 transition count 182
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 158 place count 108 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 106 transition count 180
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 160 place count 106 transition count 170
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 180 place count 96 transition count 170
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 256 place count 58 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 58 transition count 130
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 266 place count 49 transition count 93
Iterating global reduction 5 with 9 rules applied. Total rules applied 275 place count 49 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 279 place count 49 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 47 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 285 place count 46 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 287 place count 44 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 288 place count 43 transition count 98
Applied a total of 288 rules in 31 ms. Remains 43 /183 variables (removed 140) and now considering 98/266 (removed 168) transitions.
// Phase 1: matrix 98 rows 43 cols
[2022-06-10 22:18:49] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:18:49] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 98 rows 43 cols
[2022-06-10 22:18:49] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-10 22:18:50] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [34, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 153 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/183 places, 98/266 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 97
Applied a total of 2 rules in 6 ms. Remains 40 /41 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 40 cols
[2022-06-10 22:18:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:18:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 97 rows 40 cols
[2022-06-10 22:18:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:18:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:18:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/183 places, 97/266 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/183 places, 97/266 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/40 stabilizing places and 4/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
Knowledge based reduction with 10 factoid took 970 ms. Reduced automaton from 11 states, 32 edges and 3 AP to 11 states, 32 edges and 3 AP.
Stuttering acceptance computed with spot in 529 ms :[(AND p1 p2), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false, false, false, (AND p1 p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 97 rows 40 cols
[2022-06-10 22:18:51] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:18:51] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:18:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-10 22:18:51] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F p1), (F (NOT (AND p2 (NOT p1) p0))), (F (AND p2 (NOT p0))), (F (AND p2 p1)), (F (AND p2 (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p2 p1 p0))]
Knowledge based reduction with 11 factoid took 1666 ms. Reduced automaton from 11 states, 32 edges and 3 AP to 7 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 373 ms :[(AND p1 p2), false, p1, (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 375 ms :[(AND p1 p2), false, p1, (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false]
Stuttering acceptance computed with spot in 390 ms :[(AND p1 p2), false, p1, (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), false, false]
Product exploration explored 100000 steps with 27890 reset in 543 ms.
Product exploration explored 100000 steps with 27854 reset in 375 ms.
Built C files in :
/tmp/ltsmin12826379155751423947
[2022-06-10 22:18:55] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2022-06-10 22:18:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:18:55] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2022-06-10 22:18:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:18:55] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2022-06-10 22:18:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:18:55] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12826379155751423947
Running compilation step : cd /tmp/ltsmin12826379155751423947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 640 ms.
Running link step : cd /tmp/ltsmin12826379155751423947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12826379155751423947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11041901211979470772.hoa' '--buchi-type=spotba'
LTSmin run took 3597 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLCardinality-05 finished in 15389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(X(G(p0))) U G(p1)) U !p0))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 177 edges and 192 vertex of which 4 / 192 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 189 transition count 265
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 98 rules applied. Total rules applied 170 place count 118 transition count 238
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 187 place count 102 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 101 transition count 237
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 188 place count 101 transition count 230
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 202 place count 94 transition count 230
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 206 place count 90 transition count 226
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 89 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 89 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 214 place count 89 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 88 transition count 216
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 285 place count 53 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 286 place count 53 transition count 179
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 294 place count 45 transition count 118
Iterating global reduction 7 with 8 rules applied. Total rules applied 302 place count 45 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 305 place count 45 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 309 place count 43 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 311 place count 42 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 40 transition count 124
Applied a total of 313 rules in 45 ms. Remains 40 /192 variables (removed 152) and now considering 124/339 (removed 215) transitions.
// Phase 1: matrix 124 rows 40 cols
[2022-06-10 22:18:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:19:00] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 124 rows 40 cols
[2022-06-10 22:19:00] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 22:19:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-10 22:19:00] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/192 places, 124/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 39 /39 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 39/192 places, 124/339 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s12 0) (EQ s38 1)), p0:(OR (EQ s0 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 30861 reset in 175 ms.
Product exploration explored 100000 steps with 30755 reset in 268 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/39 stabilizing places and 7/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 497 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 454 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 124/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 39 cols
[2022-06-10 22:19:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:19:02] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 124 rows 39 cols
[2022-06-10 22:19:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:19:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:19:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 39 cols
[2022-06-10 22:19:02] [INFO ] Computed 7 place invariants in 9 ms
[2022-06-10 22:19:02] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 124/124 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/39 stabilizing places and 7/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 354 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 28 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 427 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 30789 reset in 217 ms.
Product exploration explored 100000 steps with 30717 reset in 237 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 142 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 39 /39 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2022-06-10 22:19:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 124 rows 39 cols
[2022-06-10 22:19:04] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:19:04] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 124/124 transitions.
Product exploration explored 100000 steps with 30782 reset in 672 ms.
Product exploration explored 100000 steps with 30804 reset in 579 ms.
Built C files in :
/tmp/ltsmin10399716031184580791
[2022-06-10 22:19:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10399716031184580791
Running compilation step : cd /tmp/ltsmin10399716031184580791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin10399716031184580791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10399716031184580791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15159960439720366014.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLCardinality-06 finished in 7011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 185 transition count 332
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 78 place count 185 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 183 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 183 transition count 266
Applied a total of 82 rules in 15 ms. Remains 183 /192 variables (removed 9) and now considering 266/339 (removed 73) transitions.
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:19:06] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:07] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:19:07] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:19:07] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 183 cols
[2022-06-10 22:19:07] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:07] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/192 places, 266/339 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/192 places, 266/339 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s167 0) (EQ s120 1) (AND (NEQ s166 0) (NEQ s12 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]]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-04b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLCardinality-08 finished in 1623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 179 edges and 192 vertex of which 4 / 192 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 189 transition count 265
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 98 rules applied. Total rules applied 170 place count 118 transition count 238
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 186 place count 102 transition count 238
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 186 place count 102 transition count 230
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 202 place count 94 transition count 230
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 208 place count 88 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 214 place count 88 transition count 224
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 278 place count 88 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 278 place count 88 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 87 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 86 transition count 155
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 86 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 284 place count 86 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 285 place count 85 transition count 153
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 355 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 50 transition count 116
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 363 place count 43 transition count 84
Iterating global reduction 7 with 7 rules applied. Total rules applied 370 place count 43 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 373 place count 43 transition count 81
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 8 with 2 rules applied. Total rules applied 375 place count 42 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 379 place count 40 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 381 place count 38 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 382 place count 37 transition count 91
Applied a total of 382 rules in 31 ms. Remains 37 /192 variables (removed 155) and now considering 91/339 (removed 248) transitions.
// Phase 1: matrix 91 rows 37 cols
[2022-06-10 22:19:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:19:08] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 91 rows 37 cols
[2022-06-10 22:19:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:19:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:19:08] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [30, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 141 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/192 places, 91/339 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 90
Applied a total of 2 rules in 4 ms. Remains 34 /35 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:19:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:19:08] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:19:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:19:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:19:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/192 places, 90/339 transitions.
Finished structural reductions, in 2 iterations. Remains : 34/192 places, 90/339 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 2 reset in 332 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:19:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 90 rows 34 cols
[2022-06-10 22:19:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-10 22:19:10] [INFO ] Redundant transitions in 14 ms returned [29]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 89 rows 34 cols
[2022-06-10 22:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:19:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 89/90 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 89
Applied a total of 2 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 32 cols
[2022-06-10 22:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 89 rows 32 cols
[2022-06-10 22:19:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/34 places, 89/90 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/34 places, 89/90 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 89 ms.
Product exploration explored 100000 steps with 15 reset in 102 ms.
Built C files in :
/tmp/ltsmin13100439627832407210
[2022-06-10 22:19:11] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2022-06-10 22:19:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:19:11] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2022-06-10 22:19:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:19:11] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2022-06-10 22:19:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:19:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13100439627832407210
Running compilation step : cd /tmp/ltsmin13100439627832407210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin13100439627832407210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13100439627832407210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1759062954276873365.hoa' '--buchi-type=spotba'
LTSmin run took 487 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLCardinality-09 finished in 3998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(X(G(!(F(p0)&&p0))) U p1))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 184 transition count 331
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 80 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 181 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 180 transition count 263
Applied a total of 88 rules in 12 ms. Remains 180 /192 variables (removed 12) and now considering 263/339 (removed 76) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:12] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:12] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:13] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/192 places, 263/339 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/192 places, 263/339 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p1, p1]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s20 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-12 finished in 579 ms.
All properties solved by simple procedures.
Total runtime 43638 ms.

BK_STOP 1654899553369

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873000467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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