Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716327528893

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 21:38:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:38:51] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-21 21:38:51] [INFO ] Transformed 65 places.
[2024-05-21 21:38:51] [INFO ] Transformed 417 transitions.
[2024-05-21 21:38:51] [INFO ] Found NUPN structural information;
[2024-05-21 21:38:51] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 244
Applied a total of 4 rules in 50 ms. Remains 63 /65 variables (removed 2) and now considering 244/258 (removed 14) transitions.
[2024-05-21 21:38:52] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 63 cols
[2024-05-21 21:38:52] [INFO ] Computed 11 invariants in 39 ms
[2024-05-21 21:38:52] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 21:38:52] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
[2024-05-21 21:38:52] [INFO ] Invariant cache hit.
[2024-05-21 21:38:53] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 21:38:53] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 811 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 244/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 916 ms. Remains : 61/65 places, 244/258 transitions.
Support contains 32 out of 61 places after structural reductions.
[2024-05-21 21:38:53] [INFO ] Flatten gal took : 159 ms
[2024-05-21 21:38:53] [INFO ] Flatten gal took : 80 ms
[2024-05-21 21:38:53] [INFO ] Input system was already deterministic with 244 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (2245 resets) in 2801 ms. (14 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40004 steps (220 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (197 resets) in 102 ms. (388 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (219 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (204 resets) in 118 ms. (336 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (214 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
[2024-05-21 21:38:55] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 61 cols
[2024-05-21 21:38:55] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 21:38:55] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/44 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/304 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 205 constraints, problems are : Problem set: 2 solved, 2 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 2/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/206 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/206 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/304 variables, 1/207 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/304 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 207 constraints, problems are : Problem set: 2 solved, 2 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1142ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 373 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 244/244 transitions.
Graph (complete) has 502 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 59 transition count 233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 53 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 52 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 47 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 47 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 200
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 44 transition count 194
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 70 place count 38 transition count 170
Applied a total of 70 rules in 107 ms. Remains 38 /61 variables (removed 23) and now considering 170/244 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 38/61 places, 170/244 transitions.
RANDOM walk for 40000 steps (269 resets) in 479 ms. (83 steps per ms) remains 1/2 properties
BEST_FIRST walk for 20761 steps (75 resets) in 118 ms. (174 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 11 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 21:38:57] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 21:38:57] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 21:38:57] [INFO ] Invariant cache hit.
[2024-05-21 21:38:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:38:57] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-21 21:38:57] [INFO ] Invariant cache hit.
[2024-05-21 21:38:57] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 21:39:02] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 13 ms to minimize.
[2024-05-21 21:39:02] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-21 21:39:02] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14925 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 25158 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 41453ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 41472ms
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 215/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41945 ms. Remains : 56/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 458 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 223 reset in 483 ms.
Product exploration explored 100000 steps with 183 reset in 180 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 36630 steps (2065 resets) in 237 ms. (153 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 21:39:41] [INFO ] Invariant cache hit.
[2024-05-21 21:39:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:39:41] [INFO ] Invariant cache hit.
[2024-05-21 21:39:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:39:41] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-21 21:39:41] [INFO ] Invariant cache hit.
[2024-05-21 21:39:41] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-21 21:39:46] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:39:46] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2024-05-21 21:39:46] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 16358 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 23285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 40609ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 40613ms
Finished structural reductions in LTL mode , in 1 iterations and 40923 ms. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 37571 steps (2178 resets) in 313 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 116 ms.
Product exploration explored 100000 steps with 18 reset in 521 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 56 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 56 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 56 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 55 transition count 216
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 219
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 37 ms. Remains 55 /56 variables (removed 1) and now considering 219/215 (removed -4) transitions.
[2024-05-21 21:40:24] [INFO ] Redundant transitions in 57 ms returned []
Running 218 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 55 cols
[2024-05-21 21:40:24] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 21:40:24] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 21:40:26] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 21:40:27] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 4 (OVERLAPS) 218/273 variables, 55/70 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 114/184 constraints. Problems are: Problem set: 15 solved, 203 unsolved
[2024-05-21 21:40:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/274 variables, 1/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 186 constraints, problems are : Problem set: 15 solved, 203 unsolved in 15008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 8/51 variables, 8/8 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 217/268 variables, 51/67 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 114/181 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 203/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 5/273 variables, 4/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 1/274 variables, 1/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 389 constraints, problems are : Problem set: 15 solved, 203 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 203/218 constraints, Known Traps: 8/8 constraints]
After SMT, in 45809ms problems are : Problem set: 15 solved, 203 unsolved
Search for dead transitions found 15 dead transitions in 45813ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 204/215 transitions.
Graph (complete) has 493 edges and 55 vertex of which 44 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 44 /55 variables (removed 11) and now considering 204/204 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/56 places, 204/215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45941 ms. Remains : 44/56 places, 204/215 transitions.
Built C files in :
/tmp/ltsmin1559044571202985387
[2024-05-21 21:41:10] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1559044571202985387
Running compilation step : cd /tmp/ltsmin1559044571202985387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1287 ms.
Running link step : cd /tmp/ltsmin1559044571202985387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin1559044571202985387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15817840435156754821.hoa' '--buchi-type=spotba'
LTSmin run took 4252 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 138996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 4 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 21:41:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:41:16] [INFO ] Implicit Places using invariants in 278 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(!p2)&&p1)))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 55 transition count 237
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 54 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 49 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 49 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 46 transition count 206
Applied a total of 30 rules in 50 ms. Remains 46 /61 variables (removed 15) and now considering 206/244 (removed 38) transitions.
// Phase 1: matrix 206 rows 46 cols
[2024-05-21 21:41:16] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 21:41:16] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 21:41:16] [INFO ] Invariant cache hit.
[2024-05-21 21:41:17] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-21 21:41:17] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-21 21:41:17] [INFO ] Redundant transitions in 29 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-21 21:41:17] [INFO ] Invariant cache hit.
[2024-05-21 21:41:17] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 205/251 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 112/166 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 21:41:22] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 168 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13982 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 205/251 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 112/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 373 constraints, problems are : Problem set: 0 solved, 205 unsolved in 24966 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
After SMT, in 39784ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 39789ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40248 ms. Remains : 46/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 40470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(F(p3)&&p2)||p0)))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 10 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 21:41:57] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 21:41:57] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 21:41:57] [INFO ] Invariant cache hit.
[2024-05-21 21:41:57] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:41:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:41:57] [INFO ] Invariant cache hit.
[2024-05-21 21:41:57] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:42:03] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:42:03] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-21 21:42:03] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2024-05-21 21:42:05] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 25018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 43218ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43223ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43637 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 314 steps with 18 reset in 3 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 43832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0&&(p1 U p2)))&&G(p0))))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-21 21:42:41] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 21:42:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:42:41] [INFO ] Invariant cache hit.
[2024-05-21 21:42:41] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:42:41] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:42:41] [INFO ] Invariant cache hit.
[2024-05-21 21:42:41] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:42:46] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:42:46] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-21 21:42:46] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2024-05-21 21:42:48] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28625 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 45596ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 45601ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45906 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 93 reset in 203 ms.
Product exploration explored 100000 steps with 5 reset in 216 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 300 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 37966 steps (2112 resets) in 521 ms. (72 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 711 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-21 21:43:29] [INFO ] Invariant cache hit.
[2024-05-21 21:43:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 21:43:29] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 21:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:43:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 21:43:30] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-21 21:43:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:43:30] [INFO ] [Nat]Added 117 Read/Feed constraints in 22 ms returned sat
[2024-05-21 21:43:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 87 ms.
[2024-05-21 21:43:30] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-21 21:43:30] [INFO ] Invariant cache hit.
[2024-05-21 21:43:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 21:43:30] [INFO ] Invariant cache hit.
[2024-05-21 21:43:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:43:30] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 21:43:30] [INFO ] Invariant cache hit.
[2024-05-21 21:43:30] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 21:43:35] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-05-21 21:43:35] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2024-05-21 21:43:35] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:43:37] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27541 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 43825ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43830ms
Finished structural reductions in LTL mode , in 1 iterations and 44205 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 37414 steps (2152 resets) in 435 ms. (85 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 481 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-21 21:44:16] [INFO ] Invariant cache hit.
[2024-05-21 21:44:16] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 21:44:16] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-21 21:44:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:44:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 21:44:16] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 21:44:16] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-21 21:44:16] [INFO ] [Nat]Added 117 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:44:16] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 69 ms.
[2024-05-21 21:44:17] [INFO ] Added : 1 causal constraints over 1 iterations in 116 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 68 reset in 80 ms.
Product exploration explored 100000 steps with 109 reset in 81 ms.
Built C files in :
/tmp/ltsmin2084736337580412981
[2024-05-21 21:44:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2084736337580412981
Running compilation step : cd /tmp/ltsmin2084736337580412981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 902 ms.
Running link step : cd /tmp/ltsmin2084736337580412981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2084736337580412981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16141007648586201005.hoa' '--buchi-type=spotba'
LTSmin run took 627 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 98083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0) U p1)&&F(p2)))))'
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 3 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-21 21:44:19] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:44:19] [INFO ] Implicit Places using invariants in 166 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 229
Applied a total of 6 rules in 17 ms. Remains 58 /61 variables (removed 3) and now considering 229/244 (removed 15) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 21:44:19] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 21:44:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:44:19] [INFO ] Invariant cache hit.
[2024-05-21 21:44:19] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:44:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:44:20] [INFO ] Invariant cache hit.
[2024-05-21 21:44:20] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 21:44:25] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-21 21:44:25] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2024-05-21 21:44:25] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2024-05-21 21:44:27] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17496 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 48378ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48383ms
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 229/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48682 ms. Remains : 58/61 places, 229/244 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p2 p0), (NOT p1), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 8 reset in 107 ms.
Product exploration explored 100000 steps with 43 reset in 181 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2232 resets) in 411 ms. (97 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (212 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (206 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
[2024-05-21 21:45:09] [INFO ] Invariant cache hit.
[2024-05-21 21:45:09] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/286 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 48 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 39/58 places, 165/229 transitions.
RANDOM walk for 26321 steps (40 resets) in 290 ms. (90 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 418 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 360 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-21 21:45:12] [INFO ] Invariant cache hit.
[2024-05-21 21:45:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 21:45:12] [INFO ] Invariant cache hit.
[2024-05-21 21:45:12] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:45:12] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:45:12] [INFO ] Invariant cache hit.
[2024-05-21 21:45:12] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 21:45:17] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-05-21 21:45:17] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:45:17] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-21 21:45:19] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 14868 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 29517 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 45004ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 45007ms
Finished structural reductions in LTL mode , in 1 iterations and 45307 ms. Remains : 58/58 places, 229/229 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2213 resets) in 269 ms. (148 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (199 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (209 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-21 21:45:58] [INFO ] Invariant cache hit.
[2024-05-21 21:45:58] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/286 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 868ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 43 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 39/58 places, 165/229 transitions.
RANDOM walk for 34335 steps (74 resets) in 317 ms. (107 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 455 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 53 reset in 169 ms.
Product exploration explored 100000 steps with 27 reset in 182 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 476 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 58 transition count 231
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 58 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 34 ms. Remains 58 /58 variables (removed 0) and now considering 234/229 (removed -5) transitions.
[2024-05-21 21:46:02] [INFO ] Redundant transitions in 29 ms returned []
Running 233 sub problems to find dead transitions.
// Phase 1: matrix 234 rows 58 cols
[2024-05-21 21:46:02] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 21:46:02] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 21:46:04] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 21:46:04] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 21:46:05] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 21:46:05] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 21:46:05] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 21:46:05] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 21:46:05] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (OVERLAPS) 233/291 variables, 58/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-05-21 21:46:10] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-21 21:46:10] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 2/201 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-05-21 21:46:14] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/292 variables, 1/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 203 constraints, problems are : Problem set: 14 solved, 219 unsolved in 18653 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 14 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 8/55 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 10/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 232/287 variables, 55/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 219/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 4/291 variables, 3/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/292 variables, 1/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 422 constraints, problems are : Problem set: 14 solved, 219 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 219/233 constraints, Known Traps: 10/10 constraints]
After SMT, in 49678ms problems are : Problem set: 14 solved, 219 unsolved
Search for dead transitions found 14 dead transitions in 49684ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/58 places, 220/229 transitions.
Graph (complete) has 511 edges and 58 vertex of which 48 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 48 /58 variables (removed 10) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/58 places, 220/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49775 ms. Remains : 48/58 places, 220/229 transitions.
Built C files in :
/tmp/ltsmin3711763140544326767
[2024-05-21 21:46:52] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3711763140544326767
Running compilation step : cd /tmp/ltsmin3711763140544326767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1172 ms.
Running link step : cd /tmp/ltsmin3711763140544326767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3711763140544326767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11012062509151512558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-21 21:47:07] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:47:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:47:07] [INFO ] Invariant cache hit.
[2024-05-21 21:47:07] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:47:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:47:07] [INFO ] Invariant cache hit.
[2024-05-21 21:47:07] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 21:47:12] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:47:12] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-05-21 21:47:13] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2024-05-21 21:47:14] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17983 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 29894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 48671ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48675ms
Finished structural reductions in LTL mode , in 1 iterations and 48935 ms. Remains : 58/58 places, 229/229 transitions.
Built C files in :
/tmp/ltsmin16173942572121886600
[2024-05-21 21:47:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16173942572121886600
Running compilation step : cd /tmp/ltsmin16173942572121886600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1028 ms.
Running link step : cd /tmp/ltsmin16173942572121886600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16173942572121886600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11544369900575333432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:48:11] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:48:11] [INFO ] Flatten gal took : 35 ms
[2024-05-21 21:48:11] [INFO ] Time to serialize gal into /tmp/LTL8442135742736082695.gal : 6 ms
[2024-05-21 21:48:11] [INFO ] Time to serialize properties into /tmp/LTL13439799313140263842.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8442135742736082695.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11502289850037028121.hoa' '-atoms' '/tmp/LTL13439799313140263842.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13439799313140263842.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11502289850037028121.hoa
Detected timeout of ITS tools.
[2024-05-21 21:48:26] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:48:26] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:48:26] [INFO ] Time to serialize gal into /tmp/LTL9309420284298821112.gal : 6 ms
[2024-05-21 21:48:26] [INFO ] Time to serialize properties into /tmp/LTL10996424043865647962.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9309420284298821112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10996424043865647962.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!("(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))"))U(X(X((F("((((p16==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p...281
Formula 0 simplified : "(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))" R XX(G!"((((p16==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p58==1))...256
Detected timeout of ITS tools.
[2024-05-21 21:48:41] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:48:41] [INFO ] Applying decomposition
[2024-05-21 21:48:41] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14039385331461591065.txt' '-o' '/tmp/graph14039385331461591065.bin' '-w' '/tmp/graph14039385331461591065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14039385331461591065.bin' '-l' '-1' '-v' '-w' '/tmp/graph14039385331461591065.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:48:41] [INFO ] Decomposing Gal with order
[2024-05-21 21:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:48:41] [INFO ] Removed a total of 776 redundant transitions.
[2024-05-21 21:48:42] [INFO ] Flatten gal took : 161 ms
[2024-05-21 21:48:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 13 ms.
[2024-05-21 21:48:42] [INFO ] Time to serialize gal into /tmp/LTL644197785972212636.gal : 5 ms
[2024-05-21 21:48:42] [INFO ] Time to serialize properties into /tmp/LTL1056433584115181946.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL644197785972212636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1056433584115181946.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((!("(((i9.u21.p1==1)&&(i9.u21.p7==1))&&((u8.p26==1)&&(i9.u21.p57==1)))"))U(X(X((F("((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)...396
Formula 0 simplified : "(((i9.u21.p1==1)&&(i9.u21.p7==1))&&((u8.p26==1)&&(i9.u21.p57==1)))" R XX(G!"((((i1.u3.p16==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i5.u...371
Reverse transition relation is NOT exact ! Due to transitions t93, t129, t190, u2.t29, u2.t30, u8.t19, u8.t20, i1.u3.t28, i2.u5.t25, i2.u6.t23, i4.u9.t18, ...387
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 277518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(G(p1))))&&G(F(p0))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 54 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 54 transition count 236
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 53 transition count 236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 49 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 49 transition count 208
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 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 206
Applied a total of 28 rules in 24 ms. Remains 47 /61 variables (removed 14) and now considering 206/244 (removed 38) transitions.
[2024-05-21 21:48:57] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
// Phase 1: matrix 205 rows 47 cols
[2024-05-21 21:48:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 21:48:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 21:48:57] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-21 21:48:57] [INFO ] Invariant cache hit.
[2024-05-21 21:48:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:48:57] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-21 21:48:57] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-21 21:48:57] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-21 21:48:57] [INFO ] Invariant cache hit.
[2024-05-21 21:48:57] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 21:48:59] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-21 21:49:00] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 169 constraints, problems are : Problem set: 0 solved, 205 unsolved in 11488 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 374 constraints, problems are : Problem set: 0 solved, 205 unsolved in 24571 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
After SMT, in 36962ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 36965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37251 ms. Remains : 47/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 37470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
[2024-05-21 21:49:34] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4330997354834530462
[2024-05-21 21:49:34] [INFO ] Applying decomposition
[2024-05-21 21:49:34] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2024-05-21 21:49:34] [INFO ] Flatten gal took : 38 ms
[2024-05-21 21:49:34] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:49:34] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2024-05-21 21:49:35] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17207871165109117106.txt' '-o' '/tmp/graph17207871165109117106.bin' '-w' '/tmp/graph17207871165109117106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17207871165109117106.bin' '-l' '-1' '-v' '-w' '/tmp/graph17207871165109117106.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:49:35] [INFO ] Decomposing Gal with order
[2024-05-21 21:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:49:35] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2024-05-21 21:49:35] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:49:35] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4330997354834530462
Running compilation step : cd /tmp/ltsmin4330997354834530462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 21:49:35] [INFO ] Removed a total of 778 redundant transitions.
[2024-05-21 21:49:35] [INFO ] Flatten gal took : 76 ms
[2024-05-21 21:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2024-05-21 21:49:35] [INFO ] Time to serialize gal into /tmp/LTLFireability14980884579300106408.gal : 5 ms
[2024-05-21 21:49:35] [INFO ] Time to serialize properties into /tmp/LTLFireability1724630779643500767.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14980884579300106408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1724630779643500767.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((!("(((u20.p1==1)&&(u20.p7==1))&&((u7.p26==1)&&(u20.p57==1)))"))U(X(X((F("((((i1.u2.p16==1)&&(i3.u5.p23==1))&&((u7.p27==1)&&(i5.u11...367
Formula 0 simplified : "(((u20.p1==1)&&(u20.p7==1))&&((u7.p26==1)&&(u20.p57==1)))" R XX(G!"((((i1.u2.p16==1)&&(i3.u5.p23==1))&&((u7.p27==1)&&(i5.u11.p37==1...342
Reverse transition relation is NOT exact ! Due to transitions t74, t104, t134, t164, t190, t222, u1.t29, u1.t30, u4.t24, u4.t25, u13.t10, u13.t11, u7.t19, ...395
Computing Next relation with stutter on 10130 deadlock states
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin4330997354834530462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4330997354834530462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true) U X(X((<>((LTLAPp1==true))||[]((!(LTLAPp0==true)||X(!(LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 107398 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 753167 ms.

BK_STOP 1716328284543

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06a"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167400300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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